Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- data MaybeMap m a
- data ListMap m a
- type LiteralMap a = Map Literal a
- class TrieMap m where
- insertTM :: TrieMap m => Key m -> a -> m a -> m a
- deleteTM :: TrieMap m => Key m -> m a -> m a
- (>.>) :: (a -> b) -> (b -> c) -> a -> c
- (|>) :: a -> (a -> b) -> b
- (|>>) :: TrieMap m2 => (XT (m2 a) -> m1 (m2 a) -> m1 (m2 a)) -> (m2 a -> m2 a) -> m1 (m2 a) -> m1 (m2 a)
- type XT a = Maybe a -> Maybe a
- foldMaybe :: (a -> b -> b) -> Maybe a -> b -> b
- data GenMap m a
- 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
Maps over Maybe
values
Instances
TrieMap m => TrieMap (MaybeMap m) # | |
Defined in GHC.Data.TrieMap | |
type Key (MaybeMap m) # | |
Defined in GHC.Data.TrieMap |
Maps over List
values
Instances
TrieMap m => TrieMap (ListMap m) # | |
Defined in GHC.Data.TrieMap | |
(TrieMap m, Outputable a) => Outputable (ListMap m a) # | |
type Key (ListMap m) # | |
Defined in GHC.Data.TrieMap |
Maps over Literal
s
type LiteralMap a = Map Literal a Source #
TrieMap
class
class TrieMap m where Source #
lookupTM :: forall b. Key m -> m b -> Maybe b Source #
alterTM :: forall b. Key m -> XT b -> m b -> m b Source #
Instances
TrieMap IntMap # | |
Defined in GHC.Data.TrieMap | |
TrieMap LabelMap # | |
Defined in GHC.Cmm.Dataflow.Label | |
TrieMap LooseTypeMap # | |
Defined in GHC.Core.Map type Key LooseTypeMap Source # emptyTM :: LooseTypeMap a Source # lookupTM :: Key LooseTypeMap -> LooseTypeMap b -> Maybe b Source # alterTM :: Key LooseTypeMap -> XT b -> LooseTypeMap b -> LooseTypeMap b Source # mapTM :: (a -> b) -> LooseTypeMap a -> LooseTypeMap b Source # foldTM :: (a -> b -> b) -> LooseTypeMap a -> b -> b Source # | |
TrieMap TypeMap # | |
Defined in GHC.Core.Map | |
TrieMap CoreMap # | |
Defined in GHC.Core.Map | |
Ord k => TrieMap (Map k) # | |
Uniquable key => TrieMap (UniqDFM key) # | |
Defined in GHC.Data.TrieMap | |
(Eq (Key m), TrieMap m) => TrieMap (GenMap m) # | |
Defined in GHC.Data.TrieMap | |
TrieMap m => TrieMap (ListMap m) # | |
Defined in GHC.Data.TrieMap | |
TrieMap m => TrieMap (MaybeMap m) # | |
Defined in GHC.Data.TrieMap |
Things helpful for adding additional Instances.
(|>>) :: TrieMap m2 => (XT (m2 a) -> m1 (m2 a) -> m1 (m2 a)) -> (m2 a -> m2 a) -> m1 (m2 a) -> m1 (m2 a) infixr 1 Source #
Map for leaf compression
Instances
(Eq (Key m), TrieMap m) => TrieMap (GenMap m) # | |
Defined in GHC.Data.TrieMap | |
(Outputable a, Outputable (m a)) => Outputable (GenMap m a) # | |
type Key (GenMap m) # | |
Defined in GHC.Data.TrieMap |