ghc-6.12.2: The GHC API Source code Contents Index

FiniteMap

Contents Mappings keyed from arbitrary types Manipulating those mappings

Synopsis

data FiniteMap key elt emptyFM :: FiniteMap key elt unitFM :: key -> elt -> FiniteMap key elt listToFM :: Ord key => [(key, elt)] -> FiniteMap key elt addToFM :: Ord key => FiniteMap key elt -> key -> elt -> FiniteMap key elt addToFM_C :: Ord key => (elt -> elt -> elt) -> FiniteMap key elt -> key -> elt -> FiniteMap key elt addListToFM :: Ord key => FiniteMap key elt -> [(key, elt)] -> FiniteMap key elt addListToFM_C :: Ord key => (elt -> elt -> elt) -> FiniteMap key elt -> [(key, elt)] -> FiniteMap key elt delFromFM :: Ord key => FiniteMap key elt -> key -> FiniteMap key elt delListFromFM :: Ord key => FiniteMap key elt -> [key] -> FiniteMap key elt plusFM :: Ord key => FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt plusFM_C :: Ord key => (elt -> elt -> elt) -> FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt minusFM :: Ord key => FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt foldFM :: (key -> elt -> a -> a) -> a -> FiniteMap key elt -> a intersectFM :: Ord key => FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt intersectFM_C :: Ord key => (elt1 -> elt2 -> elt3) -> FiniteMap key elt1 -> FiniteMap key elt2 -> FiniteMap key elt3 mapFM :: (key -> elt1 -> elt2) -> FiniteMap key elt1 -> FiniteMap key elt2 filterFM :: Ord key => (key -> elt -> Bool) -> FiniteMap key elt -> FiniteMap key elt sizeFM :: FiniteMap key elt -> Int isEmptyFM :: FiniteMap key elt -> Bool elemFM :: Ord key => key -> FiniteMap key elt -> Bool lookupFM :: Ord key => FiniteMap key elt -> key -> Maybe elt lookupWithDefaultFM :: Ord key => FiniteMap key elt -> elt -> key -> elt fmToList :: FiniteMap key elt -> [(key, elt)] keysFM :: FiniteMap key elt -> [key] eltsFM :: FiniteMap key elt -> [elt] bagToFM :: Ord key => Bag (key, elt) -> FiniteMap key elt

Mappings keyed from arbitrary types

data FiniteMap key elt Source

A finite mapping from (orderable) key types to elements Instances (Outputable key, Outputable elt) => Outputable (FiniteMap key elt)

Manipulating those mappings

emptyFM :: FiniteMap key elt Source

unitFM :: key -> elt -> FiniteMap key elt Source

listToFM :: Ord key => [(key, elt)] -> FiniteMap key elt Source

In the case of duplicates keys, the last item is taken

addToFM :: Ord key => FiniteMap key elt -> key -> elt -> FiniteMap key elt Source

Throws away any previous binding

addToFM_C :: Ord key => (elt -> elt -> elt) -> FiniteMap key elt -> key -> elt -> FiniteMap key elt Source

Combines added item with previous item, if any

addListToFM :: Ord key => FiniteMap key elt -> [(key, elt)] -> FiniteMap key elt Source

Throws away any previous binding, items are added left-to-right

addListToFM_C :: Ord key => (elt -> elt -> elt) -> FiniteMap key elt -> [(key, elt)] -> FiniteMap key elt Source

Combines added item with previous item, if any, items are added left-to-right

delFromFM :: Ord key => FiniteMap key elt -> key -> FiniteMap key elt Source

Deletion doesn't complain if you try to delete something which isn't there

delListFromFM :: Ord key => FiniteMap key elt -> [key] -> FiniteMap key elt Source

Deletion doesn't complain if you try to delete something which isn't there

plusFM :: Ord key => FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt Source

Bindings in right argument shadow those in the left

plusFM_C :: Ord key => (elt -> elt -> elt) -> FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt Source

Combines bindings for the same thing with the given function, bindings in right argument shadow those in the left

minusFM :: Ord key => FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt Source

Deletes from the left argument any bindings in the right argument

foldFM :: (key -> elt -> a -> a) -> a -> FiniteMap key elt -> a Source

intersectFM :: Ord key => FiniteMap key elt -> FiniteMap key elt -> FiniteMap key elt Source

intersectFM_C :: Ord key => (elt1 -> elt2 -> elt3) -> FiniteMap key elt1 -> FiniteMap key elt2 -> FiniteMap key elt3 Source

Combines bindings for the same thing in the two maps with the given function

mapFM :: (key -> elt1 -> elt2) -> FiniteMap key elt1 -> FiniteMap key elt2 Source

filterFM :: Ord key => (key -> elt -> Bool) -> FiniteMap key elt -> FiniteMap key elt Source

sizeFM :: FiniteMap key elt -> Int Source

isEmptyFM :: FiniteMap key elt -> Bool Source

elemFM :: Ord key => key -> FiniteMap key elt -> Bool Source

lookupFM :: Ord key => FiniteMap key elt -> key -> Maybe elt Source

lookupWithDefaultFM :: Ord key => FiniteMap key elt -> elt -> key -> elt Source

Supplies a default element in return for an unmapped key

fmToList :: FiniteMap key elt -> [(key, elt)] Source

keysFM :: FiniteMap key elt -> [key] Source

eltsFM :: FiniteMap key elt -> [elt] Source

bagToFM :: Ord key => Bag (key, elt) -> FiniteMap key elt Source

In the case of duplicate keys, who knows which item is taken

Produced by Haddock version 2.6.1