Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. map :: MonadState (Deque a) m => (a -> a) -> m ()

   deque	Deque.Lazy.State

   Modify each element of the queue.

2. map :: MonadReader (Deque a) m => (a -> b) -> m (Deque b)

   deque	Deque.Strict.Reader

   Modify each element of the queue.

3. map :: MonadState (Deque a) m => (a -> a) -> m ()

   deque	Deque.Strict.State

   Modify each element of the queue.

4. map :: (Vector v a, Vector v b) => (a -> b) -> v a -> v b

   fixed-vector	Data.Vector.Fixed

   Map over vector

5. map :: forall (n :: PeanoNum) a b . ArityPeano n => (a -> b) -> ContVec n a -> ContVec n b

   fixed-vector	Data.Vector.Fixed.Cont

   Map over vector. Synonym for fmap

6. map :: Ord b => (a -> b) -> Heap a -> Heap b

   heaps	Data.Heap

   O(n). Map a function over the heap, returning a new heap ordered appropriately for its fresh contents

   >>> map negate (fromList [3,1,2])
   fromList [-3,-1,-2]
   

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

   mixed-types-num	Numeric.MixedTypes.PreludeHiding

   map f xs is the list obtained by applying f to each element of xs, i.e.,

   map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn]
   map f [x1, x2, ...] == [f x1, f x2, ...]
   

   this means that map id == id

   Examples

   >>> map (+1) [1, 2, 3]
   [2,3,4]
   

   >>> map id [1, 2, 3]
   [1,2,3]
   

   >>> map (\n -> 3 * n + 1) [1, 2, 3]
   [4,7,10]
   

8. map :: MonoidNull v2 => (v1 -> v2) -> MonoidMap k v1 -> MonoidMap k v2

   monoidmap	Data.MonoidMap

   Applies a function to all non-null values of a MonoidMap. Satisfies the following properties for all functions f:

   (get k m == mempty) ==> (get k (map f m) == mempty     )
   (get k m /= mempty) ==> (get k (map f m) == f (get k m))
   

   Conditional properties

   If applying function f to mempty produces mempty, then the following additional properties hold:

   (f mempty == mempty)
   ==>
   (∀ k. get k (map f m) == f (get k m))
   

   (f mempty == mempty)
   ==>
   (∀ g. map (f . g) m == map f (map g m))
   

9. map :: (a -> b) -> NonEmptyVector a -> NonEmptyVector b

   nonempty-vector	Data.Vector.NonEmpty

   O(n) Map a function over a non-empty vector.

   >>> map (+1) $ unsafeFromList [1..3]
   [2,3,4]
   

10. map :: (Shape sh, Source r a) => (a -> b) -> Array r sh a -> Array D sh b

    repa	Data.Array.Repa

    Apply a worker function to each element of an array, yielding a new array with the same extent.

Page 32 of many | Previous | Next