>> is:exact

(>>) :: Monad m => m a -> m b -> m b

base Prelude Control.Monad Control.Monad.Instances GHC.Base, haskell-gi-base Data.GI.Base.ShortPrelude, relude Relude.Monad.Reexport, ghc-internal GHC.Internal.Base GHC.Internal.Control.Monad, verset Verset

Sequentially compose two actions, discarding any value produced by the first, like sequencing operators (such as the semicolon) in imperative languages. 'as >> bs' can be understood as the do expression

do as
bs

or in terms of (>>=) as

as >>= const bs

(>>) :: Monad m => m a -> Code m b -> Code m b

template-haskell Language.Haskell.TH.CodeDo

(>>) :: Monad m => m a -> m b -> m b

hedgehog Hedgehog.Internal.Prelude, base-compat Control.Monad.Compat Prelude.Compat, protolude Protolude.Monad, rio RIO.Prelude, base-prelude BasePrelude BasePrelude.Operators, classy-prelude ClassyPrelude, numeric-prelude NumericPrelude NumericPrelude.Base, Cabal-syntax Distribution.Compat.Prelude, universum Universum.Monad.Reexport, ihaskell IHaskellPrelude, basement Basement.Compat.Base Basement.Imports, numhask NumHask.Prelude, base-compat-batteries Control.Monad.Compat, clash-prelude Clash.HaskellPrelude, foundation Foundation, ghc-lib-parser GHC.Prelude.Basic, dimensional Numeric.Units.Dimensional.Prelude, rebase Rebase.Prelude, mixed-types-num Numeric.MixedTypes.PreludeHiding, constrained-categories Control.Category.Hask, copilot-language Copilot.Language.Prelude, massiv-test Test.Massiv.Utils, incipit-base Incipit.Base, LambdaHack Game.LambdaHack.Core.Prelude Game.LambdaHack.Core.Prelude, cabal-install-solver Distribution.Solver.Compat.Prelude, faktory Faktory.Prelude, can-i-haz Control.Monad.Except.CoHas Control.Monad.Reader.Has, vcr Imports, yesod-paginator Yesod.Paginator.Prelude, distribution-opensuse OpenSuse.Prelude OpenSuse.Prelude, termonad Termonad.Prelude

do as
bs

(>>) :: Monad m => m a -> m b -> m b

ghc GHC.Prelude.Basic

(>>) :: Bind m => m a -> m b -> m b

semigroupoids Semigroupoids.Do

(>>) :: Monad m => m a -> m b -> m b

basic-prelude CorePrelude, prelude-compat Prelude2010, control-monad-free Control.Monad.Free

Sequentially compose two actions, discarding any value produced by the first, like sequencing operators (such as the semicolon) in imperative languages.

(>>) :: forall e s (a :: TYPE ra) (b :: TYPE rb) . Bind ra rb => Parser e s a -> Parser e s b -> Parser e s b

bytesmith Data.Bytes.Parser.Rebindable

type (>>) ma mb = ma >>= Const' mb

type-spec Test.TypeSpec.Internal.Apply

Execute one action and then the next, ignore the result of the first.

(>>) :: Arr x y -> Arr y z -> Arr x z

xmonad-contrib XMonad.Config.Prime

Composes two Arrs using >>= from Prelude.

(>>) :: (WellPointed k, Monad m k, ObjectPair k b (UnitObject k), ObjectPair k (m b) (UnitObject k), ObjectPair k (UnitObject k) (m b), ObjectPair k b a, ObjectPair k a b, Object k (m (a, b)), ObjectPair k (m a) (m b), ObjectPoint k (m a)) => m a -> k (m b) (m b)

constrained-categories Control.Category.Constrained.Prelude Control.Monad.Constrained

(>>) :: Expression v -> Expression v -> Expression v

elm-syntax Language.Elm.Expression