pandora-0.2.6: A box of patterns and paradigms

Safe HaskellSafe
LanguageHaskell2010

Pandora.Paradigm.Structure.Binary

Contents

Documentation

insert :: Chain a => a -> Binary a -> Binary a Source #

Orphan instances

Covariant Binary Source # 
Instance details

Methods

(<$>) :: (a -> b) -> Binary a -> Binary b Source #

comap :: (a -> b) -> Binary a -> Binary b Source #

(<$) :: a -> Binary b -> Binary a Source #

($>) :: Binary a -> b -> Binary b Source #

void :: Binary a -> Binary () Source #

loeb :: Binary (a <-| Binary) -> Binary a Source #

(<&>) :: Binary a -> (a -> b) -> Binary b Source #

(<$$>) :: Covariant u => (a -> b) -> ((Binary :. u) := a) -> (Binary :. u) := b Source #

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Binary :. (u :. v)) := a) -> (Binary :. (u :. v)) := b Source #

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Binary :. (u :. (v :. w))) := a) -> (Binary :. (u :. (v :. w))) := b Source #

(<&&>) :: Covariant u => ((Binary :. u) := a) -> (a -> b) -> (Binary :. u) := b Source #

(<&&&>) :: (Covariant u, Covariant v) => ((Binary :. (u :. v)) := a) -> (a -> b) -> (Binary :. (u :. v)) := b Source #

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Binary :. (u :. (v :. w))) := a) -> (a -> b) -> (Binary :. (u :. (v :. w))) := b Source #

Pointable Binary Source # 
Instance details

Methods

point :: a |-> Binary Source #

Traversable Binary Source # 
Instance details

Methods

(->>) :: (Pointable u, Applicative u) => Binary a -> (a -> u b) -> (u :. Binary) := b Source #

traverse :: (Pointable u, Applicative u) => (a -> u b) -> Binary a -> (u :. Binary) := b Source #

sequence :: (Pointable u, Applicative u) => ((Binary :. u) := a) -> (u :. Binary) := a Source #

(->>>) :: (Pointable u, Applicative u, Traversable v) => ((v :. Binary) := a) -> (a -> u b) -> (u :. (v :. Binary)) := b Source #

(->>>>) :: (Pointable u, Applicative u, Traversable v, Traversable w) => ((w :. (v :. Binary)) := a) -> (a -> u b) -> (u :. (w :. (v :. Binary))) := b Source #

(->>>>>) :: (Pointable u, Applicative u, Traversable v, Traversable w, Traversable j) => ((j :. (w :. (v :. Binary))) := a) -> (a -> u b) -> (u :. (j :. (w :. (v :. Binary)))) := b Source #

Substructure (Left :: Type -> Wye Type) Binary Source # 
Instance details

Associated Types

type Output Left Binary a = (r :: Type) Source #

Substructure (Right :: Type -> Wye Type) Binary Source # 
Instance details

Associated Types

type Output Right Binary a = (r :: Type) Source #

Substructure (Left :: Type -> Wye Type) (Twister Wye) Source # 
Instance details

Associated Types

type Output Left (Twister Wye) a = (r :: Type) Source #

Substructure (Right :: Type -> Wye Type) (Twister Wye) Source # 
Instance details

Associated Types

type Output Right (Twister Wye) a = (r :: Type) Source #