Struct naan::impls::vec::hkt::Vec

pub struct Vec;

std::vec::Vec lifted to an HKT1

(Kind Type -> Type)

Trait Implementations

impl<A> Alt<Vec, A> for Vec<A>

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

See Alt

impl<A> Applicative<Vec, A> for Vec<A>

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

Lift A to F<A>

fn append_one(self, a: A) -> Selfwhere Self: Sized + Semigroup,

Append a single A to F<A>

impl<AB> Apply<Vec, AB> for Vec<AB>

fn apply_with<A, B, Cloner>( self, a: <Vec as HKT1>::T<A>, cloner: Cloner ) -> <Vec 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<A> Foldable<Vec, A> for Vec<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> FoldableIndexed<Vec, usize, A> for Vec<A>

fn foldr_idx<B, ABB>(self, f: ABB, b: B) -> Bwhere ABB: F3<usize, A, B, Ret = B>,

CHECK: Enumerate yields indexes (not the number of iterations) when going backwards in a double ended iterator

use naan::prelude::*;

vec![0, 1, 2].foldl_idx(|(), ix, val| assert_eq!(ix, val), ());
vec![0, 1, 2].foldr_idx(|ix, val, ()| assert_eq!(ix, val), ());

fn foldl_idx<B, BAB>(self, f: BAB, b: B) -> Bwhere BAB: F3<B, usize, A, Ret = B>,

Fold the data structure from left -> right

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

Fold the data structure from left -> right

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

Fold the data structure from right -> left

impl<A> Functor<Vec, A> for Vec<A>

fn fmap<AB, B>(self, f: AB) -> Vec<B>where AB: F1<A, Ret = B>,

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

impl HKT1 for Vec

type T<A> = Vec<A, Global>

The generic type

impl<A> Monad<Vec, A> for Vec<A>

fn bind<B, AMB>(self, f: AMB) -> Vec<B>where AMB: F1<A, Ret = Vec<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> Plus<Vec, A> for Vec<A>

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

See Plus

impl<A, B> Traversable<Vec, A, B, Curry2<fn(_: B, _: Vec<B, Global>) -> Vec<B, Global>, Just<B>, Nothing<Vec<B, Global>>, Vec<B, Global>>> for Vec<A>

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

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<Vec<B>>where Ap: HKT1, Self: Foldable<Vec, A>, B: Clone, Ap::T<B>: Applicative<Ap, B>, Ap::T<append1<B>>: Applicative<Ap, append1<B>>, Ap::T<Vec<B>>: Applicative<Ap, Vec<B>>, AtoApOfB: F1<A, Ret = Ap::T<B>>, Vec: HKT1<T<A> = Self>,

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