Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. isSubmapOf :: (Ord k, Eq a) => Map k a -> Map k a -> Bool

   containers	Data.Map.Internal

   This function is defined as (isSubmapOf = isSubmapOfBy (==)).

2. isSubmapOfBy :: Ord k => (a -> b -> Bool) -> Map k a -> Map k b -> Bool

   containers	Data.Map.Internal

   The expression (isSubmapOfBy f t1 t2) returns True if all keys in t1 are in tree t2, and when f returns True when applied to their respective values. For example, the following expressions are all True:

   isSubmapOfBy (==) (fromList [('a',1)]) (fromList [('a',1),('b',2)])
   isSubmapOfBy (<=) (fromList [('a',1)]) (fromList [('a',1),('b',2)])
   isSubmapOfBy (==) (fromList [('a',1),('b',2)]) (fromList [('a',1),('b',2)])
   

   But the following are all False:

   isSubmapOfBy (==) (fromList [('a',2)]) (fromList [('a',1),('b',2)])
   isSubmapOfBy (<)  (fromList [('a',1)]) (fromList [('a',1),('b',2)])
   isSubmapOfBy (==) (fromList [('a',1),('b',2)]) (fromList [('a',1)])
   

   Note that isSubmapOfBy (_ _ -> True) m1 m2 tests whether all the keys in m1 are also keys in m2.

3. lmapWhenMissing :: forall b a (f :: Type -> Type) k x . (b -> a) -> WhenMissing f k a x -> WhenMissing f k b x

   containers	Data.Map.Internal

   Map contravariantly over a WhenMissing f k _ x.

4. foldMapWithKey :: Monoid m => (k -> a -> m) -> Map k a -> m

   containers	Data.Map.Lazy

   Fold the keys and values in the map using the given monoid, such that

   foldMapWithKey f = fold . mapWithKey f
   

   This can be an asymptotically faster than foldrWithKey or foldlWithKey for some monoids.

5. isProperSubmapOf :: (Ord k, Eq a) => Map k a -> Map k a -> Bool

   containers	Data.Map.Lazy

   Is this a proper submap? (ie. a submap but not equal). Defined as (isProperSubmapOf = isProperSubmapOfBy (==)).

6. isProperSubmapOfBy :: Ord k => (a -> b -> Bool) -> Map k a -> Map k b -> Bool

   containers	Data.Map.Lazy

   Is this a proper submap? (ie. a submap but not equal). The expression (isProperSubmapOfBy f m1 m2) returns True when keys m1 and keys m2 are not equal, all keys in m1 are in m2, and when f returns True when applied to their respective values. For example, the following expressions are all True:

   isProperSubmapOfBy (==) (fromList [(1,1)]) (fromList [(1,1),(2,2)])
   isProperSubmapOfBy (<=) (fromList [(1,1)]) (fromList [(1,1),(2,2)])
   

   But the following are all False:

   isProperSubmapOfBy (==) (fromList [(1,1),(2,2)]) (fromList [(1,1),(2,2)])
   isProperSubmapOfBy (==) (fromList [(1,1),(2,2)]) (fromList [(1,1)])
   isProperSubmapOfBy (<)  (fromList [(1,1)])       (fromList [(1,1),(2,2)])
   

7. isSubmapOf :: (Ord k, Eq a) => Map k a -> Map k a -> Bool

   containers	Data.Map.Lazy

   This function is defined as (isSubmapOf = isSubmapOfBy (==)).

8. isSubmapOfBy :: Ord k => (a -> b -> Bool) -> Map k a -> Map k b -> Bool

   containers	Data.Map.Lazy

   The expression (isSubmapOfBy f t1 t2) returns True if all keys in t1 are in tree t2, and when f returns True when applied to their respective values. For example, the following expressions are all True:

   isSubmapOfBy (==) (fromList [('a',1)]) (fromList [('a',1),('b',2)])
   isSubmapOfBy (<=) (fromList [('a',1)]) (fromList [('a',1),('b',2)])
   isSubmapOfBy (==) (fromList [('a',1),('b',2)]) (fromList [('a',1),('b',2)])
   

   But the following are all False:

   isSubmapOfBy (==) (fromList [('a',2)]) (fromList [('a',1),('b',2)])
   isSubmapOfBy (<)  (fromList [('a',1)]) (fromList [('a',1),('b',2)])
   isSubmapOfBy (==) (fromList [('a',1),('b',2)]) (fromList [('a',1)])
   

   Note that isSubmapOfBy (_ _ -> True) m1 m2 tests whether all the keys in m1 are also keys in m2.

9. contramapFirstWhenMatched :: forall b a (f :: Type -> Type) k y z . (b -> a) -> WhenMatched f k a y z -> WhenMatched f k b y z

   containers	Data.Map.Merge.Lazy

   Map contravariantly over a WhenMatched f k _ y z.

10. contramapSecondWhenMatched :: forall b a (f :: Type -> Type) k x z . (b -> a) -> WhenMatched f k x a z -> WhenMatched f k x b z

    containers	Data.Map.Merge.Lazy

    Map contravariantly over a WhenMatched f k x _ z.

Page 407 of many | Previous | Next