ghc-9.13: The GHC API
Safe HaskellNone
LanguageGHC2021

GHC.Core.RoughMap

Description

RoughMap is an approximate finite map data structure keyed on [RoughMatchTc]. This is useful when keying maps on lists of Types (e.g. an instance head).

Synopsis

RoughMatchTc

data RoughMatchTc Source #

Constructors

RM_KnownTc Name 
RM_WildCard 

Instances

Instances details
Outputable RoughMatchTc Source # 
Instance details

Defined in GHC.Core.RoughMap

Data RoughMatchTc Source # 
Instance details

Defined in GHC.Core.RoughMap

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> RoughMatchTc -> c RoughMatchTc #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c RoughMatchTc #

toConstr :: RoughMatchTc -> Constr #

dataTypeOf :: RoughMatchTc -> DataType #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c RoughMatchTc) #

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

gmapT :: (forall b. Data b => b -> b) -> RoughMatchTc -> RoughMatchTc #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RoughMatchTc -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RoughMatchTc -> r #

gmapQ :: (forall d. Data d => d -> u) -> RoughMatchTc -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> RoughMatchTc -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> RoughMatchTc -> m RoughMatchTc #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RoughMatchTc -> m RoughMatchTc #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RoughMatchTc -> m RoughMatchTc #

data RoughMatchLookupTc Source #

Constructors

RML_KnownTc Name

The position only matches the specified KnownTc

RML_NoKnownTc

The position definitely doesn't match any KnownTc

RML_WildCard

The position can match anything

Instances

Instances details
Outputable RoughMatchLookupTc Source # 
Instance details

Defined in GHC.Core.RoughMap

Data RoughMatchLookupTc Source # 
Instance details

Defined in GHC.Core.RoughMap

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> RoughMatchLookupTc -> c RoughMatchLookupTc #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c RoughMatchLookupTc #

toConstr :: RoughMatchLookupTc -> Constr #

dataTypeOf :: RoughMatchLookupTc -> DataType #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c RoughMatchLookupTc) #

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

gmapT :: (forall b. Data b => b -> b) -> RoughMatchLookupTc -> RoughMatchLookupTc #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RoughMatchLookupTc -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RoughMatchLookupTc -> r #

gmapQ :: (forall d. Data d => d -> u) -> RoughMatchLookupTc -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> RoughMatchLookupTc -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> RoughMatchLookupTc -> m RoughMatchLookupTc #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RoughMatchLookupTc -> m RoughMatchLookupTc #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RoughMatchLookupTc -> m RoughMatchLookupTc #

RoughMap

data RoughMap a Source #

Trie of [RoughMatchTc]

  • Examples* insert [OtherTc] 1 insert [OtherTc] 2 lookup [OtherTc] == [1,2]

Instances

Instances details
Functor RoughMap Source # 
Instance details

Defined in GHC.Core.RoughMap

Methods

fmap :: (a -> b) -> RoughMap a -> RoughMap b #

(<$) :: a -> RoughMap b -> RoughMap a #

Outputable a => Outputable (RoughMap a) Source # 
Instance details

Defined in GHC.Core.RoughMap

Methods

ppr :: RoughMap a -> SDoc Source #

lookupRM :: [RoughMatchLookupTc] -> RoughMap a -> [a] Source #

Order of result is deterministic.

lookupRM' :: [RoughMatchLookupTc] -> RoughMap a -> (Bag a, [a]) Source #

N.B. Returns a Bag for matches, which allows us to avoid rebuilding all of the lists we find in rm_empty, which would otherwise be necessary due to ++ if we returned a list. We use a list for unifiers because the tail is computed lazily and we often only care about the first couple of potential unifiers. Constructing a bag forces the tail which performs much too much work.

See Note [Matching a RoughMap] See Note [Matches vs Unifiers]

filterRM :: (a -> Bool) -> RoughMap a -> RoughMap a Source #

filterMatchingRM :: (a -> Bool) -> [RoughMatchTc] -> RoughMap a -> RoughMap a Source #

Filter all elements that might match a particular key with the given predicate.

elemsRM :: RoughMap a -> [a] Source #

foldRM :: (a -> b -> b) -> b -> RoughMap a -> b Source #