UniqFM

Unique-keyed mappings

data UniqFM ele

Instances

Functor UniqFM

Defined in UniqFM

Methods

fmap :: (a -> b) -> UniqFM a -> UniqFM b

(<$) :: a -> UniqFM b -> UniqFM a

Eq ele => Eq (UniqFM ele)

Defined in UniqFM

Methods

(==) :: UniqFM ele -> UniqFM ele -> Bool

(/=) :: UniqFM ele -> UniqFM ele -> Bool

Data ele => Data (UniqFM ele)

Defined in UniqFM

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> UniqFM ele -> c (UniqFM ele)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (UniqFM ele)

toConstr :: UniqFM ele -> Constr

dataTypeOf :: UniqFM ele -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (UniqFM ele))

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

gmapT :: (forall b. Data b => b -> b) -> UniqFM ele -> UniqFM ele

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> UniqFM ele -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> UniqFM ele -> r

gmapQ :: (forall d. Data d => d -> u) -> UniqFM ele -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> UniqFM ele -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> UniqFM ele -> m (UniqFM ele)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> UniqFM ele -> m (UniqFM ele)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> UniqFM ele -> m (UniqFM ele)

Semigroup (UniqFM a)

Defined in UniqFM

Methods

(<>) :: UniqFM a -> UniqFM a -> UniqFM a

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

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

Monoid (UniqFM a)

Defined in UniqFM

Methods

mempty :: UniqFM a

mappend :: UniqFM a -> UniqFM a -> UniqFM a

mconcat :: [UniqFM a] -> UniqFM a

Outputable a => Outputable (UniqFM a)

Defined in UniqFM

Methods

ppr :: UniqFM a -> SDoc

pprPrec :: Rational -> UniqFM a -> SDoc

newtype NonDetUniqFM ele

A wrapper around UniqFM with the sole purpose of informing call sites that the provided Foldable and Traversable instances are nondeterministic. If you use this please provide a justification why it doesn't introduce nondeterminism. See Note [Deterministic UniqFM] in UniqDFM to learn about determinism.

Constructors

NonDetUniqFM

Fields

• getNonDet :: UniqFM ele

Instances

Functor NonDetUniqFM

Defined in UniqFM

Methods

fmap :: (a -> b) -> NonDetUniqFM a -> NonDetUniqFM b

(<$) :: a -> NonDetUniqFM b -> NonDetUniqFM a

Foldable NonDetUniqFM

Inherently nondeterministic. If you use this please provide a justification why it doesn't introduce nondeterminism. See Note [Deterministic UniqFM] in UniqDFM to learn about determinism.

Defined in UniqFM

Methods

fold :: Monoid m => NonDetUniqFM m -> m

foldMap :: Monoid m => (a -> m) -> NonDetUniqFM a -> m

foldMap' :: Monoid m => (a -> m) -> NonDetUniqFM a -> m

foldr :: (a -> b -> b) -> b -> NonDetUniqFM a -> b

foldr' :: (a -> b -> b) -> b -> NonDetUniqFM a -> b

foldl :: (b -> a -> b) -> b -> NonDetUniqFM a -> b

foldl' :: (b -> a -> b) -> b -> NonDetUniqFM a -> b

foldr1 :: (a -> a -> a) -> NonDetUniqFM a -> a

foldl1 :: (a -> a -> a) -> NonDetUniqFM a -> a

toList :: NonDetUniqFM a -> [a]

null :: NonDetUniqFM a -> Bool

length :: NonDetUniqFM a -> Int

elem :: Eq a => a -> NonDetUniqFM a -> Bool

maximum :: Ord a => NonDetUniqFM a -> a

minimum :: Ord a => NonDetUniqFM a -> a

sum :: Num a => NonDetUniqFM a -> a

product :: Num a => NonDetUniqFM a -> a

Traversable NonDetUniqFM

Inherently nondeterministic. If you use this please provide a justification why it doesn't introduce nondeterminism. See Note [Deterministic UniqFM] in UniqDFM to learn about determinism.

Defined in UniqFM

Methods

traverse :: Applicative f => (a -> f b) -> NonDetUniqFM a -> f (NonDetUniqFM b)

sequenceA :: Applicative f => NonDetUniqFM (f a) -> f (NonDetUniqFM a)

mapM :: Monad m => (a -> m b) -> NonDetUniqFM a -> m (NonDetUniqFM b)

sequence :: Monad m => NonDetUniqFM (m a) -> m (NonDetUniqFM a)

Manipulating those mappings

emptyUFM :: UniqFM elt

unitUFM :: Uniquable key => key -> elt -> UniqFM elt

unitDirectlyUFM :: Unique -> elt -> UniqFM elt

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

listToUFM_Directly :: [(Unique, elt)] -> UniqFM elt

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

addToUFM :: Uniquable key => UniqFM elt -> key -> elt -> UniqFM elt

addToUFM_C :: Uniquable key => (elt -> elt -> elt) -> UniqFM elt -> key -> elt -> UniqFM elt

addToUFM_Acc :: Uniquable key => (elt -> elts -> elts) -> (elt -> elts) -> UniqFM elts -> key -> elt -> UniqFM elts

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

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

addToUFM_Directly :: UniqFM elt -> Unique -> elt -> UniqFM elt

addListToUFM_Directly :: UniqFM elt -> [(Unique, elt)] -> UniqFM elt

adjustUFM :: Uniquable key => (elt -> elt) -> UniqFM elt -> key -> UniqFM elt

alterUFM :: Uniquable key => (Maybe elt -> Maybe elt) -> UniqFM elt -> key -> UniqFM elt

adjustUFM_Directly :: (elt -> elt) -> UniqFM elt -> Unique -> UniqFM elt

delFromUFM :: Uniquable key => UniqFM elt -> key -> UniqFM elt

delFromUFM_Directly :: UniqFM elt -> Unique -> UniqFM elt

delListFromUFM :: Uniquable key => UniqFM elt -> [key] -> UniqFM elt

delListFromUFM_Directly :: UniqFM elt -> [Unique] -> UniqFM elt

plusUFM :: UniqFM elt -> UniqFM elt -> UniqFM elt

plusUFM_C :: (elt -> elt -> elt) -> UniqFM elt -> UniqFM elt -> UniqFM elt

plusUFM_CD :: (elt -> elt -> elt) -> UniqFM elt -> elt -> UniqFM elt -> elt -> UniqFM elt

`plusUFM_CD f m1 d1 m2 d2` merges the maps using f as the combinding function and d1 resp. d2 as the default value if there is no entry in m1 reps. m2. The domain is the union of the domains of m1 and m2.

Representative example:

plusUFM_CD f {A: 1, B: 2} 23 {B: 3, C: 4} 42
   == {A: f 1 42, B: f 2 3, C: f 23 4 }

plusMaybeUFM_C :: (elt -> elt -> Maybe elt) -> UniqFM elt -> UniqFM elt -> UniqFM elt

plusUFMList :: [UniqFM elt] -> UniqFM elt

minusUFM :: UniqFM elt1 -> UniqFM elt2 -> UniqFM elt1

intersectUFM :: UniqFM elt1 -> UniqFM elt2 -> UniqFM elt1

intersectUFM_C :: (elt1 -> elt2 -> elt3) -> UniqFM elt1 -> UniqFM elt2 -> UniqFM elt3

disjointUFM :: UniqFM elt1 -> UniqFM elt2 -> Bool

equalKeysUFM :: UniqFM a -> UniqFM b -> Bool

nonDetFoldUFM :: (elt -> a -> a) -> a -> UniqFM elt -> a

foldUFM :: (elt -> a -> a) -> a -> UniqFM elt -> a

nonDetFoldUFM_Directly :: (Unique -> elt -> a -> a) -> a -> UniqFM elt -> a

anyUFM :: (elt -> Bool) -> UniqFM elt -> Bool

allUFM :: (elt -> Bool) -> UniqFM elt -> Bool

seqEltsUFM :: ([elt] -> ()) -> UniqFM elt -> ()

mapUFM :: (elt1 -> elt2) -> UniqFM elt1 -> UniqFM elt2

mapUFM_Directly :: (Unique -> elt1 -> elt2) -> UniqFM elt1 -> UniqFM elt2

elemUFM :: Uniquable key => key -> UniqFM elt -> Bool

elemUFM_Directly :: Unique -> UniqFM elt -> Bool

filterUFM :: (elt -> Bool) -> UniqFM elt -> UniqFM elt

filterUFM_Directly :: (Unique -> elt -> Bool) -> UniqFM elt -> UniqFM elt

partitionUFM :: (elt -> Bool) -> UniqFM elt -> (UniqFM elt, UniqFM elt)

sizeUFM :: UniqFM elt -> Int

isNullUFM :: UniqFM elt -> Bool

lookupUFM :: Uniquable key => UniqFM elt -> key -> Maybe elt

lookupUFM_Directly :: UniqFM elt -> Unique -> Maybe elt

lookupWithDefaultUFM :: Uniquable key => UniqFM elt -> elt -> key -> elt

lookupWithDefaultUFM_Directly :: UniqFM elt -> elt -> Unique -> elt

nonDetEltsUFM :: UniqFM elt -> [elt]

eltsUFM :: UniqFM elt -> [elt]

nonDetKeysUFM :: UniqFM elt -> [Unique]

ufmToSet_Directly :: UniqFM elt -> IntSet

nonDetUFMToList :: UniqFM elt -> [(Unique, elt)]

ufmToIntMap :: UniqFM elt -> IntMap elt

pprUniqFM :: (a -> SDoc) -> UniqFM a -> SDoc

pprUFM

Arguments

:: UniqFM 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

Pretty-print a non-deterministic set. The order of variables is non-deterministic and for pretty-printing that shouldn't be a problem. Having this function helps contain the non-determinism created with nonDetEltsUFM.

pprUFMWithKeys

Arguments

:: UniqFM a

The things to be pretty printed

-> ([(Unique, a)] -> SDoc)

The pretty printing function to use on the elements

-> SDoc

SDoc where the things have been pretty printed

Pretty-print a non-deterministic set. The order of variables is non-deterministic and for pretty-printing that shouldn't be a problem. Having this function helps contain the non-determinism created with nonDetUFMToList.

pluralUFM :: UniqFM a -> SDoc

Determines the pluralisation suffix appropriate for the length of a set in the same way that plural from Outputable does for lists.