UniqSet

Unique set type

data UniqSet a

Instances

Eq (UniqSet a)

Methods

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

(/=) :: UniqSet a -> UniqSet a -> Bool

Data a => Data (UniqSet a)

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> UniqSet a -> c (UniqSet a)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (UniqSet a)

toConstr :: UniqSet a -> Constr

dataTypeOf :: UniqSet a -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (UniqSet a))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (UniqSet a))

gmapT :: (forall b. Data b => b -> b) -> UniqSet a -> UniqSet a

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> UniqSet a -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> UniqSet a -> r

gmapQ :: (forall d. Data d => d -> u) -> UniqSet a -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> UniqSet a -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> UniqSet a -> m (UniqSet a)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> UniqSet a -> m (UniqSet a)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> UniqSet a -> m (UniqSet a)

Semigroup (UniqSet a)

Methods

(<>) :: UniqSet a -> UniqSet a -> UniqSet a

sconcat :: NonEmpty (UniqSet a) -> UniqSet a

stimes :: Integral b => b -> UniqSet a -> UniqSet a

Monoid (UniqSet a)

Methods

mempty :: UniqSet a

mappend :: UniqSet a -> UniqSet a -> UniqSet a

mconcat :: [UniqSet a] -> UniqSet a

Outputable a => Outputable (UniqSet a)

Methods

ppr :: UniqSet a -> SDoc

pprPrec :: Rational -> UniqSet a -> SDoc

getUniqSet :: UniqSet a -> UniqFM a

pprUniqSet :: (a -> SDoc) -> UniqSet a -> SDoc

Manipulating these sets

emptyUniqSet :: UniqSet a

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

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

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

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

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

delOneFromUniqSet_Directly :: UniqSet a -> Unique -> UniqSet a

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

delListFromUniqSet_Directly :: UniqSet a -> [Unique] -> UniqSet a

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

unionManyUniqSets :: [UniqSet a] -> UniqSet a

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

uniqSetMinusUFM :: UniqSet a -> UniqFM b -> UniqSet a

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

restrictUniqSetToUFM :: UniqSet a -> UniqFM b -> UniqSet a

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

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

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

elemUniqSet_Directly :: Unique -> UniqSet a -> Bool

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

filterUniqSet_Directly :: (Unique -> elt -> Bool) -> UniqSet elt -> UniqSet elt

sizeUniqSet :: UniqSet a -> Int

isEmptyUniqSet :: UniqSet a -> Bool

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

lookupUniqSet_Directly :: UniqSet a -> Unique -> Maybe a

partitionUniqSet :: (a -> Bool) -> UniqSet a -> (UniqSet a, UniqSet a)

mapUniqSet :: Uniquable b => (a -> b) -> UniqSet a -> UniqSet b

unsafeUFMToUniqSet :: UniqFM a -> UniqSet a

unsafeUFMToUniqSet converts a UniqFM a into a UniqSet a assuming, without checking, that it maps each Unique to a value that has that Unique. See Note [UniqSet invariant].

nonDetEltsUniqSet :: UniqSet elt -> [elt]

nonDetKeysUniqSet :: UniqSet elt -> [Unique]

nonDetFoldUniqSet :: (elt -> a -> a) -> a -> UniqSet elt -> a

nonDetFoldUniqSet_Directly :: (Unique -> elt -> a -> a) -> a -> UniqSet elt -> a