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.
-
backprop Prelude.Backprop.Explicit -
backprop Prelude.Backprop.Explicit -
backprop Prelude.Backprop.Num mapAccumL, but with Num constraints instead of Backprop constraints. Prior to v0.2.3, required a Num constraint on t b.
-
backprop Prelude.Backprop.Num mapAccumR, but with Num constraints instead of Backprop constraints. Prior to v0.2.3, required a Num constraint on t b.
mapMaybe :: (a -> Maybe b) -> Trie a -> Maybe (Trie b)bcp47 Data.BCP47.Trie No documentation available.
mapMaybe :: (a -> Maybe b) -> Trie a -> Maybe (Trie b)bcp47 Data.BCP47.Trie.Internal No documentation available.
mapMaybe2 :: (a -> Maybe b) -> Trie2 a -> Maybe (Trie2 b)bcp47 Data.BCP47.Trie.Internal No documentation available.
mapArray :: Ix i => (Bool -> Bool) -> IOBitArray i -> IO (IOBitArray i)bitwise Data.Array.BitArray.IO Alias for map.
mapIndices :: (Ix i, Ix j) => (i, i) -> (i -> j) -> IOBitArray j -> IO (IOBitArray i)bitwise Data.Array.BitArray.IO Create a new array by reading from another.
mapArray :: Ix i => (Bool -> Bool) -> STBitArray s i -> ST s (STBitArray s i)bitwise Data.Array.BitArray.ST Alias for map.