>

(>) :: Ord a => a -> a -> Bool
base Prelude, base Data.Ord
keyword >
keyword
In a Bird's style Literate Haskell file, the > character is used to introduce a code line. > comment line > > > main = print "hello world"
(>=) :: Ord a => a -> a -> Bool
base Prelude, base Data.Ord
(>>) :: Monad m => m a -> m b -> m b
base Prelude, base Control.Monad, base Control.Monad.Instances
(>>=) :: Monad m => m a -> (a -> m b) -> m b
base Prelude, base Control.Monad, base Control.Monad.Instances
(>=>) :: Monad m => (a -> m b) -> (b -> m c) -> (a -> m c)
base Control.Monad
Left-to-right Kleisli composition of monads.
(>>>) :: Category cat => cat a b -> cat b c -> cat a c
base Control.Category, base Control.Arrow
Left-to-right composition
(>>^) :: Arrow a => a b c -> (c -> d) -> a b d
base Control.Arrow
Postcomposition with a pure function.
(>$<) :: Contravariant f => (b -> a) -> f a -> f b
bytestring Data.ByteString.Builder.Prim
A fmap-like operator for builder primitives, both bounded and fixed size. Builder primitives are contravariant so it's like the normal fmap, but backwards (look at the type). (If it helps to remember, the operator symbol is like ($) but backwards.) We can use it for example to prepend and/or append fixed values to an primitive. > showEncoding ((\x -> ('\'', (x, '\''))) >$< fixed3) 'x' = "'x'" > > fixed3 = char7 >*< char7 >*< char7 Note that the rather verbose syntax for composition stems from the requirement to be able to compute the size / size bound at compile time.
(>*<) :: Monoidal f => f a -> f b -> f (a, b)
bytestring Data.ByteString.Builder.Prim
A pairing/concatenation operator for builder primitives, both bounded and fixed size. For example, > toLazyByteString (primFixed (char7 >*< char7) ('x','y')) = "xy" We can combine multiple primitives using >*< multiple times. > toLazyByteString (primFixed (char7 >*< char7 >*< char7) ('x',('y','z'))) = "xyz"
(><) :: (Gen a -> Gen a) -> (Gen a -> Gen a) -> (Gen a -> Gen a)
QuickCheck Test.QuickCheck.Arbitrary, QuickCheck Test.QuickCheck
Combine two generator perturbing functions, for example the results of calls to variant or coarbitrary.
(><) :: (a -> b) -> (c -> d) -> (a, c) -> (b, d)
fgl Data.Graph.Inductive.Query.Monad
(><) :: Seq a -> Seq a -> Seq a
containers Data.Sequence
O(log(min(n1,n2))). Concatenate two sequences.
(>|) :: Done -> Done -> Done
parallel Control.Parallel.Strategies
DEPRECATED: Use pseq or $| instead
(>||) :: Done -> Done -> Done
parallel Control.Parallel.Strategies
DEPRECATED: Use par or $|| instead
(*>) :: Applicative f => f a -> f b -> f b
base Control.Applicative
(<$>) :: Functor f => (a -> b) -> f a -> f b
base Data.Functor, base Control.Applicative
An infix synonym for fmap.
(<**>) :: Applicative f => f a -> f (a -> b) -> f b
base Control.Applicative
A variant of <*> with the arguments reversed.
(<*>) :: Applicative f => f (a -> b) -> f a -> f b
base Control.Applicative
(<+>) :: ArrowPlus a => a b c -> a b c -> a b c
base Control.Arrow

Show more results