Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

1. maps :: Dims -> (Array a -> Array b) -> Array a -> Array b

   harpie	Harpie.Array

   Maps a function along specified dimensions.

   >>> pretty $ maps [1] transpose a
   [[[0,12],
   [4,16],
   [8,20]],
   [[1,13],
   [5,17],
   [9,21]],
   [[2,14],
   [6,18],
   [10,22]],
   [[3,15],
   [7,19],
   [11,23]]]
   

2. maps :: forall (ds :: [Nat]) (s :: [Nat]) (s' :: [Nat]) (si :: [Nat]) (si' :: [Nat]) (so :: [Nat]) a b . (KnownNats s, KnownNats s', KnownNats si, KnownNats si', KnownNats so, si ~ Eval (DeleteDims ds s), so ~ Eval (GetDims ds s), s' ~ Eval (InsertDims ds so si'), s ~ Eval (InsertDims ds so si)) => Dims ds -> (Array si a -> Array si' b) -> Array s a -> Array s' b

   harpie	Harpie.Fixed

   Maps a function along specified dimensions.

   >>> pretty $ maps (Dims @'[1]) transpose a
   [[[0,12],
   [4,16],
   [8,20]],
   [[1,13],
   [5,17],
   [9,21]],
   [[2,14],
   [6,18],
   [10,22]],
   [[3,15],
   [7,19],
   [11,23]]]
   

3. mapAccumWithKeyL :: TraversableWithKey t => (Key t -> a -> b -> (a, c)) -> a -> t b -> (a, t c)

   keys	Data.Key

   The mapAccumWithKeyL function behaves like a combination of mapWithKey and foldlWithKey; it applies a function to each element of a structure, passing an accumulating parameter from left to right, and returning a final value of this accumulator together with the new structure.

4. mapAccumWithKeyR :: TraversableWithKey t => (Key t -> a -> b -> (a, c)) -> a -> t b -> (a, t c)

   keys	Data.Key

   The mapAccumWithKeyR function behaves like a combination of mapWithKey and foldrWithKey; it applies a function to each element of a structure, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new structure.

5. mapWithKey :: Keyed f => (Key f -> a -> b) -> f a -> f b

   keys	Data.Key

   No documentation available.

6. mapWithKeyDefault :: TraversableWithKey t => (Key t -> a -> b) -> t a -> t b

   keys	Data.Key

   No documentation available.

7. mapWithKeyM :: (TraversableWithKey t, Monad m) => (Key t -> a -> m b) -> t a -> m (t b)

   keys	Data.Key

   No documentation available.

8. mapWithKeyM_ :: (FoldableWithKey t, Monad m) => (Key t -> a -> m b) -> t a -> m ()

   keys	Data.Key

   No documentation available.

9. mapSize :: Testable prop => (Int -> Int) -> prop -> Property

   massiv-test	Test.Massiv.Utils

   Adjust the test case size for a property, by transforming it with the given function.

10. mapM :: (Context a, Context b, Monad m) => (a -> m b) -> Matrix a -> m (Matrix b)

    matrices	Data.Matrix

    No documentation available.

Page 236 of many | Previous | Next