Hoogle Search

Within LTS Haskell 24.15 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. map :: (a -> b) -> MultiMap k a -> MultiMap k b

   multimap	Data.MultiMap

   Map a function over all values in the map.

2. map :: (Ord a, Ord b) => (a -> b) -> SetMap k a -> SetMap k b

   multimap	Data.SetMap

   Map a function over all values in the map.

3. map :: (a -> b) -> NEIntMap a -> NEIntMap b

   nonempty-containers	Data.IntMap.NonEmpty

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

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

4. map :: (a -> b) -> NEIntMap a -> NEIntMap b

   nonempty-containers	Data.IntMap.NonEmpty.Internal

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

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

5. map :: (Key -> Key) -> NEIntSet -> NEIntSet

   nonempty-containers	Data.IntSet.NonEmpty

   O(n*log 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

6. map :: (a -> b) -> NEMap k a -> NEMap k b

   nonempty-containers	Data.Map.NonEmpty

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

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

7. map :: (a -> b) -> NEMap k a -> NEMap k b

   nonempty-containers	Data.Map.NonEmpty.Internal

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

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

8. map :: (a -> b) -> NESeq a -> NESeq b

   nonempty-containers	Data.Sequence.NonEmpty.Internal

   Defined here but hidden; intended for use with RULES pragma.

9. map :: Ord b => (a -> b) -> NESet a -> NESet b

   nonempty-containers	Data.Set.NonEmpty

   O(n*log 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

10. map :: (a -> b) -> [a] -> [b]

    prelude-compat	Data.List2010

    No documentation available.

Page 18 of many | Previous | Next