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.

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

    containers Data.IntMap.Strict.Internal

    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)])

  2. isSubmapOf :: Eq a => IntMap a -> IntMap a -> Bool

    containers Data.IntMap.Strict.Internal

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

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

    containers Data.IntMap.Strict.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)])

  4. type BitMap = Word

    containers Data.IntSet.Internal

    No documentation available.

  5. bitmapOf :: Int -> BitMap

    containers Data.IntSet.Internal

    No documentation available.

  6. 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.Internal

    Map contravariantly over a WhenMatched f k _ y z.

  7. 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.Internal

    Map contravariantly over a WhenMatched f k x _ z.

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

    containers Data.Map.Internal

    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.

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

    containers Data.Map.Internal

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

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

    containers Data.Map.Internal

    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)])

Page 406 of many | Previous | Next