Moduleghc-lib-parser-9.14.1.20251220GHC2021

GHC.Types.Unique.DSet

Specialised deterministic sets, for things with Uniques

Based on UniqDFMs (as you would expect). See Note [Deterministic UniqFM] in GHC.Types.Unique.DFM for explanation why we need it.

Basically, the things need to be in class Uniquable.

Contents

Unique set type
Manipulating these sets

Synopsis

newtype UniqDSet
value getUniqDSet
value pprUniqDSet
value delOneFromUniqDSet
value delListFromUniqDSet
value emptyUniqDSet
value unitUniqDSet
value mkUniqDSet
value addOneToUniqDSet
value addListToUniqDSet
value unionUniqDSets
value unionManyUniqDSets
value minusUniqDSet
value uniqDSetMinusUniqSet
value intersectUniqDSets
value uniqDSetIntersectUniqSet
value nonDetStrictFoldUniqDSet
value elementOfUniqDSet
value filterUniqDSet
value sizeUniqDSet
value isEmptyUniqDSet
value lookupUniqDSet
value uniqDSetToList
value partitionUniqDSet
value mapUniqDSet
value strictFoldUniqDSet
value mapMUniqDSet

Packageghc-lib-parser-9.14.1.20251220
Exports27
LanguageGHC2021
LicenceBSD-3-Clause
SourceDSet.hs

Unique set type

newtypenewtype UniqDSet a

Instances3Eq, Data, Outputable

Eq (UniqDSet a)Defined in ghc-lib-parser-9.14.1.20251220 · GHC.Types.Unique.DSet
Data a => Data (UniqDSet a)Defined in ghc-lib-parser-9.14.1.20251220 · GHC.Types.Unique.DSet
Outputable a => Outputable (UniqDSet a)Defined in ghc-lib-parser-9.14.1.20251220 · GHC.Types.Unique.DSet

valuegetUniqDSet :: UniqDSet a -> UniqDFM a a

valuepprUniqDSet :: (a -> SDoc) -> UniqDSet a -> SDoc

Manipulating these sets

valuedelOneFromUniqDSet :: Uniquable a => UniqDSet a -> a -> UniqDSet a

valuedelListFromUniqDSet :: Uniquable a => UniqDSet a -> [a] -> UniqDSet a

valueemptyUniqDSet :: UniqDSet a

valueunitUniqDSet :: Uniquable a => a -> UniqDSet a

valuemkUniqDSet :: Uniquable a => [a] -> UniqDSet a

valueaddOneToUniqDSet :: Uniquable a => UniqDSet a -> a -> UniqDSet a

valueaddListToUniqDSet :: Uniquable a => UniqDSet a -> [a] -> UniqDSet a

valueunionUniqDSets :: UniqDSet a -> UniqDSet a -> UniqDSet a

valueunionManyUniqDSets :: [UniqDSet a] -> UniqDSet a

valueminusUniqDSet :: UniqDSet a -> UniqDSet a -> UniqDSet a

valueuniqDSetMinusUniqSet :: UniqDSet a -> UniqSet a -> UniqDSet a

valueintersectUniqDSets :: UniqDSet a -> UniqDSet a -> UniqDSet a

valueuniqDSetIntersectUniqSet :: UniqDSet a -> UniqSet a -> UniqDSet a

valuenonDetStrictFoldUniqDSet :: (a -> b -> b) -> b -> UniqDSet a -> b

valueelementOfUniqDSet :: Uniquable a => a -> UniqDSet a -> Bool

valuefilterUniqDSet :: (a -> Bool) -> UniqDSet a -> UniqDSet a

valuesizeUniqDSet :: UniqDSet a -> Int

valueisEmptyUniqDSet :: UniqDSet a -> Bool

valuelookupUniqDSet :: Uniquable a => UniqDSet a -> a -> Maybe a

valueuniqDSetToList :: UniqDSet a -> [a]

valuepartitionUniqDSet :: (a -> Bool) -> UniqDSet a -> (UniqDSet a, UniqDSet a)

valuemapUniqDSet :: Uniquable b => (a -> b) -> UniqDSet a -> UniqDSet b

valuestrictFoldUniqDSet :: (a -> r -> r) -> r -> UniqDSet a -> r

valuemapMUniqDSet

:: (Monad m, Uniquable b)
=> a -> m b
-> UniqDSet a
-> m (UniqDSet b)

Source#

Like mapUniqDSet but for mapM. Assumes the function we are mapping over the UniqDSet does not modify uniques, as per Note [UniqSet invariant] in GHC.Types.Unique.Set.