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. isSubmapOfBy :: (a -> b -> Bool) -> IntMap a -> IntMap b -> Bool

   containers	Data.IntMap.Internal

   The expression (isSubmapOfBy f m1 m2) returns True if 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:

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

   But the following are all False:

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

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

   containers	Data.IntMap.Internal

   Map contravariantly over a WhenMissing f _ x.

3. data IntMap a

   containers	Data.IntMap.Lazy

   A map of integers to values a.

4. foldMapWithKey :: Monoid m => (Key -> a -> m) -> IntMap a -> m

   containers	Data.IntMap.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 :: Eq a => IntMap a -> IntMap a -> Bool

   containers	Data.IntMap.Lazy

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

6. isProperSubmapOfBy :: (a -> b -> Bool) -> IntMap a -> IntMap b -> Bool

   containers	Data.IntMap.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 :: Eq a => IntMap a -> IntMap a -> Bool

   containers	Data.IntMap.Lazy

   Is this a submap? Defined as (isSubmapOf = isSubmapOfBy (==)).

8. isSubmapOfBy :: (a -> b -> Bool) -> IntMap a -> IntMap b -> Bool

   containers	Data.IntMap.Lazy

   The expression (isSubmapOfBy f m1 m2) returns True if 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:

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

   But the following are all False:

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

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

   containers	Data.IntMap.Merge.Lazy

   Map contravariantly over a WhenMatched f _ y z.

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

    containers	Data.IntMap.Merge.Lazy

    Map contravariantly over a WhenMatched f x _ z.

Page 404 of many | Previous | Next