Safe Haskell | None |
---|---|

Language | Haskell2010 |

## Synopsis

- data UniqDSet a
- getUniqDSet :: UniqDSet a -> UniqDFM a
- pprUniqDSet :: (a -> SDoc) -> UniqDSet a -> SDoc
- delOneFromUniqDSet :: Uniquable a => UniqDSet a -> a -> UniqDSet a
- delListFromUniqDSet :: Uniquable a => UniqDSet a -> [a] -> UniqDSet a
- emptyUniqDSet :: UniqDSet a
- unitUniqDSet :: Uniquable a => a -> UniqDSet a
- mkUniqDSet :: Uniquable a => [a] -> UniqDSet a
- addOneToUniqDSet :: Uniquable a => UniqDSet a -> a -> UniqDSet a
- addListToUniqDSet :: Uniquable a => UniqDSet a -> [a] -> UniqDSet a
- unionUniqDSets :: UniqDSet a -> UniqDSet a -> UniqDSet a
- unionManyUniqDSets :: [UniqDSet a] -> UniqDSet a
- minusUniqDSet :: UniqDSet a -> UniqDSet a -> UniqDSet a
- uniqDSetMinusUniqSet :: UniqDSet a -> UniqSet b -> UniqDSet a
- intersectUniqDSets :: UniqDSet a -> UniqDSet a -> UniqDSet a
- uniqDSetIntersectUniqSet :: UniqDSet a -> UniqSet b -> UniqDSet a
- foldUniqDSet :: (a -> b -> b) -> b -> UniqDSet a -> b
- elementOfUniqDSet :: Uniquable a => a -> UniqDSet a -> Bool
- filterUniqDSet :: (a -> Bool) -> UniqDSet a -> UniqDSet a
- sizeUniqDSet :: UniqDSet a -> Int
- isEmptyUniqDSet :: UniqDSet a -> Bool
- lookupUniqDSet :: Uniquable a => UniqDSet a -> a -> Maybe a
- uniqDSetToList :: UniqDSet a -> [a]
- partitionUniqDSet :: (a -> Bool) -> UniqDSet a -> (UniqDSet a, UniqDSet a)
- mapUniqDSet :: Uniquable b => (a -> b) -> UniqDSet a -> UniqDSet b

# Unique set type

#### Instances

Eq (UniqDSet a) Source # | |

Data a => Data (UniqDSet a) Source # | |

Defined in UniqDSet gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> UniqDSet a -> c (UniqDSet a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (UniqDSet a) # toConstr :: UniqDSet a -> Constr # dataTypeOf :: UniqDSet a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (UniqDSet a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (UniqDSet a)) # gmapT :: (forall b. Data b => b -> b) -> UniqDSet a -> UniqDSet a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> UniqDSet a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> UniqDSet a -> r # gmapQ :: (forall d. Data d => d -> u) -> UniqDSet a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> UniqDSet a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> UniqDSet a -> m (UniqDSet a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> UniqDSet a -> m (UniqDSet a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> UniqDSet a -> m (UniqDSet a) # | |

Semigroup (UniqDSet a) Source # | |

Monoid (UniqDSet a) Source # | |

Outputable a => Outputable (UniqDSet a) Source # | |

getUniqDSet :: UniqDSet a -> UniqDFM a Source #

## Manipulating these sets

emptyUniqDSet :: UniqDSet a Source #

unitUniqDSet :: Uniquable a => a -> UniqDSet a Source #

mkUniqDSet :: Uniquable a => [a] -> UniqDSet a Source #

unionManyUniqDSets :: [UniqDSet a] -> UniqDSet a Source #

foldUniqDSet :: (a -> b -> b) -> b -> UniqDSet a -> b Source #

sizeUniqDSet :: UniqDSet a -> Int Source #

isEmptyUniqDSet :: UniqDSet a -> Bool Source #

uniqDSetToList :: UniqDSet a -> [a] Source #