Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

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

Exact lookup

1. mapTreeData :: (a -> b) -> CondTree v c a -> CondTree v c b

   Cabal-syntax	Distribution.Types.CondTree

   No documentation available.

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

   comfort-array	Data.Array.Comfort.Bool

   No documentation available.

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

   comfort-array	Data.Array.Comfort.Boxed

   No documentation available.

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

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

   No documentation available.

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

   comfort-array	Data.Array.Comfort.Storable

   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

   No documentation available.

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

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

   No documentation available.

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

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

   No documentation available.

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

10. mapNTree' :: (a -> Maybe a) -> NTree a -> NTree a

    hxt	Data.Tree.NTree.Edit

    A space optimized map for NTrees Subtrees, that are not changed are reused in the resulting tree See also: editNTreeBottomUp

Page 171 of many | Previous | Next