Found 232 functions, 0 packages and 42 completions.

Data.Map.Lazy. | map | :: (a -> b) -> Map k a -> Map k b |

containers |
map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")] | |

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 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 - 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 Operation comments contain the operation time complexity in the Big-O notation (http://en.wikipedia.org/wiki/Big_O_notation). | |

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

containers |
map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")] | |

Data.ByteString.Lazy. | map | :: (Word8 -> Word8) -> ByteString -> ByteString |

bytestring | ||

Data.Map.Lazy. | Map | :: data |

containers | ||

Data.Text.Lazy. | map | :: (Char -> Char) -> Text -> Text |

text | ||

Data.HashMap.Lazy. | map | :: (v1 -> v2) -> HashMap k v1 -> HashMap k v2 |

unordered-containers | ||

Data.ByteString.Lazy.Char8. | map | :: (Char -> Char) -> ByteString -> ByteString |

bytestring | ||

Data.Map.Lazy. | showTreeWith | :: (k -> a -> String) -> Bool -> Bool -> Map k a -> String |

containers | ||

Data.Map.Lazy. | foldMapWithKey | :: (k -> a -> m) -> Map k a -> m |

containers |
This can be an asymptotically faster than |