| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
GHC.Core.RoughMap
Contents
Description
RoughMap is an approximate finite map data structure keyed on
[. This is useful when keying maps on lists of RoughMatchTc]Types
(e.g. an instance head).
Synopsis
- data RoughMatchTc
- isRoughWildcard :: RoughMatchTc -> Bool
- typeToRoughMatchTc :: Type -> RoughMatchTc
- data RoughMatchLookupTc
- typeToRoughMatchLookupTc :: Type -> RoughMatchLookupTc
- roughMatchTcToLookup :: RoughMatchTc -> RoughMatchLookupTc
- data RoughMap a
- emptyRM :: RoughMap a
- lookupRM :: [RoughMatchLookupTc] -> RoughMap a -> [a]
- lookupRM' :: [RoughMatchLookupTc] -> RoughMap a -> (Bag a, [a])
- insertRM :: [RoughMatchTc] -> a -> RoughMap a -> RoughMap a
- filterRM :: (a -> Bool) -> RoughMap a -> RoughMap a
- filterMatchingRM :: (a -> Bool) -> [RoughMatchTc] -> RoughMap a -> RoughMap a
- elemsRM :: RoughMap a -> [a]
- sizeRM :: RoughMap a -> Int
- foldRM :: (a -> b -> b) -> b -> RoughMap a -> b
- unionRM :: RoughMap a -> RoughMap a -> RoughMap a
RoughMatchTc
data RoughMatchTc Source #
Constructors
| RM_KnownTc Name | |
| RM_WildCard |
Instances
| Data RoughMatchTc Source # | |
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 Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c RoughMatchTc Source # toConstr :: RoughMatchTc -> Constr Source # dataTypeOf :: RoughMatchTc -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c RoughMatchTc) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c RoughMatchTc) Source # gmapT :: (forall b. Data b => b -> b) -> RoughMatchTc -> RoughMatchTc Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RoughMatchTc -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RoughMatchTc -> r Source # gmapQ :: (forall d. Data d => d -> u) -> RoughMatchTc -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> RoughMatchTc -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> RoughMatchTc -> m RoughMatchTc Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RoughMatchTc -> m RoughMatchTc Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RoughMatchTc -> m RoughMatchTc Source # | |
| Outputable RoughMatchTc Source # | |
Defined in GHC.Core.RoughMap Methods ppr :: RoughMatchTc -> SDoc Source # | |
isRoughWildcard :: RoughMatchTc -> Bool Source #
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
RoughMap
Trie of [RoughMatchTc]
- Examples*
insert [OtherTc] 1 insert [OtherTc] 2 lookup [OtherTc] == [1,2]
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 becuase 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]
filterMatchingRM :: (a -> Bool) -> [RoughMatchTc] -> RoughMap a -> RoughMap a Source #
Filter all elements that might match a particular key with the given predicate.