Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
GHC.Core.Map.Expr
Synopsis
- data CoreMap a
- emptyCoreMap :: CoreMap a
- extendCoreMap :: CoreMap a -> CoreExpr -> a -> CoreMap a
- lookupCoreMap :: CoreMap a -> CoreExpr -> Maybe a
- foldCoreMap :: (a -> b -> b) -> b -> CoreMap a -> b
- class TrieMap m where
- insertTM :: TrieMap m => Key m -> a -> m a -> m a
- deleteTM :: TrieMap m => Key m -> m a -> m a
- lkDFreeVar :: Var -> DVarEnv a -> Maybe a
- xtDFreeVar :: Var -> XT a -> DVarEnv a -> DVarEnv a
- lkDNamed :: NamedThing n => n -> DNameEnv a -> Maybe a
- xtDNamed :: NamedThing n => n -> XT a -> DNameEnv a -> DNameEnv 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)
Maps over Core expressions
CoreMap a
is a map from CoreExpr
to a
. If you are a client, this
is the type you want.
Instances
TrieMap CoreMap # | |
Defined in GHC.Core.Map.Expr | |
Outputable a => Outputable (CoreMap a) # | |
Defined in GHC.Core.Map.Expr | |
type Key CoreMap # | |
Defined in GHC.Core.Map.Expr |
emptyCoreMap :: CoreMap a #
extendCoreMap :: CoreMap a -> CoreExpr -> a -> CoreMap a #
lookupCoreMap :: CoreMap a -> CoreExpr -> Maybe a #
foldCoreMap :: (a -> b -> b) -> b -> CoreMap a -> b #
TrieMap
class reexports
Methods
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 #
Instances
TrieMap IntMap # | |
Defined in GHC.Data.TrieMap | |
TrieMap LabelMap # | |
Defined in GHC.Cmm.Dataflow.Label | |
TrieMap CoreMap # | |
Defined in GHC.Core.Map.Expr | |
TrieMap BndrMap # | |
Defined in GHC.Core.Map.Type | |
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 | |
TrieMap VarMap # | |
Defined in GHC.Core.Map.Type | |
Ord k => TrieMap (Map k) # | |
Defined in GHC.Data.TrieMap | |
(Eq (Key m), TrieMap m) => TrieMap (GenMap m) # | |
Defined in GHC.Data.TrieMap | |
TrieMap m => TrieMap (ListMap m) # | |
TrieMap m => TrieMap (MaybeMap m) # | |
Uniquable key => TrieMap (UniqDFM key) # | |
lkDFreeVar :: Var -> DVarEnv a -> Maybe a #
lkDNamed :: NamedThing n => n -> DNameEnv a -> Maybe a #
(|>>) :: TrieMap m2 => (XT (m2 a) -> m1 (m2 a) -> m1 (m2 a)) -> (m2 a -> m2 a) -> m1 (m2 a) -> m1 (m2 a) infixr 1 #