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. concatMap :: (Char -> Stream Char) -> Stream Char -> Stream Char

   text	Data.Text.Internal.Fusion.Common

   Map a function over a stream that results in a stream and concatenate the results. Properties

   unstream . concatMap (stream . f) . stream = concatMap f
   

2. concatMap :: (Char -> Text) -> Text -> Text

   text	Data.Text.Lazy

   O(n) Map a function over a Text that results in a Text, and concatenate the results.

3. module Data.IntMap

   An efficient implementation of maps from integer keys to values (dictionaries). This module re-exports the value lazy Data.IntMap.Lazy API, plus several deprecated value strict functions. Please note that these functions have different strictness properties than those in Data.IntMap.Strict: they only evaluate the result of the combining function. For example, the default value to insertWith' is only evaluated if the combining function is called and uses it. These modules are intended to be imported qualified, to avoid name clashes with Prelude functions, e.g.

   import Data.IntMap (IntMap)
   import qualified Data.IntMap as IntMap
   

   The implementation is based on big-endian patricia trees. This data structure performs especially well on binary operations like union and intersection. However, my benchmarks show that it is also (much) faster on insertions and deletions when compared to a generic size-balanced map implementation (see Data.Map).
   • Chris Okasaki and Andy Gill, "Fast Mergeable Integer Maps", Workshop on ML, September 1998, pages 77-86, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.5452
   • D.R. Morrison, "PATRICIA -- Practical Algorithm To Retrieve Information Coded In Alphanumeric", Journal of the ACM, 15(4), October 1968, pages 514-534.
   Operation comments contain the operation time complexity in the Big-O notation http://en.wikipedia.org/wiki/Big_O_notation. Many operations have a worst-case complexity of <math>. This means that the operation can become linear in the number of elements with a maximum of <math> -- the number of bits in an Int (32 or 64).

4. data IntMap a

   containers	Data.IntMap.Internal

   A map of integers to values a.

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

   containers	Data.IntMap.Internal

   Map contravariantly over a WhenMatched f _ y z.

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

   containers	Data.IntMap.Internal

   Map contravariantly over a WhenMatched f x _ z.

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

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

8. isProperSubmapOf :: Eq a => IntMap a -> IntMap a -> Bool

   containers	Data.IntMap.Internal

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

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

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

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

    containers	Data.IntMap.Internal

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

Page 403 of many | Previous | Next