Help | Examples | About | API | Blog | Hackage | Haskell
Concurrently search more than 6250 packages and more than 585655 functions! (Index generated: Tue, 25 Mar 2014 16:41:17 UTC )
Found 232 functions, 0 packages and 42 completions.
Data.Map.Lazy.map:: (a -> b) -> Map k a -> Map k b
containers

O(n). Map a function over all values in the map.

 map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]
Source
Data.Map.Lazy.Lazy:: module
containers

An efficient implementation of ordered maps from keys to values (dictionaries).

API of this module is strict in the keys, but lazy in the values. If you need value-strict maps, use Data.Map.Strict instead. The Map type itself is shared between the lazy and strict modules, meaning that the same Map value can be passed to functions in both modules (although that is rarely needed).

These modules are intended to be imported qualified, to avoid name clashes with Prelude functions, e.g.

  import qualified Data.Map.Lazy as Map

The implementation of Map is based on size balanced binary trees (or trees of bounded balance) as described by:

  • Stephen Adams, "Efficient sets: a balancing act", Journal of Functional Programming 3(4):553-562, October 1993, http://www.swiss.ai.mit.edu/~adams/BB/.
  • J. Nievergelt and E.M. Reingold, "Binary search trees of bounded balance", SIAM journal of computing 2(1), March 1973.

Note that the implementation is left-biased -- the elements of a first argument are always preferred to the second, for example in union or insert.

Operation comments contain the operation time complexity in the Big-O notation (http://en.wikipedia.org/wiki/Big_O_notation).

Source
Data.IntMap.Lazy.map:: (a -> b) -> IntMap a -> IntMap b
containers

O(n). Map a function over all values in the map.

 map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]
Source
Data.ByteString.Lazy.map:: (Word8 -> Word8) -> ByteString -> ByteString
bytestring

O(n) map f xs is the ByteString obtained by applying f to each element of xs.

Source
Data.Map.Lazy.Map:: data
containers

A Map from keys k to values a.

Source
Data.Text.Lazy.map:: (Char -> Char) -> Text -> Text
text

O(n) map f t is the Text obtained by applying f to each element of t. Subject to fusion. Performs replacement on invalid scalar values.

Source
Data.HashMap.Lazy.map:: (v1 -> v2) -> HashMap k v1 -> HashMap k v2
unordered-containers
No description.
Source
Data.ByteString.Lazy.Char8.map:: (Char -> Char) -> ByteString -> ByteString
bytestring

O(n) map f xs is the ByteString obtained by applying f to each element of xs

Source
Data.Map.Lazy.showTreeWith:: (k -> a -> String) -> Bool -> Bool -> Map k a -> String
containers
No description.
Source
Data.Map.Lazy.foldMapWithKey:: (k -> a -> m) -> Map k a -> m
containers

O(n). 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.

Source
Powered by Haskell, HXT, Snap, and
Please send any feedback to hayoo@holumbus.org