|< -package:ordered-containers

(|<) :: MonoidalAlt f => f a -> f a -> f a
invertible Control.Invertible.Monoidal
Assymetric (and therefore probably not bijective) version of >|< that returns whichever action succeeds but always uses the right one on inputs.
(|<) :: Unionable a => Pattern a -> Pattern a -> Pattern a
tidal Sound.Tidal.Boot, tidal-core Sound.Tidal.Core
(|<|) :: Space s => s -> s -> Bool
numhask-space NumHask.Space
is one space completely below the other
(|<|) :: (Space s, Ord (Element s)) => s -> s -> Bool
numhask-space NumHask.Space
is one space completely below the other
(|<=|) :: (d1 @~ d2, Ord n) => Qu d1 l n -> Qu d2 l n -> Bool
units Data.Metrology Data.Metrology.Poly Data.Metrology.Vector
Check if one quantity is less than or equal to a compatible one
(|<|) :: (d1 @~ d2, Ord n) => Qu d1 l n -> Qu d2 l n -> Bool
units Data.Metrology Data.Metrology.Poly Data.Metrology.Vector
Check if one quantity is less than a compatible one
(|<|) :: (Applicative a, Unionable b) => a b -> a b -> a b
tidal Sound.Tidal.Boot, tidal-core Sound.Tidal.Core
(<|<) :: forall (m3 :: Type -> Type) t m2 m1 c . (Monad m3, MMonad t) => (forall b . () => m2 b -> t m3 b) -> (forall a . () => m1 a -> t m2 a) -> m1 c -> t m3 c
mmorph Control.Monad.Morph
Equivalent to (>|>) with the arguments flipped (<|<) is analogous to (<=<)
(>|<) :: UnionEncoder a -> UnionEncoder b -> UnionEncoder (Either a b)
dhall Dhall.Marshal.Encode
Combines two UnionEncoder values. See UnionEncoder for usage notes. Ideally, this matches chosen; however, this allows UnionEncoder to not need a Divisible instance itself (since no instance is possible).
(>|<) :: LogAction m a -> LogAction m b -> LogAction m (Either a b)
co-log-core Colog.Core.Action
Operator version of choose id. 
>>> dontPrintInt = LogAction (const (putStrLn "Not printing Int"))

>>> Left 1 &> (dontPrintInt >|< logStringStdout)
Not printing Int

>>> (dontPrintInt >|< logStringStdout) <& Right ":)"
:)
(>|<) :: MonoidalAlt f => f a -> f b -> f (Either a b)
invertible Control.Invertible.Monoidal
Associative binary choice.
(||<) :: Unionable a => Pattern a -> Pattern a -> Pattern a
tidal Sound.Tidal.Boot, tidal-core Sound.Tidal.Core
($$|<) :: Expr -> Expr -> Maybe Expr
code-conjure Conjure.Expr
Like $$ but relaxed to work on correct kinds. 
> ordE $$|< zero
Just (ord 0 :: ill-typed # Char -> Int $ Int #)

> zero $$|< zero
Nothing
Warning: just like :$, this may produce ill-typed expressions. Together with $$**, this function is unused but is useful when experiment with the source to see the effect of type-corrected on pruning the search space. (cf. $$, $$**)