ghc-6.10.1: The GHC API Contents Index

UniqSet

Contents Unique set type Manipulating these sets

Synopsis

type UniqSet a = UniqFM a mkUniqSet :: Uniquable a => [a] -> UniqSet a uniqSetToList :: UniqSet a -> [a] emptyUniqSet :: UniqSet a unitUniqSet :: Uniquable a => a -> UniqSet a addOneToUniqSet :: Uniquable a => UniqSet a -> a -> UniqSet a addListToUniqSet :: Uniquable a => UniqSet a -> [a] -> UniqSet a addOneToUniqSet_C :: Uniquable a => (a -> a -> a) -> UniqSet a -> a -> UniqSet a delOneFromUniqSet :: Uniquable a => UniqSet a -> a -> UniqSet a delListFromUniqSet :: Uniquable a => UniqSet a -> [a] -> UniqSet a delOneFromUniqSet_Directly :: Uniquable a => UniqSet a -> Unique -> UniqSet a unionUniqSets :: UniqSet a -> UniqSet a -> UniqSet a unionManyUniqSets :: [UniqSet a] -> UniqSet a minusUniqSet :: UniqSet a -> UniqSet a -> UniqSet a elementOfUniqSet :: Uniquable a => a -> UniqSet a -> Bool mapUniqSet :: (a -> a) -> UniqSet a -> UniqSet a intersectUniqSets :: UniqSet a -> UniqSet a -> UniqSet a isEmptyUniqSet :: UniqSet a -> Bool filterUniqSet :: (a -> Bool) -> UniqSet a -> UniqSet a sizeUniqSet :: UniqSet a -> Int foldUniqSet :: (a -> b -> b) -> b -> UniqSet a -> b elemUniqSet_Directly :: Unique -> UniqSet a -> Bool lookupUniqSet :: Uniquable a => UniqSet a -> a -> Maybe a hashUniqSet :: UniqSet a -> Int

Unique set type

type UniqSet a = UniqFM a

Manipulating these sets

mkUniqSet :: Uniquable a => [a] -> UniqSet a

uniqSetToList :: UniqSet a -> [a]

emptyUniqSet :: UniqSet a

unitUniqSet :: Uniquable a => a -> UniqSet a

addOneToUniqSet :: Uniquable a => UniqSet a -> a -> UniqSet a

addListToUniqSet :: Uniquable a => UniqSet a -> [a] -> UniqSet a

addOneToUniqSet_C :: Uniquable a => (a -> a -> a) -> UniqSet a -> a -> UniqSet a

delOneFromUniqSet :: Uniquable a => UniqSet a -> a -> UniqSet a

delListFromUniqSet :: Uniquable a => UniqSet a -> [a] -> UniqSet a

delOneFromUniqSet_Directly :: Uniquable a => UniqSet a -> Unique -> UniqSet a

unionUniqSets :: UniqSet a -> UniqSet a -> UniqSet a

unionManyUniqSets :: [UniqSet a] -> UniqSet a

minusUniqSet :: UniqSet a -> UniqSet a -> UniqSet a

elementOfUniqSet :: Uniquable a => a -> UniqSet a -> Bool

mapUniqSet :: (a -> a) -> UniqSet a -> UniqSet a

Invariant: the mapping function doesn't change the unique

intersectUniqSets :: UniqSet a -> UniqSet a -> UniqSet a

isEmptyUniqSet :: UniqSet a -> Bool

filterUniqSet :: (a -> Bool) -> UniqSet a -> UniqSet a

sizeUniqSet :: UniqSet a -> Int

foldUniqSet :: (a -> b -> b) -> b -> UniqSet a -> b

elemUniqSet_Directly :: Unique -> UniqSet a -> Bool

lookupUniqSet :: Uniquable a => UniqSet a -> a -> Maybe a

hashUniqSet :: UniqSet a -> Int

Produced by Haddock version 2.3.0