Pandora.Paradigm.Basis.Maybe

Documentation

data Maybe a

Constructors

Nothing

Just a

Instances

Interpreted Maybe

Defined in Pandora.Paradigm.Basis.Maybe

Associated Types

type Primary Maybe a :: Type

Methods

run :: Maybe a -> Primary Maybe a

Covariant Maybe

Defined in Pandora.Paradigm.Basis.Maybe

Methods

(<$>) :: (a -> b) -> Maybe a -> Maybe b

comap :: (a -> b) -> Maybe a -> Maybe b

(<$) :: a -> Maybe b -> Maybe a

($>) :: Maybe a -> b -> Maybe b

void :: Maybe a -> Maybe ()

loeb :: Maybe (a <-| Maybe) -> Maybe a

(<&>) :: Maybe a -> (a -> b) -> Maybe b

(<$$>) :: Covariant u => (a -> b) -> ((Maybe :. u) := a) -> (Maybe :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Maybe :. (u :. v)) := a) -> (Maybe :. (u :. v)) := b

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

(<&&>) :: Covariant u => ((Maybe :. u) := a) -> (a -> b) -> (Maybe :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Maybe :. (u :. v)) := a) -> (a -> b) -> (Maybe :. (u :. v)) := b

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

Covariant Stack

Defined in Pandora.Paradigm.Structure.Stack

Methods

(<$>) :: (a -> b) -> Stack a -> Stack b

comap :: (a -> b) -> Stack a -> Stack b

(<$) :: a -> Stack b -> Stack a

($>) :: Stack a -> b -> Stack b

void :: Stack a -> Stack ()

loeb :: Stack (a <-| Stack) -> Stack a

(<&>) :: Stack a -> (a -> b) -> Stack b

(<$$>) :: Covariant u => (a -> b) -> ((Stack :. u) := a) -> (Stack :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Stack :. (u :. v)) := a) -> (Stack :. (u :. v)) := b

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

(<&&>) :: Covariant u => ((Stack :. u) := a) -> (a -> b) -> (Stack :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Stack :. (u :. v)) := a) -> (a -> b) -> (Stack :. (u :. v)) := b

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

Covariant Binary

Defined in Pandora.Paradigm.Structure.Binary

Methods

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

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

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

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

void :: Binary a -> Binary ()

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

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

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

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

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

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

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

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

Bindable Maybe

Defined in Pandora.Paradigm.Basis.Maybe

Methods

(>>=) :: Maybe a -> (a -> Maybe b) -> Maybe b

(=<<) :: (a -> Maybe b) -> Maybe a -> Maybe b

bind :: (a -> Maybe b) -> Maybe a -> Maybe b

join :: ((Maybe :. Maybe) := a) -> Maybe a

(>=>) :: (a -> Maybe b) -> (b -> Maybe c) -> a -> Maybe c

(<=<) :: (b -> Maybe c) -> (a -> Maybe b) -> a -> Maybe c

Applicative Maybe

Defined in Pandora.Paradigm.Basis.Maybe

Methods

(<*>) :: Maybe (a -> b) -> Maybe a -> Maybe b

apply :: Maybe (a -> b) -> Maybe a -> Maybe b

(*>) :: Maybe a -> Maybe b -> Maybe b

(<*) :: Maybe a -> Maybe b -> Maybe a

forever :: Maybe a -> Maybe b

(<**>) :: Applicative u => ((Maybe :. u) := (a -> b)) -> ((Maybe :. u) := a) -> (Maybe :. u) := b

(<***>) :: (Applicative u, Applicative v) => ((Maybe :. (u :. v)) := (a -> b)) -> ((Maybe :. (u :. v)) := a) -> (Maybe :. (u :. v)) := b

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((Maybe :. (u :. (v :. w))) := (a -> b)) -> ((Maybe :. (u :. (v :. w))) := a) -> (Maybe :. (u :. (v :. w))) := b

Applicative Stack

Defined in Pandora.Paradigm.Structure.Stack

Methods

(<*>) :: Stack (a -> b) -> Stack a -> Stack b

apply :: Stack (a -> b) -> Stack a -> Stack b

(*>) :: Stack a -> Stack b -> Stack b

(<*) :: Stack a -> Stack b -> Stack a

forever :: Stack a -> Stack b

(<**>) :: Applicative u => ((Stack :. u) := (a -> b)) -> ((Stack :. u) := a) -> (Stack :. u) := b

(<***>) :: (Applicative u, Applicative v) => ((Stack :. (u :. v)) := (a -> b)) -> ((Stack :. (u :. v)) := a) -> (Stack :. (u :. v)) := b

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((Stack :. (u :. (v :. w))) := (a -> b)) -> ((Stack :. (u :. (v :. w))) := a) -> (Stack :. (u :. (v :. w))) := b

Alternative Maybe

Defined in Pandora.Paradigm.Basis.Maybe

Methods

(<+>) :: Maybe a -> Maybe a -> Maybe a

alter :: Maybe a -> Maybe a -> Maybe a

Alternative Stack

Defined in Pandora.Paradigm.Structure.Stack

Methods

(<+>) :: Stack a -> Stack a -> Stack a

alter :: Stack a -> Stack a -> Stack a

Avoidable Maybe

Defined in Pandora.Paradigm.Basis.Maybe

Methods

empty :: Maybe a

Avoidable Stack

Defined in Pandora.Paradigm.Structure.Stack

Methods

empty :: Stack a

Pointable Maybe

Defined in Pandora.Paradigm.Basis.Maybe

Methods

point :: a |-> Maybe

Pointable Stack

Defined in Pandora.Paradigm.Structure.Stack

Methods

point :: a |-> Stack

Pointable Binary

Defined in Pandora.Paradigm.Structure.Binary

Methods

point :: a |-> Binary

Monad Maybe

Defined in Pandora.Paradigm.Basis.Maybe

Traversable Maybe

Defined in Pandora.Paradigm.Basis.Maybe

Methods

(->>) :: (Pointable u, Applicative u) => Maybe a -> (a -> u b) -> (u :. Maybe) := b

traverse :: (Pointable u, Applicative u) => (a -> u b) -> Maybe a -> (u :. Maybe) := b

sequence :: (Pointable u, Applicative u) => ((Maybe :. u) := a) -> (u :. Maybe) := a

(->>>) :: (Pointable u, Applicative u, Traversable v) => ((v :. Maybe) := a) -> (a -> u b) -> (u :. (v :. Maybe)) := b

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

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

Traversable Stack

Defined in Pandora.Paradigm.Structure.Stack

Methods

(->>) :: (Pointable u, Applicative u) => Stack a -> (a -> u b) -> (u :. Stack) := b

traverse :: (Pointable u, Applicative u) => (a -> u b) -> Stack a -> (u :. Stack) := b

sequence :: (Pointable u, Applicative u) => ((Stack :. u) := a) -> (u :. Stack) := a

(->>>) :: (Pointable u, Applicative u, Traversable v) => ((v :. Stack) := a) -> (a -> u b) -> (u :. (v :. Stack)) := b

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

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

Traversable Binary

Defined in Pandora.Paradigm.Structure.Binary

Methods

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

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

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

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

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

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

Monadic Maybe

Defined in Pandora.Paradigm.Basis.Maybe

Methods

lay :: Covariant u => u ~> (Maybe :> u)

wrap :: Pointable u => Maybe ~> (Maybe :> u)

Semigroup a => Semigroup (Maybe a)

Defined in Pandora.Paradigm.Basis.Maybe

Methods

(+) :: Maybe a -> Maybe a -> Maybe a

Semigroup (Stack a)

Defined in Pandora.Paradigm.Structure.Stack

Methods

(+) :: Stack a -> Stack a -> Stack a

Semigroup a => Monoid (Maybe a)

Defined in Pandora.Paradigm.Basis.Maybe

Methods

zero :: Maybe a

Monoid (Stack a)

Defined in Pandora.Paradigm.Structure.Stack

Methods

zero :: Stack a

Supremum a => Supremum (Maybe a)

Defined in Pandora.Paradigm.Basis.Maybe

Methods

(\/) :: Maybe a -> Maybe a -> Maybe a

Infimum a => Infimum (Maybe a)

Defined in Pandora.Paradigm.Basis.Maybe

Methods

(/\) :: Maybe a -> Maybe a -> Maybe a

Lattice a => Lattice (Maybe a)

Defined in Pandora.Paradigm.Basis.Maybe

Setoid a => Setoid (Maybe a)

Defined in Pandora.Paradigm.Basis.Maybe

Methods

(==) :: Maybe a -> Maybe a -> Boolean

(/=) :: Maybe a -> Maybe a -> Boolean

Setoid a => Setoid (Stack a)

Defined in Pandora.Paradigm.Structure.Stack

Methods

(==) :: Stack a -> Stack a -> Boolean

(/=) :: Stack a -> Stack a -> Boolean

Chain a => Chain (Maybe a)

Defined in Pandora.Paradigm.Basis.Maybe

Methods

(<=>) :: Maybe a -> Maybe a -> Ordering

(<) :: Maybe a -> Maybe a -> Boolean

(<=) :: Maybe a -> Maybe a -> Boolean

(>) :: Maybe a -> Maybe a -> Boolean

(>=) :: Maybe a -> Maybe a -> Boolean

Substructure (Left :: Type -> Wye Type) Binary

Defined in Pandora.Paradigm.Structure.Binary

Associated Types

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

Methods

sub :: Binary a :-. Output Left Binary a

Substructure (Right :: Type -> Wye Type) Binary

Defined in Pandora.Paradigm.Structure.Binary

Associated Types

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

Methods

sub :: Binary a :-. Output Right Binary a

Covariant u => Covariant (UT Covariant Covariant Maybe u)

Defined in Pandora.Paradigm.Basis.Maybe

Methods

(<$>) :: (a -> b) -> UT Covariant Covariant Maybe u a -> UT Covariant Covariant Maybe u b

comap :: (a -> b) -> UT Covariant Covariant Maybe u a -> UT Covariant Covariant Maybe u b

(<$) :: a -> UT Covariant Covariant Maybe u b -> UT Covariant Covariant Maybe u a

($>) :: UT Covariant Covariant Maybe u a -> b -> UT Covariant Covariant Maybe u b

void :: UT Covariant Covariant Maybe u a -> UT Covariant Covariant Maybe u ()

loeb :: UT Covariant Covariant Maybe u (a <-| UT Covariant Covariant Maybe u) -> UT Covariant Covariant Maybe u a

(<&>) :: UT Covariant Covariant Maybe u a -> (a -> b) -> UT Covariant Covariant Maybe u b

(<$$>) :: Covariant u0 => (a -> b) -> ((UT Covariant Covariant Maybe u :. u0) := a) -> (UT Covariant Covariant Maybe u :. u0) := b

(<$$$>) :: (Covariant u0, Covariant v) => (a -> b) -> ((UT Covariant Covariant Maybe u :. (u0 :. v)) := a) -> (UT Covariant Covariant Maybe u :. (u0 :. v)) := b

(<$$$$>) :: (Covariant u0, Covariant v, Covariant w) => (a -> b) -> ((UT Covariant Covariant Maybe u :. (u0 :. (v :. w))) := a) -> (UT Covariant Covariant Maybe u :. (u0 :. (v :. w))) := b

(<&&>) :: Covariant u0 => ((UT Covariant Covariant Maybe u :. u0) := a) -> (a -> b) -> (UT Covariant Covariant Maybe u :. u0) := b

(<&&&>) :: (Covariant u0, Covariant v) => ((UT Covariant Covariant Maybe u :. (u0 :. v)) := a) -> (a -> b) -> (UT Covariant Covariant Maybe u :. (u0 :. v)) := b

(<&&&&>) :: (Covariant u0, Covariant v, Covariant w) => ((UT Covariant Covariant Maybe u :. (u0 :. (v :. w))) := a) -> (a -> b) -> (UT Covariant Covariant Maybe u :. (u0 :. (v :. w))) := b

(Pointable u, Bindable u) => Bindable (UT Covariant Covariant Maybe u)

Defined in Pandora.Paradigm.Basis.Maybe

Methods

(>>=) :: UT Covariant Covariant Maybe u a -> (a -> UT Covariant Covariant Maybe u b) -> UT Covariant Covariant Maybe u b

(=<<) :: (a -> UT Covariant Covariant Maybe u b) -> UT Covariant Covariant Maybe u a -> UT Covariant Covariant Maybe u b

bind :: (a -> UT Covariant Covariant Maybe u b) -> UT Covariant Covariant Maybe u a -> UT Covariant Covariant Maybe u b

join :: ((UT Covariant Covariant Maybe u :. UT Covariant Covariant Maybe u) := a) -> UT Covariant Covariant Maybe u a

(>=>) :: (a -> UT Covariant Covariant Maybe u b) -> (b -> UT Covariant Covariant Maybe u c) -> a -> UT Covariant Covariant Maybe u c

(<=<) :: (b -> UT Covariant Covariant Maybe u c) -> (a -> UT Covariant Covariant Maybe u b) -> a -> UT Covariant Covariant Maybe u c

Applicative u => Applicative (UT Covariant Covariant Maybe u)

Defined in Pandora.Paradigm.Basis.Maybe

Methods

(<*>) :: UT Covariant Covariant Maybe u (a -> b) -> UT Covariant Covariant Maybe u a -> UT Covariant Covariant Maybe u b

apply :: UT Covariant Covariant Maybe u (a -> b) -> UT Covariant Covariant Maybe u a -> UT Covariant Covariant Maybe u b

(*>) :: UT Covariant Covariant Maybe u a -> UT Covariant Covariant Maybe u b -> UT Covariant Covariant Maybe u b

(<*) :: UT Covariant Covariant Maybe u a -> UT Covariant Covariant Maybe u b -> UT Covariant Covariant Maybe u a

forever :: UT Covariant Covariant Maybe u a -> UT Covariant Covariant Maybe u b

(<**>) :: Applicative u0 => ((UT Covariant Covariant Maybe u :. u0) := (a -> b)) -> ((UT Covariant Covariant Maybe u :. u0) := a) -> (UT Covariant Covariant Maybe u :. u0) := b

(<***>) :: (Applicative u0, Applicative v) => ((UT Covariant Covariant Maybe u :. (u0 :. v)) := (a -> b)) -> ((UT Covariant Covariant Maybe u :. (u0 :. v)) := a) -> (UT Covariant Covariant Maybe u :. (u0 :. v)) := b

(<****>) :: (Applicative u0, Applicative v, Applicative w) => ((UT Covariant Covariant Maybe u :. (u0 :. (v :. w))) := (a -> b)) -> ((UT Covariant Covariant Maybe u :. (u0 :. (v :. w))) := a) -> (UT Covariant Covariant Maybe u :. (u0 :. (v :. w))) := b

Pointable u => Pointable (UT Covariant Covariant Maybe u)

Defined in Pandora.Paradigm.Basis.Maybe

Methods

point :: a |-> UT Covariant Covariant Maybe u

Monad u => Monad (UT Covariant Covariant Maybe u)

Defined in Pandora.Paradigm.Basis.Maybe

type Nonempty Stack

Defined in Pandora.Paradigm.Structure.Stack

type Nonempty Stack = Twister Maybe

type Nonempty Binary

Defined in Pandora.Paradigm.Structure.Binary

type Nonempty Binary = Twister Wye

type Primary Maybe a

Defined in Pandora.Paradigm.Basis.Maybe

type Primary Maybe a = Maybe a

type Schematic Monad Maybe u

Defined in Pandora.Paradigm.Basis.Maybe

type Schematic Monad Maybe u = UT Covariant Covariant Maybe u

type Output (Left :: Type -> Wye Type) Binary a

Defined in Pandora.Paradigm.Structure.Binary

type Output (Left :: Type -> Wye Type) Binary a = (Left :: (Any :: Type) -> Wye (Any :: Type)) :# Binary a

type Output (Right :: Type -> Wye Type) Binary a

Defined in Pandora.Paradigm.Structure.Binary

type Output (Right :: Type -> Wye Type) Binary a = (Right :: (Any :: Type) -> Wye (Any :: Type)) :# Binary a

type Optional = Adaptable Maybe

maybe :: b -> (a -> b) -> Maybe a -> b

nothing :: Optional t => t a