map :: Ord k => ((k, a) -> Gen r -> Gen r) -> Map k a -> Gen r -> Gen r
map :: Ord k => ((k, a) -> [(k, a)]) -> Map k a -> [Map k a]
map :: Nat -> (Nat -> LocalId -> Exp) -> Exp -> Exp
map :: (Ord a, Ord b) => (a -> b) -> Bag a -> Bag b

AvlTree - Data.Tree.AVL  

Apply a function to every element in an AVL tree. This function preserves the tree shape. There is also a strict version of this function (map').

N.B. If the tree is sorted the result of this operation will only be sorted if the applied function preserves ordering (for some suitable ordering definition).

Complexity: O(n)

map :: (a -> b) -> f a -> f b Class Method
map :: (Word8 -> Word8) -> Rope -> Rope

Data-Rope - Data.Rope  

O(n). map f r applies f on each element of r and returns the concatenation of the result.

map :: AssocX m k => (a -> b) -> m a -> m b

EdisonAPI - Data.Edison.Assoc  

Apply a function to the elements of every binding in the associative collection. Identical to fmap from Functor.

This function is always unambiguous.

map :: (Coll cin a, CollX cout b) => (a -> b) -> cin -> cout

EdisonAPI - Data.Edison.Coll.Utils  

Apply a function across all the elements in a collection and transform the collection type.

map :: Sequence s => (a -> b) -> s a -> s b

EdisonAPI - Data.Edison.Seq  

Return the result of applying a function to every element of a sequence. Identical to fmap from Functor.

 map f  = 

Axioms:

  • map f empty = empty
  • map f (lcons x xs) = lcons (f x) (map f xs)

This function is always unambiguous.

Default running time: O( t * n ) where t is the running time of f

map :: (Ord k, Functor (FM k)) => (a -> b) -> FM k a -> FM k b
map :: (Enum a, Enum b) => (a -> b) -> Set a -> Set b

EdisonCore - Data.Edison.Coll.EnumSet  

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

It's worth noting that the size of the result may be smaller if, for some (x,y), x /= y && f x == f y