Struct naan::fun::curry3::Curry3

pub struct Curry3<F, A, B, C, D> { /* private fields */ }

A curried function that accepts 2 arguments

Implementations

impl<F, A, B, C, D> Curry3<F, Nothing<A>, Nothing<B>, Nothing<C>, D>where F: F3Once<A, B, C, Ret = D>,

pub fn curry(f: F) -> Self

Curry a ternary function

pub fn uncurry(self) -> F

Unwrap the Curry2 wrapper, getting the inner function

Trait Implementations

impl<F, A, B, C, D> Clone for Curry3<F, A, B, C, D>where F: Clone + FnOnce(A::T, B::T) -> C::T, A: Arg + Clone, B: Arg + Clone, C: Arg,

fn clone(&self) -> Self

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<K, A, B> Traversable<BTreeMapValues<K>, A, B, Curry3<fn(_: K, _: B, _: BTreeMap<K, B, Global>) -> BTreeMap<K, B, Global>, Just<K>, Just<B>, Nothing<BTreeMap<K, B, Global>>, BTreeMap<K, B, Global>>> for BTreeMap<K, A>where K: Clone + Ord, BTreeMapValues<K>: HKT1<T<B> = BTreeMap<K, B>>,

fn traversem1<Ap, AtoApOfB>(self, f: AtoApOfB) -> Ap::T<BTreeMap<K, B>>where Ap: HKT1, Self: Foldable<BTreeMapValues<K>, A>, Ap::T<B>: Applicative<Ap, B> + ApplyOnce<Ap, B>, Ap::T<insert2<K, B>>: Applicative<Ap, insert2<K, B>> + ApplyOnce<Ap, insert2<K, B>>, Ap::T<BTreeMap<K, B>>: Applicative<Ap, BTreeMap<K, B>> + ApplyOnce<Ap, BTreeMap<K, B>>, AtoApOfB: F1<A, Ret = Ap::T<B>>, BTreeMapValues<K>: 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<BTreeMap<K, B>>where Ap: HKT1, Self: Foldable<BTreeMapValues<K>, A>, B: Clone, Ap::T<B>: Applicative<Ap, B>, Ap::T<insert2<K, B>>: Applicative<Ap, insert2<K, B>>, Ap::T<BTreeMap<K, B>>: Applicative<Ap, BTreeMap<K, B>>, AtoApOfB: F1<A, Ret = Ap::T<B>>, BTreeMapValues<K>: HKT1<T<A> = Self>,

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

impl<K, A, B> Traversable<HashMapValues<K>, A, B, Curry3<fn(_: K, _: B, _: HashMap<K, B, RandomState>) -> HashMap<K, B, RandomState>, Just<K>, Just<B>, Nothing<HashMap<K, B, RandomState>>, HashMap<K, B, RandomState>>> for HashMap<K, A>where K: Clone + Eq + Hash, HashMapValues<K>: HKT1<T<B> = HashMap<K, B>>,

fn traversem1<Ap, AtoApOfB>(self, f: AtoApOfB) -> Ap::T<HashMap<K, B>>where Ap: HKT1, Self: Foldable<HashMapValues<K>, A>, Ap::T<B>: Applicative<Ap, B> + ApplyOnce<Ap, B>, Ap::T<insert2<K, B>>: Applicative<Ap, insert2<K, B>> + ApplyOnce<Ap, insert2<K, B>>, Ap::T<HashMap<K, B>>: Applicative<Ap, HashMap<K, B>> + ApplyOnce<Ap, HashMap<K, B>>, AtoApOfB: F1<A, Ret = Ap::T<B>>, HashMapValues<K>: 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<HashMap<K, B>>where Ap: HKT1, Self: Foldable<HashMapValues<K>, A>, B: Clone, Ap::T<B>: Applicative<Ap, B>, Ap::T<insert2<K, B>>: Applicative<Ap, insert2<K, B>>, Ap::T<HashMap<K, B>>: Applicative<Ap, HashMap<K, B>>, AtoApOfB: F1<A, Ret = Ap::T<B>>, HashMapValues<K>: HKT1<T<A> = Self>,

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