Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. mapAccumL :: (Traversable t, Num b, Num c, Reifies s W) => (BVar s a -> BVar s b -> (BVar s a, BVar s c)) -> BVar s a -> BVar s (t b) -> (BVar s a, BVar s (t c))

   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.

2. mapAccumR :: (Traversable t, Num b, Num c, Reifies s W) => (BVar s a -> BVar s b -> (BVar s a, BVar s c)) -> BVar s a -> BVar s (t b) -> (BVar s a, BVar s (t c))

   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.

3. mapMaybe :: (a -> Maybe b) -> Trie a -> Maybe (Trie b)

   bcp47	Data.BCP47.Trie

   No documentation available.

4. mapMaybe :: (a -> Maybe b) -> Trie a -> Maybe (Trie b)

   bcp47	Data.BCP47.Trie.Internal

   No documentation available.

5. mapMaybe2 :: (a -> Maybe b) -> Trie2 a -> Maybe (Trie2 b)

   bcp47	Data.BCP47.Trie.Internal

   No documentation available.

6. mapBits :: (forall a . Bits a => a -> a) -> Vector Bit -> Vector Bit

   bitvec	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]
   

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

8. mapBits :: (forall a . Bits a => a -> a) -> Vector Bit -> Vector Bit

   bitvec	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]
   

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

10. mapArray :: Ix i => (Bool -> Bool) -> IOBitArray i -> IO (IOBitArray i)

    bitwise	Data.Array.BitArray.IO

    Alias for map.

Page 235 of many | Previous | Next