Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

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

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

    No documentation available.

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

    comfort-array Data.Array.Comfort.Storable

    No documentation available.

  3. 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.

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

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

    No documentation available.

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

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

    No documentation available.

  6. 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.

  7. 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.

  8. 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.

  9. mapEitherWithKey :: GCompare k2 => (forall (v :: k1) . () => k2 v -> f v -> Either (g v) (h v)) -> DMap k2 f -> (DMap k2 g, DMap k2 h)

    dependent-map Data.Dependent.Map

    O(n). Map keys/values and separate the Left and Right results.

  10. mapKeysWith :: GCompare k2 => (forall (v :: k) . () => k2 v -> f v -> f v -> f v) -> (forall (v :: k) . () => k1 v -> k2 v) -> DMap k1 f -> DMap k2 f

    dependent-map Data.Dependent.Map

    O(n*log n). mapKeysWith c f s is the map obtained by applying f to each key of s. The size of the result may be smaller if f maps two or more distinct keys to the same new key. In this case the associated values will be combined using c.

Page 135 of many | Previous | Next