module Stdlib.Data.Maybe;
import Stdlib.Data.Maybe.Base open public;
import Stdlib.Trait.Eq open;
import Stdlib.Trait.Ord open;
import Stdlib.Trait.Show open;
import Stdlib.Trait.Functor open;
import Stdlib.Trait.Applicative open;
import Stdlib.Trait.Monad open;
import Stdlib.Data.Bool.Base open;
import Stdlib.Data.String.Base open;
import Stdlib.Data.Pair.Base open;
instance
eqMaybeI {A} {{Eq A}} : Eq (Maybe A) :=
mkEq@{
eq (m1 m2 : Maybe A) : Bool :=
case m1, m2 of
| nothing, nothing := true
| just a1, just a2 := Eq.eq a1 a2
| _ := false;
};
instance
showMaybeI {A} {{Show A}} : Show (Maybe A) :=
mkShow@{
show (m : Maybe A) : String :=
case m of
| nothing := "nothing"
| just a := "just " ++str Show.show a;
};
instance
ordMaybeI {A} {{Ord A}} : Ord (Maybe A) :=
mkOrd@{
cmp (m1 m2 : Maybe A) : Ordering :=
case m1, m2 of
| nothing, nothing := Equal
| just a1, just a2 := Ord.cmp a1 a2
| nothing, just _ := LessThan
| just _, nothing := GreaterThan;
};
instance
functorMaybeI : Functor Maybe :=
mkFunctor@{
map {A B} (f : A -> B) : Maybe A -> Maybe B
| nothing := nothing
| (just a) := just (f a);
};
instance
monomorphicFunctorMaybeI {A} : Monomorphic.Functor (Maybe A) A :=
fromPolymorphicFunctor;
instance
applicativeMaybeI : Applicative Maybe :=
mkApplicative@{
pure := just;
ap {A B} (listOfFuns : Maybe (A -> B)) (list : Maybe A) : Maybe B :=
case listOfFuns, list of
| just f, just x := just (f x)
| _, _ := nothing;
};
instance
monadMaybeI : Monad Maybe :=
mkMonad@{
bind {A B} (maybe : Maybe A) (fun : A -> Maybe B) : Maybe B :=
case maybe of
| nothing := nothing
| just a := fun a;
};