Hoogle Search
Within LTS Haskell 24.4 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
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.
mapBits :: (forall a . Bits a => a -> a) -> Vector Bit -> Vector Bitbitvec Data.Bit Map a vectors with the given function. Similar to map, but faster.
>>> :set -XOverloadedLists >>> import Data.Bits >>> mapBits complement [0,1,1] [1,0,0]
mapInPlace :: PrimMonad m => (forall a . Bits a => a -> a) -> MVector (PrimState m) Bit -> m ()bitvec Data.Bit Apply a function to a mutable vector bitwise, rewriting its contents. Cf. mapBits.
>>> :set -XOverloadedLists >>> import Data.Bits >>> Data.Vector.Unboxed.modify (mapInPlace complement) [0,1,1] [1,0,0]
mapBits :: (forall a . Bits a => a -> a) -> Vector Bit -> Vector Bitbitvec Data.Bit.ThreadSafe Map a vectors with the given function. Similar to map, but faster.
>>> :set -XOverloadedLists >>> import Data.Bits >>> mapBits complement [0,1,1] [1,0,0]
mapInPlace :: PrimMonad m => (forall a . Bits a => a -> a) -> MVector (PrimState m) Bit -> m ()bitvec Data.Bit.ThreadSafe Apply a function to a mutable vector bitwise, rewriting its contents. Cf. mapBits.
>>> :set -XOverloadedLists >>> import Data.Bits >>> Data.Vector.Unboxed.modify (mapInPlace complement) [0,1,1] [1,0,0]
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.