Hoogle Search

Within LTS Haskell 24.50 (ghc-9.10.3)

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

Exact lookup

1. mapShape :: (C sh0, C sh1) => (sh0 -> sh1) -> Array sh0 -> Array sh1

   comfort-array	Data.Array.Comfort.Bool

   No documentation available.

2. mapShape :: (C sh0, C sh1) => (sh0 -> sh1) -> Array sh0 a -> Array sh1 a

   comfort-array	Data.Array.Comfort.Boxed

   No documentation available.

3. mapShape :: (sh0 -> sh1) -> Array sh0 a -> Array sh1 a

   comfort-array	Data.Array.Comfort.Boxed.Unchecked

   No documentation available.

4. mapShape :: (C sh0, C sh1) => (sh0 -> sh1) -> Array sh0 a -> Array sh1 a

   comfort-array	Data.Array.Comfort.Storable

   No documentation available.

5. mapWithIndex :: (Indexed sh, Index sh ~ ix, Storable a, Storable b) => (ix -> a -> b) -> Array sh a -> Array sh b

   comfort-array	Data.Array.Comfort.Storable

   No documentation available.

6. mapShape :: (sh0 -> sh1) -> Array sh0 a -> Array sh1 a

   comfort-array	Data.Array.Comfort.Storable.Private

   No documentation available.

7. mapShape :: (sh0 -> sh1) -> Array sh0 a -> Array sh1 a

   comfort-array	Data.Array.Comfort.Storable.Unchecked

   No documentation available.

8. mapWithIndex :: (Indexed sh, Index sh ~ ix, Storable a, Storable b) => (ix -> a -> b) -> Array sh a -> Array sh b

   comfort-array	Data.Array.Comfort.Storable.Unchecked

   No documentation available.

9. mapAccumLWithKey :: (forall (v :: k1) . () => a -> k2 v -> f v -> (a, g v)) -> a -> DMap k2 f -> (a, DMap k2 g)

   dependent-map	Data.Dependent.Map

   O(n). The function mapAccumLWithKey threads an accumulating argument through the map in ascending order of keys.

10. mapAccumRWithKey :: (forall (v :: k1) . () => a -> k2 v -> f v -> (a, g v)) -> a -> DMap k2 f -> (a, DMap k2 g)

    dependent-map	Data.Dependent.Map

    O(n). The function mapAccumRWithKey threads an accumulating argument through the map in descending order of keys.

Page 135 of many | Previous | Next