Pandora.Paradigm.Primary.Functor.Maybe

Documentation

data Maybe a

Constructors

Nothing

Just a

Instances

Interpreted Maybe

Defined in Pandora.Paradigm.Primary.Functor.Maybe

Associated Types

type Primary Maybe a :: Type

Methods

run :: Maybe a -> Primary Maybe a

(forall a. Chain a) => Insertable Binary

Defined in Pandora.Paradigm.Structure.Binary

Methods

insert :: a -> Binary a -> Binary a

Insertable Stack

Defined in Pandora.Paradigm.Structure.Stack

Methods

insert :: a -> Stack a -> Stack a

Covariant Maybe

Defined in Pandora.Paradigm.Primary.Functor.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

Bindable Maybe

Defined in Pandora.Paradigm.Primary.Functor.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

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

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

Applicative Maybe

Defined in Pandora.Paradigm.Primary.Functor.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

Alternative Maybe

Defined in Pandora.Paradigm.Primary.Functor.Maybe

Methods

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

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

Avoidable Maybe

Defined in Pandora.Paradigm.Primary.Functor.Maybe

Methods

empty :: Maybe a

Pointable Maybe

Defined in Pandora.Paradigm.Primary.Functor.Maybe

Methods

point :: a |-> Maybe

Monad Maybe

Defined in Pandora.Paradigm.Primary.Functor.Maybe

Traversable Maybe

Defined in Pandora.Paradigm.Primary.Functor.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

Set Stack

Defined in Pandora.Paradigm.Structure.Stack

Methods

member :: Setoid a => a -> Stack a -> Boolean

Monadic Maybe

Defined in Pandora.Paradigm.Primary.Functor.Maybe

Methods

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

Insertable (Construction Maybe)

Defined in Pandora.Paradigm.Structure.Stack

Methods

insert :: a -> Construction Maybe a -> Construction Maybe a

Semigroup a => Semigroup (Maybe a)

Defined in Pandora.Paradigm.Primary.Functor.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.Primary.Functor.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.Primary.Functor.Maybe

Methods

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

Infimum a => Infimum (Maybe a)

Defined in Pandora.Paradigm.Primary.Functor.Maybe

Methods

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

Lattice a => Lattice (Maybe a)

Defined in Pandora.Paradigm.Primary.Functor.Maybe

Setoid a => Setoid (Maybe a)

Defined in Pandora.Paradigm.Primary.Functor.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.Primary.Functor.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 Substructural Left Binary a :: Type

Methods

substructure :: Tagged Left (Binary a) :-. Substructural Left Binary a

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

Defined in Pandora.Paradigm.Structure.Binary

Associated Types

type Substructural Right Binary a :: Type

Methods

substructure :: Tagged Right (Binary a) :-. Substructural Right Binary a

Substructure (Just :: Type -> Maybe Type) Rose

Defined in Pandora.Paradigm.Structure.Rose

Associated Types

type Substructural Just Rose a :: Type

Methods

substructure :: Tagged Just (Rose a) :-. Substructural Just Rose a

(forall a. Chain a) => Focusable (Root :: Type -> Location Type) Binary

Defined in Pandora.Paradigm.Structure.Binary

Associated Types

type Focusing Root Binary a :: Type

Methods

focusing :: Tagged Root (Binary a) :-. Focusing Root Binary a

Focusable (Root :: Type -> Location Type) Rose

Defined in Pandora.Paradigm.Structure.Rose

Associated Types

type Focusing Root Rose a :: Type

Methods

focusing :: Tagged Root (Rose a) :-. Focusing Root Rose a

Focusable (Head :: Type -> Location Type) Stack

Defined in Pandora.Paradigm.Structure.Stack

Associated Types

type Focusing Head Stack a :: Type

Methods

focusing :: Tagged Head (Stack a) :-. Focusing Head Stack a

Substructure (Just :: Type -> Maybe Type) (Construction Stack)

Defined in Pandora.Paradigm.Structure.Rose

Associated Types

type Substructural Just (Construction Stack) a :: Type

Methods

substructure :: Tagged Just (Construction Stack a) :-. Substructural Just (Construction Stack) a

Focusable (Root :: Type -> Location Type) (Construction Stack)

Defined in Pandora.Paradigm.Structure.Rose

Associated Types

type Focusing Root (Construction Stack) a :: Type

Methods

focusing :: Tagged Root (Construction Stack a) :-. Focusing Root (Construction Stack) a

Focusable (Head :: Type -> Location Type) (Construction Maybe)

Defined in Pandora.Paradigm.Structure.Stack

Associated Types

type Focusing Head (Construction Maybe) a :: Type

Methods

focusing :: Tagged Head (Construction Maybe a) :-. Focusing Head (Construction Maybe) a

Covariant (Delta <:.> Stack)

Defined in Pandora.Paradigm.Structure.Stack

Methods

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

comap :: (a -> b) -> (Delta <:.> Stack) a -> (Delta <:.> Stack) b

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

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

void :: (Delta <:.> Stack) a -> (Delta <:.> Stack) ()

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

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

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

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

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

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

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

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

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

Defined in Pandora.Paradigm.Primary.Functor.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.Primary.Functor.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

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

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

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

Defined in Pandora.Paradigm.Primary.Functor.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.Primary.Functor.Maybe

Methods

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

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

Defined in Pandora.Paradigm.Primary.Functor.Maybe

type Nonempty Binary

Defined in Pandora.Paradigm.Structure.Binary

type Nonempty Binary = Construction Wye

type Nonempty Stack

Defined in Pandora.Paradigm.Structure.Stack

type Nonempty Stack = Construction Maybe

type Nonempty Rose

Defined in Pandora.Paradigm.Structure.Rose

type Nonempty Rose = Construction Stack

type Zipper Stack

Defined in Pandora.Paradigm.Structure.Stack

type Zipper Stack = Tap (Delta <:.> Stack)

type Primary Maybe a

Defined in Pandora.Paradigm.Primary.Functor.Maybe

type Primary Maybe a = Maybe a

type Schematic Monad Maybe

Defined in Pandora.Paradigm.Primary.Functor.Maybe

type Schematic Monad Maybe = UT Covariant Covariant Maybe

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

Defined in Pandora.Paradigm.Structure.Binary

type Substructural (Left :: Type -> Wye Type) Binary a = Binary a

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

Defined in Pandora.Paradigm.Structure.Binary

type Substructural (Right :: Type -> Wye Type) Binary a = Binary a

type Substructural (Just :: Type -> Maybe Type) Rose a

Defined in Pandora.Paradigm.Structure.Rose

type Substructural (Just :: Type -> Maybe Type) Rose a = (Stack :. Construction Stack) := a

type Focusing (Root :: Type -> Location Type) Binary a

Defined in Pandora.Paradigm.Structure.Binary

type Focusing (Root :: Type -> Location Type) Binary a = Maybe a

type Focusing (Root :: Type -> Location Type) Rose a

Defined in Pandora.Paradigm.Structure.Rose

type Focusing (Root :: Type -> Location Type) Rose a = Maybe a

type Focusing (Head :: Type -> Location Type) Stack a

Defined in Pandora.Paradigm.Structure.Stack

type Focusing (Head :: Type -> Location Type) Stack a = Maybe a

type Substructural (Just :: Type -> Maybe Type) (Construction Stack) a

Defined in Pandora.Paradigm.Structure.Rose

type Substructural (Just :: Type -> Maybe Type) (Construction Stack) a = (Stack :. Construction Stack) := a

type Focusing (Root :: Type -> Location Type) (Construction Stack) a

Defined in Pandora.Paradigm.Structure.Rose

type Focusing (Root :: Type -> Location Type) (Construction Stack) a = a

type Focusing (Head :: Type -> Location Type) (Construction Maybe) a

Defined in Pandora.Paradigm.Structure.Stack

type Focusing (Head :: Type -> Location Type) (Construction Maybe) a = a

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

type Optional = Adaptable Maybe

nothing :: Optional t => t a