Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. map :: forall a b (n :: Nat) . (a -> b) -> Vec n a -> Vec n b

   clash-prelude	Clash.Explicit.Prelude.Safe

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

   map f (x1 :> x2 :>  ... :> xn :> Nil) == (f x1 :> f x2 :> ... :> f xn :> Nil)
   

   and corresponds to the following circuit layout:

2. map :: forall a b (n :: Nat) . (a -> b) -> Vec n a -> Vec n b

   clash-prelude	Clash.Prelude

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

   map f (x1 :> x2 :>  ... :> xn :> Nil) == (f x1 :> f x2 :> ... :> f xn :> Nil)
   

   and corresponds to the following circuit layout:

3. map :: forall a b (n :: Nat) . (a -> b) -> Vec n a -> Vec n b

   clash-prelude	Clash.Prelude.Safe

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

   map f (x1 :> x2 :>  ... :> xn :> Nil) == (f x1 :> f x2 :> ... :> f xn :> Nil)
   

   and corresponds to the following circuit layout:

4. map :: forall a b (n :: Nat) . (a -> b) -> Vec n a -> Vec n b

   clash-prelude	Clash.Sized.Vector

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

   map f (x1 :> x2 :>  ... :> xn :> Nil) == (f x1 :> f x2 :> ... :> f xn :> Nil)
   

   and corresponds to the following circuit layout:

5. map :: C sh => T (Map k sh) -> Map k (T sh)

   comfort-blas	Numeric.BLAS.Slice

   QC.forAll (fmap shapeInt $ QC.choose (0,100)) $ \shapeA -> QC.forAll (fmap shapeInt $ QC.choose (0,100)) $ \shapeB -> QC.forAll (fmap shapeInt $ QC.choose (0,100)) $ \shapeC -> QC.forAll (genSlice2 (Map.fromList $ ('a', shapeA) : ('b', shapeB) : ('c', shapeC) : []) (shapeA ::+ shapeB ::+ shapeC)) $ \(sliceMap, sliceParted) -> Slice.map sliceMap Map.! 'b' == Slice.left (Slice.right sliceParted)
   

   QC.forAll (QC.choose (0,100)) $ \numRows -> QC.forAll (QC.choose (0,100)) $ \numColumns -> let rowShape = shapeInt numRows; columnShape = shapeInt numColumns; mapShape_ = Map.fromList $ map (\k -> (k, columnShape)) (Shape.indices rowShape) in QC.forAll (genSlice2 mapShape_ (rowShape, columnShape)) $ \(sliceMap, sliceMatrix) -> Map.toAscList (Slice.map sliceMap) == Array.toAssociations (Slice.rowArray sliceMatrix)
   

6. map :: forall i o u (m :: Type -> Type) . (i -> o) -> Pipe i o u m u

   conduino	Data.Conduino.Combinators

   Process every incoming item with a pure function, and yield its output.

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

   data-interval	Data.IntervalMap.Lazy

   Map a function over all values in the map.

8. map :: (a -> b) -> IntervalMap k a -> IntervalMap k b

   data-interval	Data.IntervalMap.Strict

   Map a function over all values in the map.

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

   dimensional	Numeric.Units.Dimensional.Prelude

   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]
   

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

    distribution-opensuse	OpenSuse.Prelude

    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]
    

Page 37 of many | Previous | Next