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

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

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

4. mapBound :: forall (f :: Type -> Type) b b' a . Functor f => (b -> b') -> Scope b f a -> Scope b' f a

   bound	Bound.Scope

   Perform a change of variables on bound variables.

5. mapMBound :: forall m (f :: Type -> Type) b c a . (Monad m, Traversable f) => (b -> m c) -> Scope b f a -> m (Scope c f a)

   bound	Bound.Scope

   mapM over both bound and free variables

6. mapMBound_ :: forall g (f :: Type -> Type) b d a . (Monad g, Foldable f) => (b -> g d) -> Scope b f a -> g ()

   bound	Bound.Scope

   mapM_ over the variables bound by this scope

7. mapMScope :: forall m (f :: Type -> Type) b d a c . (Monad m, Traversable f) => (b -> m d) -> (a -> m c) -> Scope b f a -> m (Scope d f c)

   bound	Bound.Scope

   A traverseScope that can be used when you only have a Monad instance

8. mapMScope_ :: forall m (f :: Type -> Type) b d a c . (Monad m, Foldable f) => (b -> m d) -> (a -> m c) -> Scope b f a -> m ()

   bound	Bound.Scope

   A traverseScope_ that can be used when you only have a Monad instance

9. mapScope :: forall (f :: Type -> Type) b d a c . Functor f => (b -> d) -> (a -> c) -> Scope b f a -> Scope d f c

   bound	Bound.Scope

   Perform a change of variables, reassigning both bound and free variables.

10. mapBound :: forall (f :: Type -> Type) b b' a . Functor f => (b -> b') -> Scope b f a -> Scope b' f a

    bound	Bound.Scope.Simple

    Perform a change of variables on bound variables.

Page 191 of many | Previous | Next