Moduleghc-lib-parser-9.14.1.20251220GHC2021

GHC.Types.Unique.DFM

Contents

Unique-keyed deterministic mappings
Manipulating those mappings

Synopsis

data UniqDFM
value emptyUDFM
value unitUDFM
value addToUDFM
value addToUDFM_C
value addToUDFM_C_Directly
value addToUDFM_Directly
value addListToUDFM
value delFromUDFM
value delListFromUDFM
value adjustUDFM
value adjustUDFM_Directly
value alterUDFM
value mapUDFM
value mapMaybeUDFM
value mapMUDFM
value plusUDFM
value plusUDFM_C
value plusUDFM_CK
value lookupUDFM
value lookupUDFM_Directly
value elemUDFM
value foldUDFM
value foldWithKeyUDFM
value eltsUDFM
value filterUDFM
value filterUDFM_Directly
value isNullUDFM
value sizeUDFM
value intersectUDFM
value udfmIntersectUFM
value disjointUDFM
value disjointUdfmUfm
value equalKeysUDFM
value minusUDFM
value listToUDFM
value listToUDFM_Directly
value listToUDFM_C_Directly
value udfmMinusUFM
value ufmMinusUDFM
value partitionUDFM
value udfmRestrictKeys
value udfmRestrictKeysSet
value anyUDFM
value allUDFM
value pprUniqDFM
value pprUDFM
value udfmToList
value udfmToUfm
value nonDetStrictFoldUDFM
value unsafeCastUDFMKey
value alwaysUnsafeUfmToUdfm

Packageghc-lib-parser-9.14.1.20251220
Exports52
LanguageGHC2021
LicenceBSD-3-Clause
SourceDFM.hs

Unique-keyed deterministic mappings

datadata UniqDFM (key :: k) ele

Source#

Type of unique deterministic finite maps

The key is just here to keep us honest. It's always safe to use a single type as key. If two types don't overlap in their uniques it's also safe to index the same map at multiple key types. But this is very much discouraged.

Instances7Functor, Foldable, Traversable, TrieMap, Data, Outputable, …

Functor (UniqDFM key)Defined in ghc-lib-parser-9.14.1.20251220 · GHC.Types.Unique.DFM
Foldable (UniqDFM key)Defined in ghc-lib-parser-9.14.1.20251220 · GHC.Types.Unique.DFM
Deterministic, in O(n log n).
Traversable (UniqDFM key)Defined in ghc-lib-parser-9.14.1.20251220 · GHC.Types.Unique.DFM
Deterministic, in O(n log n).
Uniquable key => TrieMap (UniqDFM key)Defined in ghc-lib-parser-9.14.1.20251220 · GHC.Data.TrieMap
(Typeable key, Typeable k, Data ele) => Data (UniqDFM key ele)Defined in ghc-lib-parser-9.14.1.20251220 · GHC.Types.Unique.DFM
Outputable a => Outputable (UniqDFM key a)Defined in ghc-lib-parser-9.14.1.20251220 · GHC.Types.Unique.DFM
type Key (UniqDFM key) = keyDefined in ghc-lib-parser-9.14.1.20251220 · GHC.Data.TrieMap

Manipulating those mappings

valueemptyUDFM :: UniqDFM key elt

valueunitUDFM :: Uniquable key => key -> elt -> UniqDFM key elt

valueaddToUDFM

:: Uniquable key
=> UniqDFM key elt
-> key
-> elt
-> UniqDFM key elt

valueaddToUDFM_C

:: Uniquable key
=> elt -> elt -> elt
-> UniqDFM key elt
-> key
-> elt
-> UniqDFM key elt

valueaddToUDFM_C_Directly

:: elt -> elt -> elt
-> UniqDFM key elt
-> Unique
-> elt
-> UniqDFM key elt

valueaddToUDFM_Directly :: UniqDFM key elt -> Unique -> elt -> UniqDFM key elt

valueaddListToUDFM

:: Uniquable key
=> UniqDFM key elt
-> [(key, elt)]
-> UniqDFM key elt

valuedelFromUDFM :: Uniquable key => UniqDFM key elt -> key -> UniqDFM key elt

valuedelListFromUDFM

:: Uniquable key
=> UniqDFM key elt
-> [key]
-> UniqDFM key elt

Source#

Delete a list of elements from a UniqDFM

valueadjustUDFM

:: Uniquable key
=> elt -> elt
-> UniqDFM key elt
-> key
-> UniqDFM key elt

Source#

Apply a function to a particular element

valueadjustUDFM_Directly

:: elt -> elt
-> UniqDFM key elt
-> Unique
-> UniqDFM key elt

Source#

Apply a function to a particular element

valuealterUDFM

:: Uniquable key
=> Maybe elt -> Maybe elt
-> UniqDFM key elt
-> key
-> UniqDFM key elt

Source#

The expression (alterUDFM f k map) alters value x at k, or absence thereof. alterUDFM can be used to insert, delete, or update a value in UniqDFM. Use addToUDFM, delFromUDFM or adjustUDFM when possible, they are more efficient.

valuemapUDFM :: (elt1 -> elt2) -> UniqDFM key elt1 -> UniqDFM key elt2

Source#

Map a function over every value in a UniqDFM

valuemapMaybeUDFM :: (elt1 -> Maybe elt2) -> UniqDFM key elt1 -> UniqDFM key elt2

valuemapMUDFM

:: Monad m
=> elt1 -> m elt2
-> UniqDFM key elt1
-> m (UniqDFM key elt2)

Source#

mapM for a UniqDFM.

valueplusUDFM :: UniqDFM key elt -> UniqDFM key elt -> UniqDFM key elt

valueplusUDFM_C

:: elt -> elt -> elt
-> UniqDFM key elt
-> UniqDFM key elt
-> UniqDFM key elt

valueplusUDFM_CK

:: Unique -> elt -> elt -> elt
-> UniqDFM key elt
-> UniqDFM key elt
-> UniqDFM key elt

Source#

Like plusUDFM_C but the combine function also receives the unique key

valuelookupUDFM :: Uniquable key => UniqDFM key elt -> key -> Maybe elt

valuelookupUDFM_Directly :: UniqDFM key elt -> Unique -> Maybe elt

valueelemUDFM :: Uniquable key => key -> UniqDFM key elt -> Bool

valuefoldUDFM :: (elt -> a -> a) -> a -> UniqDFM key elt -> a

Source#

Performs a deterministic fold over the UniqDFM. It's O(n log n) while the corresponding function on UniqFM is O(n).

valuefoldWithKeyUDFM :: (Unique -> elt -> a -> a) -> a -> UniqDFM key elt -> a

Source#

Like foldUDFM but the function also receives a key

valueeltsUDFM :: UniqDFM key elt -> [elt]

valuefilterUDFM :: (elt -> Bool) -> UniqDFM key elt -> UniqDFM key elt

valuefilterUDFM_Directly

:: Unique -> elt -> Bool
-> UniqDFM key elt
-> UniqDFM key elt

valueisNullUDFM :: UniqDFM key elt -> Bool

valuesizeUDFM :: UniqDFM key elt -> Int

valueintersectUDFM :: UniqDFM key elt -> UniqDFM key elt -> UniqDFM key elt

valueudfmIntersectUFM :: UniqDFM key elt1 -> UniqFM key elt2 -> UniqDFM key elt1

valuedisjointUDFM :: UniqDFM key elt -> UniqDFM key elt -> Bool

valuedisjointUdfmUfm :: UniqDFM key elt -> UniqFM key elt2 -> Bool

valueequalKeysUDFM :: UniqDFM key a -> UniqDFM key b -> Bool

valueminusUDFM :: UniqDFM key elt1 -> UniqDFM key elt2 -> UniqDFM key elt1

valuelistToUDFM :: Uniquable key => [(key, elt)] -> UniqDFM key elt

valuelistToUDFM_Directly :: [(Unique, elt)] -> UniqDFM key elt

valuelistToUDFM_C_Directly

:: elt -> elt -> elt
-> [(Unique, elt)]
-> UniqDFM key elt

valueudfmMinusUFM :: UniqDFM key elt1 -> UniqFM key elt2 -> UniqDFM key elt1

valueufmMinusUDFM :: UniqFM key elt1 -> UniqDFM key elt2 -> UniqFM key elt1

valuepartitionUDFM

:: elt -> Bool
-> UniqDFM key elt
-> (UniqDFM key elt, UniqDFM key elt)

Source#

Partition UniqDFM into two UniqDFMs according to the predicate

valueudfmRestrictKeys :: UniqDFM key elt -> UniqDFM key elt2 -> UniqDFM key elt

valueudfmRestrictKeysSet :: UniqDFM key elt -> Word64Set -> UniqDFM key elt

valueanyUDFM :: (elt -> Bool) -> UniqDFM key elt -> Bool

valueallUDFM :: (elt -> Bool) -> UniqDFM key elt -> Bool

valuepprUniqDFM :: (a -> SDoc) -> UniqDFM key a -> SDoc

valuepprUDFM

:: UniqDFM key a
The things to be pretty printed
-> ([a] -> SDoc)
The pretty printing function to use on the elements
-> SDoc
SDoc where the things have been pretty printed

valueudfmToList :: UniqDFM key elt -> [(Unique, elt)]

Source#

Converts UniqDFM to a list, with elements in deterministic order. It's O(n log n) while the corresponding function on UniqFM is O(n).

valueudfmToUfm :: UniqDFM key elt -> UniqFM key elt

Source#

This allows for lossy conversion from UniqDFM to UniqFM

valuenonDetStrictFoldUDFM :: (elt -> a -> a) -> a -> UniqDFM key elt -> a

Source#

Performs a nondeterministic strict fold over the UniqDFM. It's O(n), same as the corresponding function on UniqFM. If you use this please provide a justification why it doesn't introduce nondeterminism.

valueunsafeCastUDFMKey :: UniqDFM key1 elt -> UniqDFM key2 elt

Source#

Cast the key domain of a UniqFM.

As long as the domains don't overlap in their uniques this is safe.

valuealwaysUnsafeUfmToUdfm :: UniqFM key elt -> UniqDFM key elt