GHC.Data.TrieMap

Maps over Maybe values

data MaybeMap m a

Instances

TrieMap m => Foldable (MaybeMap m)

Defined in GHC.Data.TrieMap

Methods

fold :: Monoid m0 => MaybeMap m m0 -> m0

foldMap :: Monoid m0 => (a -> m0) -> MaybeMap m a -> m0

foldMap' :: Monoid m0 => (a -> m0) -> MaybeMap m a -> m0

foldr :: (a -> b -> b) -> b -> MaybeMap m a -> b

foldr' :: (a -> b -> b) -> b -> MaybeMap m a -> b

foldl :: (b -> a -> b) -> b -> MaybeMap m a -> b

foldl' :: (b -> a -> b) -> b -> MaybeMap m a -> b

foldr1 :: (a -> a -> a) -> MaybeMap m a -> a

foldl1 :: (a -> a -> a) -> MaybeMap m a -> a

toList :: MaybeMap m a -> [a]

null :: MaybeMap m a -> Bool

length :: MaybeMap m a -> Int

elem :: Eq a => a -> MaybeMap m a -> Bool

maximum :: Ord a => MaybeMap m a -> a

minimum :: Ord a => MaybeMap m a -> a

sum :: Num a => MaybeMap m a -> a

product :: Num a => MaybeMap m a -> a

TrieMap m => TrieMap (MaybeMap m)

Defined in GHC.Data.TrieMap

Associated Types

type Key (MaybeMap m)

Methods

emptyTM :: MaybeMap m a

lookupTM :: Key (MaybeMap m) -> MaybeMap m b -> Maybe b

alterTM :: Key (MaybeMap m) -> XT b -> MaybeMap m b -> MaybeMap m b

mapTM :: (a -> b) -> MaybeMap m a -> MaybeMap m b

filterTM :: (a -> Bool) -> MaybeMap m a -> MaybeMap m a

foldTM :: (a -> b -> b) -> MaybeMap m a -> b -> b

type Key (MaybeMap m)

Defined in GHC.Data.TrieMap

type Key (MaybeMap m) = Maybe (Key m)

Maps over List values

data ListMap m a

Instances

TrieMap m => Foldable (ListMap m)

Defined in GHC.Data.TrieMap

Methods

fold :: Monoid m0 => ListMap m m0 -> m0

foldMap :: Monoid m0 => (a -> m0) -> ListMap m a -> m0

foldMap' :: Monoid m0 => (a -> m0) -> ListMap m a -> m0

foldr :: (a -> b -> b) -> b -> ListMap m a -> b

foldr' :: (a -> b -> b) -> b -> ListMap m a -> b

foldl :: (b -> a -> b) -> b -> ListMap m a -> b

foldl' :: (b -> a -> b) -> b -> ListMap m a -> b

foldr1 :: (a -> a -> a) -> ListMap m a -> a

foldl1 :: (a -> a -> a) -> ListMap m a -> a

toList :: ListMap m a -> [a]

null :: ListMap m a -> Bool

length :: ListMap m a -> Int

elem :: Eq a => a -> ListMap m a -> Bool

maximum :: Ord a => ListMap m a -> a

minimum :: Ord a => ListMap m a -> a

sum :: Num a => ListMap m a -> a

product :: Num a => ListMap m a -> a

TrieMap m => TrieMap (ListMap m)

Defined in GHC.Data.TrieMap

Associated Types

type Key (ListMap m)

Methods

emptyTM :: ListMap m a

lookupTM :: Key (ListMap m) -> ListMap m b -> Maybe b

alterTM :: Key (ListMap m) -> XT b -> ListMap m b -> ListMap m b

mapTM :: (a -> b) -> ListMap m a -> ListMap m b

filterTM :: (a -> Bool) -> ListMap m a -> ListMap m a

foldTM :: (a -> b -> b) -> ListMap m a -> b -> b

(TrieMap m, Outputable a) => Outputable (ListMap m a)

Defined in GHC.Data.TrieMap

Methods

ppr :: ListMap m a -> SDoc

type Key (ListMap m)

Defined in GHC.Data.TrieMap

type Key (ListMap m) = [Key m]

Maps over Literals

type LiteralMap a = Map Literal a

TrieMap class

class TrieMap m where

Associated Types

type Key m :: Type

Methods

emptyTM :: m a

lookupTM :: forall b. Key m -> m b -> Maybe b

alterTM :: forall b. Key m -> XT b -> m b -> m b

mapTM :: (a -> b) -> m a -> m b

filterTM :: (a -> Bool) -> m a -> m a

foldTM :: (a -> b -> b) -> m a -> b -> b

Instances

TrieMap IntMap

Defined in GHC.Data.TrieMap

Associated Types

type Key IntMap

Methods

emptyTM :: IntMap a

lookupTM :: Key IntMap -> IntMap b -> Maybe b

alterTM :: Key IntMap -> XT b -> IntMap b -> IntMap b

mapTM :: (a -> b) -> IntMap a -> IntMap b

filterTM :: (a -> Bool) -> IntMap a -> IntMap a

foldTM :: (a -> b -> b) -> IntMap a -> b -> b

TrieMap LabelMap

Defined in GHC.Cmm.Dataflow.Label

Associated Types

type Key LabelMap

Methods

emptyTM :: LabelMap a

lookupTM :: Key LabelMap -> LabelMap b -> Maybe b

alterTM :: Key LabelMap -> XT b -> LabelMap b -> LabelMap b

mapTM :: (a -> b) -> LabelMap a -> LabelMap b

filterTM :: (a -> Bool) -> LabelMap a -> LabelMap a

foldTM :: (a -> b -> b) -> LabelMap a -> b -> b

TrieMap CoreMap

Defined in GHC.Core.Map.Expr

Associated Types

type Key CoreMap

Methods

emptyTM :: CoreMap a

lookupTM :: Key CoreMap -> CoreMap b -> Maybe b

alterTM :: Key CoreMap -> XT b -> CoreMap b -> CoreMap b

mapTM :: (a -> b) -> CoreMap a -> CoreMap b

filterTM :: (a -> Bool) -> CoreMap a -> CoreMap a

foldTM :: (a -> b -> b) -> CoreMap a -> b -> b

TrieMap BndrMap

Defined in GHC.Core.Map.Type

Associated Types

type Key BndrMap

Methods

emptyTM :: BndrMap a

lookupTM :: Key BndrMap -> BndrMap b -> Maybe b

alterTM :: Key BndrMap -> XT b -> BndrMap b -> BndrMap b

mapTM :: (a -> b) -> BndrMap a -> BndrMap b

filterTM :: (a -> Bool) -> BndrMap a -> BndrMap a

foldTM :: (a -> b -> b) -> BndrMap a -> b -> b

TrieMap LooseTypeMap

Defined in GHC.Core.Map.Type

Associated Types

type Key LooseTypeMap

Methods

emptyTM :: LooseTypeMap a

lookupTM :: Key LooseTypeMap -> LooseTypeMap b -> Maybe b

alterTM :: Key LooseTypeMap -> XT b -> LooseTypeMap b -> LooseTypeMap b

mapTM :: (a -> b) -> LooseTypeMap a -> LooseTypeMap b

filterTM :: (a -> Bool) -> LooseTypeMap a -> LooseTypeMap a

foldTM :: (a -> b -> b) -> LooseTypeMap a -> b -> b

TrieMap TypeMap

Defined in GHC.Core.Map.Type

Associated Types

type Key TypeMap

Methods

emptyTM :: TypeMap a

lookupTM :: Key TypeMap -> TypeMap b -> Maybe b

alterTM :: Key TypeMap -> XT b -> TypeMap b -> TypeMap b

mapTM :: (a -> b) -> TypeMap a -> TypeMap b

filterTM :: (a -> Bool) -> TypeMap a -> TypeMap a

foldTM :: (a -> b -> b) -> TypeMap a -> b -> b

TrieMap VarMap

Defined in GHC.Core.Map.Type

Associated Types

type Key VarMap

Methods

emptyTM :: VarMap a

lookupTM :: Key VarMap -> VarMap b -> Maybe b

alterTM :: Key VarMap -> XT b -> VarMap b -> VarMap b

mapTM :: (a -> b) -> VarMap a -> VarMap b

filterTM :: (a -> Bool) -> VarMap a -> VarMap a

foldTM :: (a -> b -> b) -> VarMap a -> b -> b

Ord k => TrieMap (Map k)

Defined in GHC.Data.TrieMap

Associated Types

type Key (Map k)

Methods

emptyTM :: Map k a

lookupTM :: Key (Map k) -> Map k b -> Maybe b

alterTM :: Key (Map k) -> XT b -> Map k b -> Map k b

mapTM :: (a -> b) -> Map k a -> Map k b

filterTM :: (a -> Bool) -> Map k a -> Map k a

foldTM :: (a -> b -> b) -> Map k a -> b -> b

(Eq (Key m), TrieMap m) => TrieMap (GenMap m)

Defined in GHC.Data.TrieMap

Associated Types

type Key (GenMap m)

Methods

emptyTM :: GenMap m a

lookupTM :: Key (GenMap m) -> GenMap m b -> Maybe b

alterTM :: Key (GenMap m) -> XT b -> GenMap m b -> GenMap m b

mapTM :: (a -> b) -> GenMap m a -> GenMap m b

filterTM :: (a -> Bool) -> GenMap m a -> GenMap m a

foldTM :: (a -> b -> b) -> GenMap m a -> b -> b

TrieMap m => TrieMap (ListMap m)

Defined in GHC.Data.TrieMap

Associated Types

type Key (ListMap m)

Methods

emptyTM :: ListMap m a

lookupTM :: Key (ListMap m) -> ListMap m b -> Maybe b

alterTM :: Key (ListMap m) -> XT b -> ListMap m b -> ListMap m b

mapTM :: (a -> b) -> ListMap m a -> ListMap m b

filterTM :: (a -> Bool) -> ListMap m a -> ListMap m a

foldTM :: (a -> b -> b) -> ListMap m a -> b -> b

TrieMap m => TrieMap (MaybeMap m)

Defined in GHC.Data.TrieMap

Associated Types

type Key (MaybeMap m)

Methods

emptyTM :: MaybeMap m a

lookupTM :: Key (MaybeMap m) -> MaybeMap m b -> Maybe b

alterTM :: Key (MaybeMap m) -> XT b -> MaybeMap m b -> MaybeMap m b

mapTM :: (a -> b) -> MaybeMap m a -> MaybeMap m b

filterTM :: (a -> Bool) -> MaybeMap m a -> MaybeMap m a

foldTM :: (a -> b -> b) -> MaybeMap m a -> b -> b

Uniquable key => TrieMap (UniqDFM key)

Defined in GHC.Data.TrieMap

Associated Types

type Key (UniqDFM key)

Methods

emptyTM :: UniqDFM key a

lookupTM :: Key (UniqDFM key) -> UniqDFM key b -> Maybe b

alterTM :: Key (UniqDFM key) -> XT b -> UniqDFM key b -> UniqDFM key b

mapTM :: (a -> b) -> UniqDFM key a -> UniqDFM key b

filterTM :: (a -> Bool) -> UniqDFM key a -> UniqDFM key a

foldTM :: (a -> b -> b) -> UniqDFM key a -> b -> b

insertTM :: TrieMap m => Key m -> a -> m a -> m a

deleteTM :: TrieMap m => Key m -> m a -> m a

foldMapTM :: (TrieMap m, Monoid r) => (a -> r) -> m a -> r

isEmptyTM :: TrieMap m => m a -> Bool

Things helpful for adding additional Instances.

(>.>) :: (a -> b) -> (b -> c) -> a -> c infixr 1

(|>) :: a -> (a -> b) -> b infixr 1

(|>>) :: TrieMap m2 => (XT (m2 a) -> m1 (m2 a) -> m1 (m2 a)) -> (m2 a -> m2 a) -> m1 (m2 a) -> m1 (m2 a) infixr 1

type XT a = Maybe a -> Maybe a

foldMaybe :: (a -> b -> b) -> Maybe a -> b -> b

filterMaybe :: (a -> Bool) -> Maybe a -> Maybe a

Map for leaf compression

data GenMap m a

Instances

(Eq (Key m), TrieMap m) => Foldable (GenMap m)

Defined in GHC.Data.TrieMap

Methods

fold :: Monoid m0 => GenMap m m0 -> m0

foldMap :: Monoid m0 => (a -> m0) -> GenMap m a -> m0

foldMap' :: Monoid m0 => (a -> m0) -> GenMap m a -> m0

foldr :: (a -> b -> b) -> b -> GenMap m a -> b

foldr' :: (a -> b -> b) -> b -> GenMap m a -> b

foldl :: (b -> a -> b) -> b -> GenMap m a -> b

foldl' :: (b -> a -> b) -> b -> GenMap m a -> b

foldr1 :: (a -> a -> a) -> GenMap m a -> a

foldl1 :: (a -> a -> a) -> GenMap m a -> a

toList :: GenMap m a -> [a]

null :: GenMap m a -> Bool

length :: GenMap m a -> Int

elem :: Eq a => a -> GenMap m a -> Bool

maximum :: Ord a => GenMap m a -> a

minimum :: Ord a => GenMap m a -> a

sum :: Num a => GenMap m a -> a

product :: Num a => GenMap m a -> a

(Eq (Key m), TrieMap m) => TrieMap (GenMap m)

Defined in GHC.Data.TrieMap

Associated Types

type Key (GenMap m)

Methods

emptyTM :: GenMap m a

lookupTM :: Key (GenMap m) -> GenMap m b -> Maybe b

alterTM :: Key (GenMap m) -> XT b -> GenMap m b -> GenMap m b

mapTM :: (a -> b) -> GenMap m a -> GenMap m b

filterTM :: (a -> Bool) -> GenMap m a -> GenMap m a

foldTM :: (a -> b -> b) -> GenMap m a -> b -> b

Outputable a => Outputable (TypeMapG a)

Defined in GHC.Core.Map.Type

Methods

ppr :: TypeMapG a -> SDoc

(Outputable a, Outputable (m a)) => Outputable (GenMap m a)

Defined in GHC.Data.TrieMap

Methods

ppr :: GenMap m a -> SDoc

type Key (GenMap m)

Defined in GHC.Data.TrieMap

type Key (GenMap m) = Key m

lkG :: (Eq (Key m), TrieMap m) => Key m -> GenMap m a -> Maybe a

xtG :: (Eq (Key m), TrieMap m) => Key m -> XT a -> GenMap m a -> GenMap m a

mapG :: TrieMap m => (a -> b) -> GenMap m a -> GenMap m b

fdG :: TrieMap m => (a -> b -> b) -> GenMap m a -> b -> b

xtList :: TrieMap m => (forall b. k -> XT b -> m b -> m b) -> [k] -> XT a -> ListMap m a -> ListMap m a

lkList :: TrieMap m => (forall b. k -> m b -> Maybe b) -> [k] -> ListMap m a -> Maybe a