Struct naan::impls::option::hkt::Option

pub struct Option(_);

core::option::Option lifted to an HKT1

(Kind Type -> Type)

Trait Implementations

impl<A> Alt<Option, A> for Option<A>

fn alt(self, b: Self) -> Self

See Alt

impl<A> Applicative<Option, A> for Option<A>

fn pure(a: A) -> Option<A>

Lift A to F<A>

impl<AB> Apply<Option, AB> for Option<AB>

fn apply_with<A, B, Cloner>( self, a: <Option as HKT1>::T<A>, _: Cloner ) -> <Option as HKT1>::T<B>where AB: F1<A, Ret = B>, Cloner: for<'a> F1<&'a A, Ret = A>,

Apply the function A -> B contained in Self (F<A -> B>) to an instance of F<A> to get F<B>.

fn apply<A, B>(self, a: F::T<A>) -> F::T<B>where Self: Sized, AB: F1<A, Ret = B>, A: Clone,

See [Apply.apply_with]

impl<AB> ApplyOnce<Option, AB> for Option<AB>

fn apply1<A, B>(self, a: Option<A>) -> Option<B>where AB: F1Once<A, Ret = B>,

See ApplyOnce

impl<A> Foldable<Option, A> for Option<A>

fn foldl<B, BAB>(self, f: BAB, b: B) -> Bwhere BAB: F2<B, A, Ret = B>,

Fold the data structure from left -> right

fn foldr<B, ABB>(self, f: ABB, b: B) -> Bwhere ABB: F2<A, B, Ret = B>,

Fold the data structure from right -> left

fn foldl_ref<'a, B, BAB>(&'a self, f: BAB, b: B) -> Bwhere BAB: F2<B, &'a A, Ret = B>, A: 'a,

Fold the data structure from left -> right

fn foldr_ref<'a, B, ABB>(&'a self, f: ABB, b: B) -> Bwhere ABB: F2<&'a A, B, Ret = B>, A: 'a,

Fold the data structure from right -> left

fn fold_map<AB, B>(self, f: AB) -> Bwhere Self: Sized, AB: F1<A, Ret = B>, B: Monoid,

Fold the data structure, accumulating the values into a Monoid.

fn contains<'a>(&'a self, a: &'a A) -> boolwhere &'a A: PartialEq, A: 'a,

Test if the structure contains a value a

fn not_contains<'a>(&'a self, a: &'a A) -> boolwhere &'a A: PartialEq, A: 'a,

Test if the structure does not contain a value a

fn any<'a, P>(&'a self, f: P) -> boolwhere P: F1<&'a A, Ret = bool>, A: 'a,

Test if any element in the structure satisfies a predicate f

fn all<'a, P>(&'a self, f: P) -> boolwhere P: F1<&'a A, Ret = bool>, A: 'a,

Test if every element in the structure satisfies a predicate f

fn length(&self) -> usize

Get the number of elements contained within the structure

fn is_empty(&self) -> bool

Test if the structure is empty

fn find_map<AB, B>(self, f: AB) -> Option<B>where Self: Sized, AB: F1<A, Ret = Option<B>>,

Fold values until a match is found

fn find<P>(self, f: P) -> Option<A>where Self: Sized, P: for<'a> F1<&'a A, Ret = bool>,

Fold values until a match is found

impl<A> FoldableOnce<Option, A> for Option<A>

fn fold1<B, BAB>(self, f: BAB, b: B) -> Bwhere BAB: F2Once<B, A, Ret = B>,

Fold the data structure

fn fold1_ref<'a, B, BAB>(&'a self, f: BAB, b: B) -> Bwhere BAB: F2Once<B, &'a A, Ret = B>, A: 'a,

Fold the data structure

fn get_or(self, a: A) -> Awhere Self: Sized,

Unwrap the data structure, using a provided default value if empty

impl<A> Functor<Option, A> for Option<A>

fn fmap<AB, B>(self, f: AB) -> <Option as HKT1>::T<B>where AB: F1<A, Ret = B>,

Use a function from A -> B to transform an F<A> to an F<B>.

impl<A> FunctorOnce<Option, A> for Option<A>

fn fmap1<AB, B>(self, f: AB) -> Option<B>where AB: F1Once<A, Ret = B>,

See FunctorOnce

impl HKT1 for Option

type T<A> = Option<A>

The generic type

impl<A> Monad<Option, A> for Option<A>

fn bind<B, AMB>(self, f: AMB) -> <Option as HKT1>::T<B>where AMB: F1<A, Ret = <Option as HKT1>::T<B>>,

See Monad

fn flatten<AA>(self) -> M::T<AA>where Self: Sized, M: HKT1<T<AA> = A> + HKT1<T<<M as HKT1>::T<AA>> = Self>,

Flatten a nested Monad

impl<A> MonadOnce<Option, A> for Option<A>

fn bind1<B, AMB>(self, f: AMB) -> Option<B>where AMB: F1Once<A, Ret = Option<B>>,

See MonadOnce

fn discard<AMB, B>(self, f: AMB) -> M::T<A>where Self: Sized, B: Discard, AMB: for<'a> F1Once<&'a A, Ret = M::T<B>>, M::T<B>: MonadOnce<M, B>,

MonadOnce::bind1 that Discards the output of the function.

fn discard_mut<AMB, B>(self, f: AMB) -> M::T<A>where Self: Sized, B: Discard, AMB: for<'a> F1Once<&'a mut A, Ret = M::T<B>>, M::T<B>: MonadOnce<M, B>,

MonadOnce::discard with mutable access to the data

impl<A> Plus<Option, A> for Option<A>

fn empty() -> <Option as HKT1>::T<A>

See Plus

impl<A, B> Traversable<Option, A, B, ()> for Option<A>

fn traversem1<Ap, AtoApOfB>(self, f: AtoApOfB) -> Ap::T<<Option as HKT1>::T<B>>where Ap: HKT1, Ap::T<B>: Applicative<Ap, B> + ApplyOnce<Ap, B>, Ap::T<()>: Applicative<Ap, ()> + ApplyOnce<Ap, ()>, Ap::T<<Option as HKT1>::T<B>>: Applicative<Ap, <Option as HKT1>::T<B>> + ApplyOnce<Ap, <Option as HKT1>::T<B>>, AtoApOfB: F1<A, Ret = Ap::T<B>>,

Traverse a structure with 0 or more elements, collecting into an Applicative of 0 or 1 elements.

fn traversemm<Ap, AtoApOfB>(self, f: AtoApOfB) -> Ap::T<<Option as HKT1>::T<B>>where Ap: HKT1, Ap::T<B>: Applicative<Ap, B>, Ap::T<()>: Applicative<Ap, ()>, Ap::T<<Option as HKT1>::T<B>>: Applicative<Ap, <Option as HKT1>::T<B>>, AtoApOfB: F1<A, Ret = Ap::T<B>>,

Traverse a structure with 0 or more elements, collecting into an Applicative of 0 or more elements.

fn traverse<Ap, AtoApOfB>(self, f: AtoApOfB) -> Ap::T<F::T<B>>where Ap: HKT1, Self: Sized + Foldable<F, A>, Ap::T<B>: Applicative<Ap, B> + ApplyOnce<Ap, B>, Ap::T<TF>: Applicative<Ap, TF> + ApplyOnce<Ap, TF>, Ap::T<F::T<B>>: Applicative<Ap, F::T<B>> + ApplyOnce<Ap, F::T<B>>, AtoApOfB: F1<A, Ret = Ap::T<B>>, F: HKT1<T<A> = Self>,

Aliases Traversable::traversem1

impl<A, B> TraversableOnce<Option, A, B, ()> for Option<A>

fn traverse1m<Ap, AtoApOfB>(self, f: AtoApOfB) -> Ap::T<Option<B>>where Ap: HKT1, Self: FoldableOnce<Option, A>, Ap::T<B>: Applicative<Ap, B>, Ap::T<()>: Applicative<Ap, ()>, Ap::T<Option<B>>: Applicative<Ap, Option<B>>, AtoApOfB: F1Once<A, Ret = Ap::T<B>>, Option: HKT1<T<A> = Self>,

Traverse a structure with 0 or 1 elements, collecting into an Applicative of 0 or more elements.

fn traverse11<Ap, AtoApOfB>(self, f: AtoApOfB) -> Ap::T<Option<B>>where Ap: HKT1, Ap::T<B>: Applicative<Ap, B> + ApplyOnce<Ap, B>, Ap::T<()>: Applicative<Ap, ()> + ApplyOnce<Ap, ()>, Ap::T<Option<B>>: Applicative<Ap, Option<B>> + ApplyOnce<Ap, Option<B>>, AtoApOfB: F1Once<A, Ret = Ap::T<B>>,

Traverse a structure with 0 or 1 elements, collecting into an Applicative of 0 or 1 elements.

fn traverse_swap<Ap, AtoApOfB>(self, f: AtoApOfB) -> Ap::T<F::T<B>>where Ap: HKT1, Self: Sized + FoldableOnce<F, A>, Ap::T<B>: Applicative<Ap, B> + ApplyOnce<Ap, B>, Ap::T<TF>: Applicative<Ap, TF> + ApplyOnce<Ap, TF>, Ap::T<F::T<B>>: Applicative<Ap, F::T<B>> + ApplyOnce<Ap, F::T<B>>, AtoApOfB: F1Once<A, Ret = Ap::T<B>>, F: HKT1<T<A> = Self>,

Aliases TraversableOnce::traverse11

fn traverse_replicate<Ap, AtoApOfB>(self, f: AtoApOfB) -> Ap::T<F::T<B>>where Ap: HKT1, Self: Sized + FoldableOnce<F, A>, Ap::T<B>: Applicative<Ap, B>, Ap::T<TF>: Applicative<Ap, TF>, Ap::T<F::T<B>>: Applicative<Ap, F::T<B>>, AtoApOfB: F1Once<A, Ret = Ap::T<B>>, F: HKT1<T<A> = Self>,

Aliases TraversableOnce::traverse1m