Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

  1. data MapField'MapFieldType

    riak-protobuf Data.Riak.Proto

    No documentation available.

  2. MapField'REGISTER :: MapField'MapFieldType

    riak-protobuf Data.Riak.Proto

    No documentation available.

  3. MapField'SET :: MapField'MapFieldType

    riak-protobuf Data.Riak.Proto

    No documentation available.

  4. data MapOp

    riak-protobuf Data.Riak.Proto

    Fields :

    • removes :: Lens' MapOp [MapField]
    • vec'removes :: Lens' MapOp (Data.Vector.Vector MapField)
    • updates :: Lens' MapOp [MapUpdate]
    • vec'updates :: Lens' MapOp (Data.Vector.Vector MapUpdate)

  5. data MapUpdate

    riak-protobuf Data.Riak.Proto

    Fields :

    • field :: Lens' MapUpdate MapField
    • counterOp :: Lens' MapUpdate CounterOp
    • maybe'counterOp :: Lens' MapUpdate (Prelude.Maybe CounterOp)
    • setOp :: Lens' MapUpdate SetOp
    • maybe'setOp :: Lens' MapUpdate (Prelude.Maybe SetOp)
    • registerOp :: Lens' MapUpdate Data.ByteString.ByteString
    • maybe'registerOp :: Lens' MapUpdate (Prelude.Maybe Data.ByteString.ByteString)
    • flagOp :: Lens' MapUpdate MapUpdate'FlagOp
    • maybe'flagOp :: Lens' MapUpdate (Prelude.Maybe MapUpdate'FlagOp)
    • mapOp :: Lens' MapUpdate MapOp
    • maybe'mapOp :: Lens' MapUpdate (Prelude.Maybe MapOp)

  6. MapUpdate'DISABLE :: MapUpdate'FlagOp

    riak-protobuf Data.Riak.Proto

    No documentation available.

  7. MapUpdate'ENABLE :: MapUpdate'FlagOp

    riak-protobuf Data.Riak.Proto

    No documentation available.

  8. data MapUpdate'FlagOp

    riak-protobuf Data.Riak.Proto

    No documentation available.

  9. mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)

    base Prelude

    Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see mapM_.

    Examples

    mapM is literally a traverse with a type signature restricted to Monad. Its implementation may be more efficient due to additional power of Monad.

  10. mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()

    base Prelude

    Map each element of a structure to a monadic action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see mapM. mapM_ is just like traverse_, but specialised to monadic actions.

Page 87 of many | Previous | Next