Last active
September 25, 2015 21:06
-
-
Save hvr/0dd477935266c00c58e0 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| $ rgrep -A50 '^instance.*Monad' | grep ' \((>>)\|>> \).*=' | |
| acme-timemachine-0.0.1.0/src/Acme/TimeMachine/Undoable.hs- (Undoable k) >> (Undoable f) = Undoable $ \l -> case k l of ~(l, _) -> f l | |
| Agda-2.4.2.3/src/full/Agda/TypeChecking/Monad/Base.hs- (>>) = thenTCMT | |
| ajhc-0.8.0.10/lib/jhc/Jhc/Monad.hs- ST x >> ST y = ST $ \w -> case x w of | |
| ajhc-0.8.0.10/lib/jhc/Jhc/Monad.hs- x >> y = x `thenIO_` y | |
| ajhc-0.8.0.10/src/FindFixpoint.hs- Ms' a >> Ms' b = Ms' $ \v -> a v >> b v | |
| ajhc-0.8.0.10/src/Util/ReaderWriter.hs- (ReaderWriter f) >> (ReaderWriter g) = ReaderWriter $ \r -> case f r of | |
| ajhc-0.8.0.10/src/FrontEnd/ParseMonad.hs- Lex v >> Lex w = Lex $ \k -> v (\_ -> w k) | |
| ajhc-0.8.0.10/src/FrontEnd/Tc/Monad.hs- Tc a >> Tc b = Tc $ a >> b | |
| ajhc-0.8.0.10/src/Stats.hs- StatM _ s1 >> StatM y s2 = StatM y (s1 `mappend` s2) | |
| alpha-1.0.15/src/Alpha.hs-withRef ref val x = readIORef ref >>= \v -> writeIORef ref val >> x >>= \x -> writeIORef ref v >> return x | |
| base-4.8.0.0/Control/Monad/ST/Lazy/Imp.hs- m >> k = m >>= \ _ -> k | |
| base-4.8.0.0/GHC/Base.hs- (>>) = (*>) | |
| base-4.8.0.0/GHC/Base.hs- (>>) = (*>) | |
| base-4.8.0.0/GHC/Base.hs- m >> k = m >>= \ _ -> k | |
| base-4.8.0.0/GHC/ST.hs- m >> k = m >>= \ _ -> k | |
| base-4.8.0.0/GHC/Conc/Sync.hs- m >> k = thenSTM m k | |
| base-4.8.0.0/Text/ParserCombinators/ReadP.hs- probe p@(Result _ _) _ n = discard n >> R (p >>=) | |
| BASIC-0.1.5.0/Language/BASIC/Parser.hs- a >> b = unsafePerformIO $ do push (flex a); push (flex b) | |
| bencoding-0.4.3.0/src/Data/BEncode.hs- Get m >> Get n = Get (m >> n) | |
| binary-0.7.5.0/src/Data/Binary/Put.hs- m >> k = Put $ | |
| binary-strict-0.4.8.2/src/Data/Binary/BitPut.hs- m >> k = BitPutM (let (_, w) = unPut m | |
| bind-marshal-0.1/src/Bind/Marshal/Action/Monad.hs- - pre_action >> post_action = equiv_action | |
| bind-marshal-0.1/src/Bind/Marshal/Control/Monad/Parameterized.hs- (>>) = (Old.>>) | |
| blaze-builder-0.4.0.1/benchmarks/UnboxedAppend.hs- m >> n = Put $ \k -> unPut m (\_ -> unPut n k) | |
| blaze-builder-0.4.0.1/benchmarks/UnboxedAppend.hs- (LBSM (_,k)) >> (LBSM (x',k')) = LBSM (x', k . k') | |
| blaze-builder-0.4.0.1/benchmarks/FastPut.hs- m >> n = Put $ \k -> unPut m (\_ -> unPut n k) | |
| blaze-builder-0.4.0.1/benchmarks/FastPut.hs- (LBSM (_,k)) >> (LBSM (x',k')) = LBSM (x', k . k') | |
| blaze-builder-0.4.0.1/benchmarks/Throughput/BlazePutMonad.hs- m >> k = Put $ | |
| blaze-markup-0.7.0.2/src/Text/Blaze/Internal.hs- (>>) = Append | |
| bytestring-0.10.6.0/Data/ByteString/Builder/Internal.hs- (>>) = ap_r | |
| bytestring-builder-0.10.6.0.0/src/Data/ByteString/Builder/Internal.hs- (>>) = ap_r | |
| bytestring-trie-0.2.4.1/src/Data/Trie/Internal.hs--- 3. m >> mzero === mzero | |
| bzlib-0.5.0.5/Codec/Compression/BZip/Stream.hsc- (>>) = thenZ_ | |
| cabal-install-bundle-1.18.0.2.1/Codec/Compression/Zlib/Stream.hsc- (>>) = thenZ_ | |
| catch-fd-0.2.0.2/Control/Monad/Catch.hs- m >> n = WrapMonadError $ unwrapMonadError m >> unwrapMonadError n | |
| catch-fd-0.2.0.2/Control/Monad/Catch.hs- m >> n = WrapMonadCatch $ unwrapMonadCatch m >> unwrapMonadCatch n | |
| cereal-0.4.1.1/src/Data/Serialize/Put.hs- m >> k = Put $ | |
| ClassLaws-0.3.1.0/src/Control/Monad/Laws.hs-defaultMonadPlusLaw4 v = v >> mzero =.= mzero | |
| ClassLaws-0.3.1.0/src/Control/Monad/Laws/Instances.hs- m >> k = foldrMyList ((+++) . (\ _ -> k)) Nil m | |
| compressed-3.10/src/Data/Compressed/RunLengthEncoding.hs- Run n _ >> Run m b = Run (n * m) b | |
| compressed-3.10/src/Data/Compressed/RunLengthEncoding.hs- (>>) = (*>) | |
| compressed-3.10/src/Data/Compressed/Internal/LZ78.hs- (>>) = (*>) | |
| ConstraintKinds-1.3.0/src/Control/ConstraintKinds/Monad.hs- (>>) = (Monad.>>) | |
| ConstraintKinds-1.3.0/src/Control/ConstraintKinds/Monad.hs- (>>) = (Monad.>>) | |
| containers-0.5.6.3/Data/Sequence.hs- (>>) = (*>) | |
| CoreErlang-0.0.2/Language/CoreErlang/Pretty.hs- (>>) = then_DocM | |
| Coroutine-0.1.0.0/Control/Coroutine.hs- m >> n = LiftWM (runWM m P.>> runWM n) | |
| cpsa-2.5.0/src/CPSA/Annotations/Formulas.hs- 2. (RightS r >> k) >>= h ==> k r >>= h | |
| dao-0.1.0.1/src/Dao/Tree.hs- runStateT (getUpdateTreeStateT (updfn >>= \a -> home >> return a)) (ZipTree{focus=tree, history=[]}) | |
| dao-0.1.0.1/src/Dao/Predicate.hs- PredicateT ma >> PredicateT mb = PredicateT $ do | |
| dao-0.1.0.1/src/Dao/Binary.hs- Get a >> Get b = Get (a >> b) | |
| Dao-0.1.0.2/src/Dao/Tree.hs- runStateT (getUpdateTreeStateT (updfn >>= \a -> home >> return a)) (ZipTree{focus=tree, history=[]}) | |
| Dao-0.1.0.2/src/Dao/Predicate.hs- PredicateT ma >> PredicateT mb = PredicateT $ do | |
| Dao-0.1.0.2/src/Dao/Binary.hs- Get a >> Get b = Get (a >> b) | |
| darcs-beta-2.7.99.2/src/Darcs/Patch/Prim/V1/Commute.hs- Failed >> _ = Failed | |
| darcs-beta-2.7.99.2/src/Darcs/Patch/Prim/V1/Commute.hs- (Succeeded _) >> k = k | |
| darcs-beta-2.7.99.2/src/Darcs/Patch/Prim/V1/Commute.hs- Unknown >> k = k | |
| darcs-beta-2.7.99.2/src/Darcs/Patch/V1/Commute.hs- Failed >> _ = Failed | |
| darcs-beta-2.7.99.2/src/Darcs/Patch/V1/Commute.hs- (Succeeded _) >> k = k | |
| darcs-beta-2.7.99.2/src/Darcs/Patch/V1/Commute.hs- Unknown >> k = k | |
| darcs-beta-2.7.99.2/src/Darcs/Repository/Internal.hs- (>>) = (>>>) | |
| darcs-beta-2.7.99.2/src/Darcs/IO.hs- f >> g = runTM $ runIO f >> runIO g | |
| darcs-beta-2.7.99.2/src/Darcs/IO.hs- f >> g = runTM $ runIO f >> runIO g | |
| darcs-cabalized-2.0.2.2/src/Darcs/Patch/Prim.lhs- Failed >> _ = Failed | |
| darcs-cabalized-2.0.2.2/src/Darcs/Patch/Prim.lhs- (Succeeded _) >> k = k | |
| darcs-cabalized-2.0.2.2/src/Darcs/Patch/Prim.lhs- Unknown >> k = k | |
| darcs-cabalized-2.0.2.2/src/Darcs/Patch/Commute.lhs- Failed >> _ = Failed | |
| darcs-cabalized-2.0.2.2/src/Darcs/Patch/Commute.lhs- (Succeeded _) >> k = k | |
| darcs-cabalized-2.0.2.2/src/Darcs/Patch/Commute.lhs- Unknown >> k = k | |
| darcs-cabalized-2.0.2.2/src/Darcs/IO.lhs- f >> g = runTM $ runIO f >> runIO g | |
| darcs-cabalized-2.0.2.2/src/Darcs/IO.lhs- f >> g = runTM $ runIO f >> runIO g | |
| data-textual-0.3.0.2/src/Data/Textual.hs- (>>) = (*>) | |
| DAV-1.0.5/Network/Protocol/HTTP/DAV.hs-setCreds u p = basicusername .= u >> basicpassword .= p | |
| dbus-0.10.10/lib/DBus/Wire.hs- m >> k = Wire $ \e s -> case unWire m e s of | |
| dbus-core-0.9.3/src/wire.anansi- m >> k = Wire $ \e s -> case unWire m e s of | |
| dbus-core-0.9.3/hs/DBus/Wire/Internal.hs- m >> k = Wire $ \e s -> case unWire m e s of | |
| dgs-0.2/Network/DGS.hs-silence = DGS $ setErrHandler quiet >> setOutHandler quiet where quiet _ = return () | |
| dph-lifted-copy-0.7.0.1/Data/Array/Parallel.hs- m >> k = foldrP ((+:+) . const k) [::] m | |
| Euterpea-1.0.0/HSoM/Monads.lhs-m1 >> (m2 >> m3) = (m1 >> m2) >> m3 | |
| faceted-0.0.2.0/Data/Faceted/Internal.hs--- | << pc ? x : y >> =====> pcF pc x y | |
| fay-0.23.1.6/examples/Cont.hs- m >> n = m >>= \_ -> n | |
| fay-0.23.1.6/examples/Cont.hs- in CC return (>>=) (>>) callCC lift where (>>=*) = (>>=) | |
| fay-0.23.1.6/tests/Monad2.hs- (>>) = \a b -> a >>= \_ -> b | |
| fenfire-0.1/_darcs/pristine/Preprocessor/Hsx/ParseMonad.hs- Lex v >> Lex w = Lex $ \k -> v (\_ -> w k) | |
| fenfire-0.1/Preprocessor/Hsx/ParseMonad.hs- Lex v >> Lex w = Lex $ \k -> v (\_ -> w k) | |
| fmlist-0.9/Data/FMList.hs- m >> k = transform (\f -> const (foldMap f k)) m | |
| folds-0.6.2/src/Data/Fold/L'.hs- _ >> n = n | |
| folds-0.6.2/src/Data/Fold/L.hs- _ >> n = n | |
| folds-0.6.2/src/Data/Fold/L1'.hs- _ >> n = n | |
| folds-0.6.2/src/Data/Fold/L1.hs- _ >> n = n | |
| folds-0.6.2/src/Data/Fold/M.hs- _ >> n = n | |
| folds-0.6.2/src/Data/Fold/M1.hs- _ >> n = n | |
| folds-0.6.2/src/Data/Fold/R.hs- _ >> n = n | |
| folds-0.6.2/src/Data/Fold/R1.hs- _ >> n = n | |
| freesect-0.8/HSE/Pretty.hs- (>>) = then_DocM | |
| freesect-0.8/HSE/ParseMonad.hs- Lex v >> Lex w = Lex $ \k -> v (\_ -> w k) | |
| genericserialize-0.1/Data/Generics/Serialization/Streams.hs- (LB l1 _) >> (LB l2 a) = LB (l1 . l2) a | |
| getopt-generics-0.7.1/src/System/Console/GetOpt/Generics/Result.hs- (>>) = (*>) | |
| gf-3.6/src/binary/Data/Binary/Put.hs- m >> k = Put $ | |
| ginsu-0.8.1/Boolean/Boolean.hs- --a >> b = a && b | |
| ginsu-0.8.1/SimpleParser.hs-between o c p = o >> p >>= \v -> c >> return v | |
| grammar-combinators-0.2.7/Text/GrammarCombinators/Parser/TopDown.hs- ra >> rb = MkNBR $ \g -> unNBR ra g >> unNBR rb g | |
| graphs-0.6.0.1/src/Data/Graph/Dual.hs- Dual g >> Dual h = Dual (g >> h) | |
| gtk2hs-buildtools-0.13.0.3/c2hs/base/state/StateBase.hs- (>>) = (+>) | |
| gtk2hs-buildtools-0.13.0.3/c2hs/base/state/StateTrans.hs- (>>) = (+>) | |
| hans-2.5.0.0/src/Hans/Layer/Tcp/Monad.hs- m >> n = Sock $ \ s x k -> unSock m s x | |
| happstack-server-7.4.4/src/Happstack/Server/Internal/Monads.hs-escape gen = ignoreFilters >> gen >>= finishWith | |
| haskell-src-1.0.2.0/Language/Haskell/Pretty.hs- (>>) = then_DocM | |
| haskell-src-1.0.2.0/Language/Haskell/ParseMonad.hs- Lex v >> Lex w = Lex $ \k -> v (\_ -> w k) | |
| haskell-src-exts-1.16.0.1/src/Language/Haskell/Exts/Pretty.hs- (>>) = then_DocM | |
| haskell-src-exts-1.16.0.1/src/Language/Haskell/Exts/ParseMonad.hs- Lex v >> Lex w = Lex $ \k -> v (\_ -> w k) | |
| haskore-vintage-0.2/src/Haskore/Monads.hs- m >> k = SR (\s -> case (unSR m) s of _ -> (unSR k) s) | |
| haskore-vintage-0.2/src/Haskore/Monads.hs- m >> k = S (\s -> case (unS m) s of (_,s') -> (unS k) s') | |
| haskore-vintage-0.2/src/Haskore/Monads.hs- m >> k = IOS (\s -> unIOS m s >>= \(_,s') -> unIOS k s') | |
| haskore-vintage-0.2/src/Haskore/Monads.hs- m >> k = O (let (a,r) = unO m; (b,s) = unO k in (b, r . s)) | |
| haskore-vintage-0.2/src/Haskore/Monads.hs- m >> k = CPS (\c -> unCPS m (\a -> unCPS k c)) | |
| hasktags-0.69.1/testcases/testcase9.hs- m >> k = foldr ((++) . (\ _ -> k)) [] m | |
| hasktags-0.69.1/testcases/testcase9.hs- m >> k = m >>= \ _ -> k | |
| hasktags-0.69.1/testcases/testcase10.hs- m >> k = m >>= \_ -> k | |
| haste-markup-0.0.1.0/src/Haste/Markup/Internal.hs- (>>) = Append | |
| haste-perch-0.1.0.9/Haste/Perch.hs- (>>) x y= mappend (unsafeCoerce x) y | |
| haste-perch-0.1.0.9/Haste/App/Perch.hs- (>>) x y= mappend (unsafeCoerce x) y | |
| HGL-3.2.0.5/Graphics/HGL/Internals/Draw.hs- m >> k = MkDraw (\ dc -> do { unDraw m dc; unDraw k dc }) | |
| Hipmunk-5.2.0.16/Physics/Hipmunk/Callbacks.hsc- (CB m) >> n = CB (m >> unCB n) | |
| hole-0.1.1/src/Data/Hole/Strict.hs- Hole >> _ = Hole | |
| hole-0.1.1/src/Data/Hole/Lazy.hs- _ >> _ = Hole | |
| iconv-0.4.1.3/Codec/Text/IConv/Internal.hs- (>>) = thenI | |
| improve-0.4.0/Language/ImProve.hs- (Case f1) >> (Case f2) = Case $ f1 . f2 | |
| incremental-parser-0.2.3.4/Test/TestIncrementalParser.hs- TestParser (Described d1 p1) >> TestParser (Described d2 p2) = | |
| incremental-parser-0.2.3.4/Text/ParserCombinators/Incremental.hs- Result t _ >> p = feed t p | |
| incremental-parser-0.2.3.4/Text/ParserCombinators/Incremental.hs- ResultPart _ e f >> p | isInfallible p = ResultPart id (e >> p) ((>> p) . f) | |
| incremental-parser-0.2.3.4/Text/ParserCombinators/Incremental.hs- p1 >> p2 = apply (>> p2) p1 | |
| IOR-0.1/src/System/IOR/Internal.hs- m >> n = IOR $ liftA2 (>>) (unIOR m) (unIOR n) | |
| language-c-quote-0.10.2.2/Language/C/Parser/Monad.hs- m1 >> m2 = P $ \s -> | |
| lazyio-0.1.0.1/src/System/IO/Lazy.hs-*LazyIO> run (interleave (putStrLn "bla") >> interleave getLine) >>= print | |
| lgtk-0.8.0.4/src/LGtk/Effects.hs- liftEffectM $ ff $ repeat $ liftIO_ (takeMVar v >> r) >>= re | |
| lhc-0.10/lib/base/src/Data/Maybe.hs- (Just _) >> k = k | |
| lhc-0.10/lib/base/src/Data/Maybe.hs- Nothing >> _ = Nothing | |
| lhc-0.10/lib/base/src/Control/Monad/ST/Lazy.hs- m >> k = m >>= \ _ -> k | |
| lhc-0.10/lib/base/src/GHC/Conc.lhs- m >> k = thenSTM m k | |
| lhc-0.10/lib/base/src/GHC/PArr.hs- m >> k = foldrP ((+:+) . const k) [::] m | |
| lhc-0.10/lib/base/src/GHC/Base.lhs- m >> k = foldr ((++) . (\ _ -> k)) [] m | |
| lhc-0.10/lib/base/src/GHC/Base.lhs- m >> k = m >>= \ _ -> k | |
| lhc-0.10/lib/base/src/GHC/ST.lhs- m >> k = m >>= \ _ -> k | |
| Limit-1.0/src/Data/Limit.hs- Unbounded >> _ = Unbounded | |
| Limit-1.0/src/Data/Limit.hs- (Bounded _) >> k = k | |
| liquidhaskell-0.4.1.1/tests/neg/StateConstraints0.hs- (ST g) >> f = ST (\x -> case g x of {(y, s) -> (runState f) s}) | |
| liquidhaskell-0.4.1.1/tests/pos/StateConstraints0.hs- (ST g) >> f = ST (\x -> case g x of {(y, s) -> (runState f) s}) | |
| liquidhaskell-0.4.1.1/tests/pos/ToyMVar.hs- _ >> _ = undefined | |
| ListLike-4.2.0/src/Data/ListLike/Base.hs- m >> k = foldr (append . (\_ -> k)) empty m | |
| llvm-general-quote-0.2.0.0/src/LLVM/General/Quote/Parser/Monad.hs- m1 >> m2 = P $ \s -> | |
| logicst-0.1.0.0/src/Control/Monad/ST/Logic/Internal.hs- m >> n = LogicT $ unLogicT m >> unLogicT n | |
| machines-0.5.1/src/Data/Machine/Mealy.hs- _ >> n = n | |
| machines-0.5.1/src/Data/Machine/Moore.hs- _ >> m = m | |
| midi-0.2.1.5/parser/Sound/MIDI/Parser/Stream.hs- (\s ss -> lift (fromState (put ss)) >> return s) =<< | |
| monad-coroutine-0.9.0.1/Control/Monad/Coroutine.hs- t >> f = Coroutine (resume t >>= apply f) | |
| monadLib-3.7.3/src/MonadLib.hs- -- prop(?): local i (m1 >> m2) = local i m1 >> local i m2 | |
| monad-memo-0.4.1/Control/Monad/Trans/Memo/ReaderCache.hs- m >> k = ReaderCache $ \ !c -> do | |
| monad-memo-0.4.1/Control/Monad/Trans/Memo/StateCache.hs- m >> n = StateCache $ \ !c -> do | |
| monad-mersenne-random-0.1/Control/Monad/Mersenne/Random.hs- m >> k = Rand $ \s -> case runRand m s of | |
| monad-products-4.0.0.1/Control/Monad/Product.hs- Product (ga, ha) >> Product (gb, hb) = Product (ga >> gb, ha >> hb) | |
| monad-stlike-io-0.2.2/Control/Monad/STLike/Internal.hs- _ >> b = b | |
| monad-stlike-io-0.2.2/Control/Monad/STLike/Internal.hs- (STLike a) >> (STLike b) = STLike (a >> b) | |
| mtl-c-0.1/Control/Monad/Writer/CPS.hs- m >> n = WriterT $ \c -> unWriterT m $ \_ !w -> unWriterT n $ \b !w' -> c b $! mappend w w' | |
| mtl-c-0.1/Control/Monad/State/CPS.hs- m >> n = StateT $ \s c -> unStateT m s $ \_ s' -> unStateT n s' c | |
| mtl-c-0.1/Control/Monad/Reader/CPS.hs- m >> n = ReaderT $ \r c -> unReaderT m r (\_ -> unReaderT n r c) | |
| mtlx-0.1.6/Control/Monad/StateX/Strict.hs- ((StateX x)::(StateX ix s a)) >> f = mkStateX (getVal::ix) $ \s -> | |
| mtlx-0.1.6/Control/Monad/StateX/Strict.hs- ((StateTX x)::(StateTX ix s m a)) >> f = mkStateTX (getVal::ix) $ \s -> do | |
| mtlx-0.1.6/Control/Monad/WriterX/Strict.hs- m >> k = mkWriterX (getVal::ix) $ case runWriterX' m of | |
| mtlx-0.1.6/Control/Monad/WriterX/Strict.hs- m >> k = mkWriterTX (getVal::ix) $ do | |
| multipass-0.1.0.2/Data/Pass/Calc.hs- (>>) = (*>) | |
| myTestlll-1.0.0/HSoM/Monads.lhs-m1 >> (m2 >> m3) = (m1 >> m2) >> m3 | |
| orc-1.2.1.4/src/Orc/Monad.hs--- > eagerly (liftIO m) >> p == (liftIO m >> stop) <|> p | |
| perm-0.4.0.0/Control/Monad/Perm/Internal.hs- m >> n = liftM' snd $ zipM' m n | |
| posix-acl-0.2.0.0/System/Posix/ACL/C.hs--- 'fromText' "u::rw,g::r,o::r" $ 'dupACL' ('calcMask' >> 'toText' >>= 'Control.Monad.Trans.Class.lift' . 'print') >> 'toText' >>= 'Control.Monad.Trans.Class.lift' . 'print' | |
| possible-0.1.0.5/Data/Possible.hs- HaveNull >> _ = HaveNull | |
| possible-0.1.0.5/Data/Possible.hs- MissingData >> _ = MissingData | |
| possible-0.1.0.5/Data/Possible.hs- (HaveData _) >> k = k | |
| PrimitiveArray-0.6.0.0/Data/PrimitiveArray/FillTables.hs- unsafeWriteCell (cs:.(t,f)) sh = unsafeWriteCell cs sh >> (f sh >>= writeM t sh) | |
| PrimitiveArray-0.6.0.0/Data/PrimitiveArray/FillTables.hs- writeCell (cs:.(t,f)) sh = writeCell cs sh >> (when (inBoundsM t sh) (f sh >>= writeM t sh)) | |
| reflection-extras-0.1.1.0/src/Data/Reflection/Extras.hs- (>>) = | |
| representable-tries-3.0.2/src/Data/Functor/Representable/Trie.hs- _ >> m = m | |
| representable-tries-3.0.2/src/Data/Functor/Representable/Trie/Bool.hs- _ >> a = a | |
| representable-tries-3.0.2/src/Data/Functor/Representable/Trie/Either.hs- _ >> a = a | |
| representable-tries-3.0.2/src/Data/Functor/Representable/Trie/List.hs- _ >> a = a | |
| semigroups-0.16.2.2/src/Data/Semigroup.hs- _ >> a = a | |
| semigroups-0.16.2.2/src/Data/Semigroup.hs- _ >> a = a | |
| semigroups-0.16.2.2/src/Data/Semigroup.hs- _ >> a = a | |
| semigroups-0.16.2.2/src/Data/Semigroup.hs- _ >> a = a | |
| semigroups-0.16.2.2/src/Data/Semigroup.hs- Option Nothing >> _ = Option Nothing | |
| semigroups-0.16.2.2/src/Data/Semigroup.hs- _ >> b = b | |
| sessions-2008.7.18/Control/Concurrent/Session/Base/SMonad.hs- m >> n = SChain $ \x -> do { ~(_, y) <- runSChain m x | |
| shelly-1.6.2.5/src/Shelly/Pipe.hs- a >> b = Sh $ unSh a >> unSh b | |
| simple-pipe-0.0.0.28/src/Data/Pipe/Core.hs- (p >> return undefined) |||| (await >>= maybe (return undefined) return) | |
| statethread-0.1.1/src/Control/Monad/ST/Strict.hs- ST x >> ST y = ST (x >> y) | |
| statethread-0.1.1/src/Control/Monad/ST/Lazy.hs- ST x >> ST y = ST $ | |
| streams-3.2/src/Data/Stream/Infinite.hs- _ >> bs = bs | |
| synthesizer-0.2.0.1/src-4/Synthesizer/Inference/DesignStudy/Monad.hs- (P r0 f0) >> (P r1 f1) = | |
| tagged-0.8.0.1/src/Data/Tagged.hs- _ >> n = n | |
| tagged-exception-core-2.1.0.0/src/Control/Monad/TaggedException/Internal/Throws.hs- Throws ma >> Throws na = Throws (ma >> na) | |
| tagged-transformer-0.7.1/src/Data/Functor/Trans/Tagged.hs- TagT m >> TagT n = TagT (m >> n) | |
| template-haskell-2.10.0.0/Language/Haskell/TH/Syntax.hs- Q m >> Q n = Q (m >> n) | |
| thrist-0.3.0.2/Data/Thrist/List.hs- m >> k = foldr ((++) . (\ _ -> k)) [] m | |
| timberc-1.0.3/lib/Prelude.t-ma >> mb = ma >>= \_ -> mb | |
| trifecta-1.5.1.3/src/Text/Trifecta/Parser.hs- (>>) = (*>) | |
| tuples-homogenous-h98-0.1.1.0/Data/Tuple/Homogenous.hs- (>>) = (*>) | |
| tuples-homogenous-h98-0.1.1.0/Data/Tuple/Homogenous.hs- (>>) = (*>) | |
| tuples-homogenous-h98-0.1.1.0/Data/Tuple/Homogenous.hs- (>>) = (*>) | |
| tuples-homogenous-h98-0.1.1.0/Data/Tuple/Homogenous.hs- (>>) = (*>) | |
| tuples-homogenous-h98-0.1.1.0/Data/Tuple/Homogenous.hs- (>>) = (*>) | |
| tuples-homogenous-h98-0.1.1.0/Data/Tuple/Homogenous.hs- (>>) = (*>) | |
| tuples-homogenous-h98-0.1.1.0/Data/Tuple/Homogenous.hs- (>>) = (*>) | |
| tuples-homogenous-h98-0.1.1.0/Data/Tuple/Homogenous.hs- (>>) = (*>) | |
| tuples-homogenous-h98-0.1.1.0/Data/Tuple/Homogenous.hs- (>>) = (*>) | |
| tuples-homogenous-h98-0.1.1.0/Data/Tuple/Homogenous.hs- (>>) = (*>) | |
| tuples-homogenous-h98-0.1.1.0/Data/Tuple/Homogenous.hs- (>>) = (*>) | |
| UMM-0.3.1/UMMData.hs- (>>) a f = a >>= const f | |
| uni-events-2.2.2.0/Events/Events.hs- (>>) = thenEvent | |
| var-0.2.0.0/src/Control/Monad/Prim.hs- m >> n = Prim $ \ s -> case unPrim m s of | |
| vcache-0.2.6/hsrc_lib/Database/VCache/Types.hs- m >> k = VPut $ \ s -> | |
| vcache-0.2.6/hsrc_lib/Database/VCache/Types.hs- m >> k = VGet $ \ s -> | |
| visual-prof-0.5/Pretty.hs- (>>) = then_DocM | |
| zlib-0.6.1.1/Codec/Compression/Zlib/Stream.hsc- (>>) = thenZ_ |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment