Enum lambda_calculus::term::Term
[−]
[src]
pub enum Term { Var(usize), Abs(Box<Term>), App(Box<Term>, Box<Term>), }
A lambda term that is either a variable with a De Bruijn index, an abstraction over a term or an applicaction of one term to another.
Variants
Var(usize)
a variable
Abs(Box<Term>)
an abstraction
App(Box<Term>, Box<Term>)
an application
Methods
impl Term
[src]
fn app(self, argument: Term) -> Term
Applies self
to another term without substitution or reduction.
Example
use lambda_calculus::term::*; assert_eq!(Var(1).app(Var(2)), App(Box::new(Var(1)), Box::new(Var(2))));
fn unvar(self) -> Result<usize, Error>
Consumes a lambda variable and returns its De Bruijn index.
Example
use lambda_calculus::term::*; assert_eq!(Var(1).unvar(), Ok(1));
Errors
The function will return an error if self
is not a Var
iable.
fn unvar_ref(&self) -> Result<&usize, Error>
Returns a reference to a variable's index.
Example
use lambda_calculus::term::*; assert_eq!(Var(1).unvar_ref(), Ok(&1));
Errors
The function will return an error if self
is not a Var
iable.
fn unvar_mut(&mut self) -> Result<&mut usize, Error>
Returns a mutable reference to a variable's index.
Example
use lambda_calculus::term::*; assert_eq!(Var(1).unvar_mut(), Ok(&mut 1));
Errors
The function will return an error if self
is not a Var
iable.
fn unabs(self) -> Result<Term, Error>
Consumes an abstraction and returns its underlying term.
Example
use lambda_calculus::term::*; assert_eq!(abs(Var(1)).unabs(), Ok(Var(1)));
Errors
The function will return an error if self
is not an Abs
traction.
fn unabs_ref(&self) -> Result<&Term, Error>
Returns a reference to an abstraction's underlying term.
Example
use lambda_calculus::term::*; assert_eq!(abs(Var(1)).unabs_ref(), Ok(&Var(1)));
Errors
The function will return an error if self
is not an Abs
traction.
fn unabs_mut(&mut self) -> Result<&mut Term, Error>
Returns a mutable reference to an abstraction's underlying term.
Example
use lambda_calculus::term::*; assert_eq!(abs(Var(1)).unabs_mut(), Ok(&mut Var(1)));
Errors
The function will return an error if self
is not an Abs
traction.
fn unapp(self) -> Result<(Term, Term), Error>
Consumes an application and returns a pair containing its underlying terms.
Example
use lambda_calculus::term::*; assert_eq!(Var(1).app(Var(2)).unapp(), Ok((Var(1), Var(2))));
Errors
The function will return an error if self
is not an App
lication.
fn unapp_ref(&self) -> Result<(&Term, &Term), Error>
Returns a pair containing references to an application's underlying terms.
Example
use lambda_calculus::term::*; assert_eq!(Var(1).app(Var(2)).unapp_ref(), Ok((&Var(1), &Var(2))));
Errors
The function will return an error if self
is not an App
lication.
fn unapp_mut(&mut self) -> Result<(&mut Term, &mut Term), Error>
Returns a pair containing mutable references to an application's underlying terms.
Example
use lambda_calculus::term::*; assert_eq!(Var(1).app(Var(2)).unapp_mut(), Ok((&mut Var(1), &mut Var(2))));
Errors
The function will return an error if self
is not an App
lication.
fn lhs(self) -> Result<Term, Error>
Returns the left-hand side term of an application. Consumes self
.
Example
use lambda_calculus::term::*; assert_eq!(Var(1).app(Var(2)).lhs(), Ok(Var(1)));
Errors
The function will return an error if self
is not an App
lication.
fn lhs_ref(&self) -> Result<&Term, Error>
Returns a reference to the left-hand side term of an application.
Example
use lambda_calculus::term::*; assert_eq!(Var(1).app(Var(2)).lhs_ref(), Ok(&Var(1)));
Errors
The function will return an error if self
is not an App
lication.
fn lhs_mut(&mut self) -> Result<&mut Term, Error>
Returns a mutable reference to the left-hand side term of an application.
Example
use lambda_calculus::term::*; assert_eq!(Var(1).app(Var(2)).lhs_mut(), Ok(&mut Var(1)));
fn rhs(self) -> Result<Term, Error>
Returns the right-hand side term of an application. Consumes self
.
Example
use lambda_calculus::term::*; assert_eq!(Var(1).app(Var(2)).rhs(), Ok(Var(2)));
Errors
The function will return an error if self
is not an App
lication.
fn rhs_ref(&self) -> Result<&Term, Error>
Returns a reference to the right-hand side term of an application.
Example
use lambda_calculus::term::*; assert_eq!(Var(1).app(Var(2)).rhs_ref(), Ok(&Var(2)));
Errors
The function will return an error if self
is not an App
lication.
fn rhs_mut(&mut self) -> Result<&mut Term, Error>
impl Term
[src]
fn apply(self, rhs: &Term) -> Result<Term, Error>
Applies self
to another Term
and performs substitution, consuming self
in the process.
Example
use lambda_calculus::parser::parse; use lambda_calculus::term::Notation::DeBruijn; let lhs = parse(&"λλ42(λ13)", DeBruijn).unwrap(); let rhs = parse(&"λ51", DeBruijn).unwrap(); let result = parse(&"λ3(λ61)(λ1(λ71))", DeBruijn).unwrap(); assert_eq!(lhs.apply(&rhs), Ok(result));
Errors
The function will return an error if self
is not an Abs
traction.
fn eval(self) -> Result<Term, Error>
Reduces an App
lication by substitution and variable update.
Example
use lambda_calculus::term::{app, abs}; use lambda_calculus::term::Term::Var; use lambda_calculus::church::numerals::zero; use lambda_calculus::combinators::i; assert_eq!(app(i(), zero()).eval(), Ok(zero()));
Errors
The function will return an error if self
is not an App
lication or if its left hand
side term is not an Abs
traction.
fn beta(&mut self, order: Order, limit: usize, verbose: bool) -> usize
Performs β-reduction on a Term
with the specified evaluation Order
, an optional limit
on number of reductions (0
means no limit) and optional display of reduction steps; it
returns the number of performed reductions.
Example
use lambda_calculus::church::numerals::pred; use lambda_calculus::reduction::Order::NOR; let mut pred_one = pred().app(1.into()); pred_one.beta(NOR, 0, false); assert_eq!(pred_one, 0.into());
impl Term
[src]
fn value(&self) -> Result<usize, Error>
Returns the value of self
if it's a Church-encoded number.
Example
use lambda_calculus::church::numerals::one; assert_eq!(one().value(), Ok(1));
Errors
The function will return an error if self
is not a Church number.
fn is_cnum(&self) -> bool
Checks whether self
is a Church-encoded number.
Example
use lambda_calculus::church::numerals::one; assert!(one().is_cnum());
impl Term
[src]
fn is_pair(&self) -> bool
Checks whether self
is a Church-encoded pair.
Example
use lambda_calculus::church::pairs::pair; use lambda_calculus::church::numerals::{zero, one}; let pair01 = app!(pair(), zero(), one()); assert!(pair01.is_pair());
fn unpair(self) -> Result<(Term, Term), Error>
Splits a Church-encoded pair into a pair of terms, consuming self
.
Example
use lambda_calculus::church::pairs::pair; use lambda_calculus::church::numerals::{zero, one}; let pair01 = app!(pair(), zero(), one()); assert_eq!(pair01.unpair(), Ok((zero(), one())));
Errors
The function will return an error if self
is not a Church pair.
fn unpair_ref(&self) -> Result<(&Term, &Term), Error>
Splits a Church-encoded pair into a pair of references to its underlying terms.
Example
use lambda_calculus::church::pairs::pair; use lambda_calculus::church::numerals::{zero, one}; let pair01 = app!(pair(), zero(), one()); assert_eq!(pair01.unpair_ref(), Ok((&zero(), &one())));
Errors
The function will return an error if self
is not a Church pair.
fn unpair_mut(&mut self) -> Result<(&mut Term, &mut Term), Error>
Splits a Church-encoded pair into a pair of mutable references to its underlying terms.
Example
use lambda_calculus::church::pairs::pair; use lambda_calculus::church::numerals::{zero, one}; let mut pair01 = app!(pair(), zero(), one()); assert_eq!(pair01.unpair_mut(), Ok((&mut zero(), &mut one())));
Errors
The function will return an error if self
is not a Church pair.
fn fst(self) -> Result<Term, Error>
Returns the first term from a Church-encoded pair, consuming self
.
Example
use lambda_calculus::church::pairs::pair; use lambda_calculus::church::numerals::{zero, one}; let pair01 = app!(pair(), zero(), one()); assert_eq!(pair01.fst(), Ok(zero()));
Errors
The function will return an error if self
is not a Church pair.
fn fst_ref(&self) -> Result<&Term, Error>
Returns a reference to the first term of a Church-encoded pair.
Example
use lambda_calculus::church::pairs::pair; use lambda_calculus::church::numerals::{zero, one}; let pair01 = app!(pair(), zero(), one()); assert_eq!(pair01.fst_ref(), Ok(&zero()));
Errors
The function will return an error if self
is not a Church pair.
fn fst_mut(&mut self) -> Result<&mut Term, Error>
Returns a mutable reference to the first term of a Church-encoded pair. Returns a reference to the first term of a Church-encoded pair.
Example
use lambda_calculus::church::pairs::pair; use lambda_calculus::church::numerals::{zero, one}; let mut pair01 = app!(pair(), zero(), one()); assert_eq!(pair01.fst_mut(), Ok(&mut zero()));
Errors
The function will return an error if self
is not a Church pair.
fn snd(self) -> Result<Term, Error>
Returns the second term from a Church-encoded pair, consuming self
.
Example
use lambda_calculus::church::pairs::pair; use lambda_calculus::church::numerals::{zero, one}; let pair01 = app!(pair(), zero(), one()); assert_eq!(pair01.snd(), Ok(one()));
Errors
The function will return an error if self
is not a Church pair.
fn snd_ref(&self) -> Result<&Term, Error>
Returns a reference to the second term of a Church-encoded pair.
Example
use lambda_calculus::church::pairs::pair; use lambda_calculus::church::numerals::{zero, one}; let pair01 = app!(pair(), zero(), one()); assert_eq!(pair01.snd_ref(), Ok(&one()));
Errors
The function will return an error if self
is not a Church pair.
fn snd_mut(&mut self) -> Result<&mut Term, Error>
Returns a mutable reference to the second term of a Church-encoded pair.
Example
use lambda_calculus::church::pairs::pair; use lambda_calculus::church::numerals::{zero, one}; let mut pair01 = app!(pair(), zero(), one()); assert_eq!(pair01.snd_mut(), Ok(&mut one()));
Errors
The function will return an error if self
is not a Church pair.
impl Term
[src]
fn is_empty(&self) -> bool
Checks whether self is a empty Church list, i.e. nil()
.
Example
use lambda_calculus::church::lists::nil; assert!(nil().is_empty());
fn is_list(&self) -> bool
Checks whether self
is a Church list.
Example
use lambda_calculus::term::Term; use lambda_calculus::church::numerals::{zero, one}; let list_110 = Term::from(vec![one(), one(), zero()]); assert!(list_110.is_list());
fn uncons(self) -> Result<(Term, Term), Error>
Splits a Church list into a pair containing its first term and a list of all the
other terms, consuming self
.
Example
use lambda_calculus::term::Term; use lambda_calculus::church::numerals::{zero, one}; let list_110 = Term::from(vec![one(), one(), zero()]); assert_eq!(list_110.uncons(), Ok((one(), Term::from(vec![one(), zero()]))));
Errors
The function will return an error if self
is not a Church list.
fn uncons_ref(&self) -> Result<(&Term, &Term), Error>
Splits a Church list into a pair containing references to its first term and a to list of all the other terms.
Example
use lambda_calculus::term::Term; use lambda_calculus::church::numerals::{zero, one}; let list_110 = Term::from(vec![one(), one(), zero()]); assert_eq!(list_110.uncons_ref(), Ok((&one(), &Term::from(vec![one(), zero()]))));
Errors
The function will return an error if self
is not a Church list.
fn uncons_mut(&mut self) -> Result<(&mut Term, &mut Term), Error>
Splits a Church list into a pair containing mutable references to its first term and a to list of all the other terms.
Example
use lambda_calculus::term::Term; use lambda_calculus::church::numerals::{zero, one}; let mut list_110 = Term::from(vec![one(), one(), zero()]); assert_eq!(list_110.uncons_mut(), Ok((&mut one(), &mut Term::from(vec![one(), zero()]))));
Errors
The function will return an error if self
is not a Church list.
fn head(self) -> Result<Term, Error>
Returns the first term from a Church list, consuming self
.
Example
use lambda_calculus::term::Term; use lambda_calculus::church::numerals::{zero, one}; let list_110 = Term::from(vec![one(), one(), zero()]); assert_eq!(list_110.head(), Ok(one()));
Errors
The function will return an error if self
is not a Church list.
fn head_ref(&self) -> Result<&Term, Error>
Returns a reference to the first term of a Church list.
Example
use lambda_calculus::term::Term; use lambda_calculus::church::numerals::{zero, one}; let list_110 = Term::from(vec![one(), one(), zero()]); assert_eq!(list_110.head_ref(), Ok(&one()));
Errors
The function will return an error if self
is not a Church list.
fn head_mut(&mut self) -> Result<&mut Term, Error>
Returns a mutable reference to the first term of a Church list.
Example
use lambda_calculus::term::Term; use lambda_calculus::church::numerals::{zero, one}; let mut list_110 = Term::from(vec![one(), one(), zero()]); assert_eq!(list_110.head_mut(), Ok(&mut one()));
Errors
The function will return an error if self
is not a Church list.
fn tail(self) -> Result<Term, Error>
Returns a list of all the terms of a Church list but the first one, consuming self
.
Example
use lambda_calculus::term::Term; use lambda_calculus::church::numerals::{zero, one}; let list_110 = Term::from(vec![one(), one(), zero()]); assert_eq!(list_110.tail(), Ok(Term::from(vec![one(), zero()])));
Errors
The function will return an error if self
is not a Church list.
fn tail_ref(&self) -> Result<&Term, Error>
Returns a reference to a list of all the terms of a Church list but the first one.
Example
use lambda_calculus::term::Term; use lambda_calculus::church::numerals::{zero, one}; let list_110 = Term::from(vec![one(), one(), zero()]); assert_eq!(list_110.tail_ref(), Ok(&Term::from(vec![one(), zero()])));
Errors
The function will return an error if self
is not a Church list.
fn tail_mut(&mut self) -> Result<&mut Term, Error>
Returns a mutable reference to a list of all the terms of a Church list but the first one.
Example
use lambda_calculus::term::Term; use lambda_calculus::church::numerals::{zero, one}; let mut list_110 = Term::from(vec![one(), one(), zero()]); assert_eq!(list_110.tail_mut(), Ok(&mut Term::from(vec![one(), zero()])));
Errors
The function will return an error if self
is not a Church list.
fn len(&self) -> Result<usize, Error>
Returns the length of a Church list
Example
use lambda_calculus::term::Term; use lambda_calculus::church::numerals::{zero, one}; let list_110 = Term::from(vec![one(), one(), zero()]); assert_eq!(list_110.len(), Ok(3));
Errors
The function will return an error if self
is not a Church list.
fn push(self, term: Term) -> Result<Term, Error>
Adds a term to the beginning of a Church list and returns the new list. Consumes
self
and the argument.
Example
use lambda_calculus::term::Term; use lambda_calculus::church::numerals::{zero, one}; let list_110 = Term::from(vec![one(), one(), zero()]); assert_eq!(list_110.push(zero()), Ok(Term::from(vec![zero(), one(), one(), zero()])));
Errors
The function will return an error if self
is not a Church list or a nil()
.
fn pop(&mut self) -> Result<Term, Error>
Removes the first element from a Church list and returns it.
Example
use lambda_calculus::term::Term; use lambda_calculus::church::numerals::{zero, one}; let mut list_110 = Term::from(vec![one(), one(), zero()]); assert_eq!(list_110.pop(), Ok(one())); assert_eq!(list_110, Term::from(vec![one(), zero()])); assert_eq!(list_110.pop(), Ok(one())); assert_eq!(list_110, Term::from(vec![zero()])); assert_eq!(list_110.pop(), Ok(zero())); assert_eq!(list_110, Term::from(vec![])); assert!(list_110.is_empty())
Errors
The function will return an error if self
is not a Church list.
Trait Implementations
impl PartialEq for Term
[src]
fn eq(&self, __arg_0: &Term) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, __arg_0: &Term) -> bool
This method tests for !=
.
impl Clone for Term
[src]
fn clone(&self) -> Term
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0
Performs copy-assignment from source
. Read more
impl Hash for Term
[src]
fn hash<__H: Hasher>(&self, __arg_0: &mut __H)
Feeds this value into the given [Hasher
]. Read more
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0
H: Hasher,
Feeds a slice of this type into the given [Hasher
]. Read more
impl Eq for Term
[src]
impl Display for Term
[src]
impl Debug for Term
[src]
impl From<usize> for Term
[src]
impl From<bool> for Term
[src]
impl From<(Term, Term)> for Term
[src]
impl From<Vec<Term>> for Term
[src]
impl Iterator for Term
[src]
type Item = Term
The type of the elements being iterated over.
fn next(&mut self) -> Option<Term>
Advances the iterator and returns the next value. Read more
fn size_hint(&self) -> (usize, Option<usize>)
1.0.0
Returns the bounds on the remaining length of the iterator. Read more
fn count(self) -> usize
1.0.0
Consumes the iterator, counting the number of iterations and returning it. Read more
fn last(self) -> Option<Self::Item>
1.0.0
Consumes the iterator, returning the last element. Read more
fn nth(&mut self, n: usize) -> Option<Self::Item>
1.0.0
Returns the n
th element of the iterator. Read more
fn step_by(self, step: usize) -> StepBy<Self>
🔬 This is a nightly-only experimental API. (iterator_step_by
)
unstable replacement of Range::step_by
Creates an iterator starting at the same point, but stepping by the given amount at each iteration. Read more
fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator<Item = Self::Item>,
1.0.0
U: IntoIterator<Item = Self::Item>,
Takes two iterators and creates a new iterator over both in sequence. Read more
fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator,
1.0.0
U: IntoIterator,
'Zips up' two iterators into a single iterator of pairs. Read more
fn map<B, F>(self, f: F) -> Map<Self, F> where
F: FnMut(Self::Item) -> B,
1.0.0
F: FnMut(Self::Item) -> B,
Takes a closure and creates an iterator which calls that closure on each element. Read more
fn filter<P>(self, predicate: P) -> Filter<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0
P: FnMut(&Self::Item) -> bool,
Creates an iterator which uses a closure to determine if an element should be yielded. Read more
fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where
F: FnMut(Self::Item) -> Option<B>,
1.0.0
F: FnMut(Self::Item) -> Option<B>,
Creates an iterator that both filters and maps. Read more
fn enumerate(self) -> Enumerate<Self>
1.0.0
Creates an iterator which gives the current iteration count as well as the next value. Read more
fn peekable(self) -> Peekable<Self>
1.0.0
Creates an iterator which can use peek
to look at the next element of the iterator without consuming it. Read more
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0
P: FnMut(&Self::Item) -> bool,
Creates an iterator that [skip
]s elements based on a predicate. Read more
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0
P: FnMut(&Self::Item) -> bool,
Creates an iterator that yields elements based on a predicate. Read more
fn skip(self, n: usize) -> Skip<Self>
1.0.0
Creates an iterator that skips the first n
elements. Read more
fn take(self, n: usize) -> Take<Self>
1.0.0
Creates an iterator that yields its first n
elements. Read more
fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
F: FnMut(&mut St, Self::Item) -> Option<B>,
1.0.0
F: FnMut(&mut St, Self::Item) -> Option<B>,
An iterator adaptor similar to [fold
] that holds internal state and produces a new iterator. Read more
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
F: FnMut(Self::Item) -> U,
U: IntoIterator,
1.0.0
F: FnMut(Self::Item) -> U,
U: IntoIterator,
Creates an iterator that works like map, but flattens nested structure. Read more
fn fuse(self) -> Fuse<Self>
1.0.0
Creates an iterator which ends after the first [None
]. Read more
fn inspect<F>(self, f: F) -> Inspect<Self, F> where
F: FnMut(&Self::Item) -> (),
1.0.0
F: FnMut(&Self::Item) -> (),
Do something with each element of an iterator, passing the value on. Read more
fn by_ref(&mut self) -> &mut Self
1.0.0
Borrows an iterator, rather than consuming it. Read more
fn collect<B>(self) -> B where
B: FromIterator<Self::Item>,
1.0.0
B: FromIterator<Self::Item>,
Transforms an iterator into a collection. Read more
fn partition<B, F>(self, f: F) -> (B, B) where
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool,
1.0.0
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool,
Consumes an iterator, creating two collections from it. Read more
fn fold<B, F>(self, init: B, f: F) -> B where
F: FnMut(B, Self::Item) -> B,
1.0.0
F: FnMut(B, Self::Item) -> B,
An iterator adaptor that applies a function, producing a single, final value. Read more
fn all<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
1.0.0
F: FnMut(Self::Item) -> bool,
Tests if every element of the iterator matches a predicate. Read more
fn any<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
1.0.0
F: FnMut(Self::Item) -> bool,
Tests if any element of the iterator matches a predicate. Read more
fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
P: FnMut(&Self::Item) -> bool,
1.0.0
P: FnMut(&Self::Item) -> bool,
Searches for an element of an iterator that satisfies a predicate. Read more
fn position<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
1.0.0
P: FnMut(Self::Item) -> bool,
Searches for an element in an iterator, returning its index. Read more
fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
Self: ExactSizeIterator + DoubleEndedIterator,
1.0.0
P: FnMut(Self::Item) -> bool,
Self: ExactSizeIterator + DoubleEndedIterator,
Searches for an element in an iterator from the right, returning its index. Read more
fn max(self) -> Option<Self::Item> where
Self::Item: Ord,
1.0.0
Self::Item: Ord,
Returns the maximum element of an iterator. Read more
fn min(self) -> Option<Self::Item> where
Self::Item: Ord,
1.0.0
Self::Item: Ord,
Returns the minimum element of an iterator. Read more
fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: FnMut(&Self::Item) -> B,
1.6.0
B: Ord,
F: FnMut(&Self::Item) -> B,
Returns the element that gives the maximum value from the specified function. Read more
fn max_by<F>(self, compare: F) -> Option<Self::Item> where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
1.15.0
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Returns the element that gives the maximum value with respect to the specified comparison function. Read more
fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: FnMut(&Self::Item) -> B,
1.6.0
B: Ord,
F: FnMut(&Self::Item) -> B,
Returns the element that gives the minimum value from the specified function. Read more
fn min_by<F>(self, compare: F) -> Option<Self::Item> where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
1.15.0
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Returns the element that gives the minimum value with respect to the specified comparison function. Read more
fn rev(self) -> Rev<Self> where
Self: DoubleEndedIterator,
1.0.0
Self: DoubleEndedIterator,
Reverses an iterator's direction. Read more
fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Iterator<Item = (A, B)>,
1.0.0
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Iterator<Item = (A, B)>,
Converts an iterator of pairs into a pair of containers. Read more
fn cloned<'a, T>(self) -> Cloned<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Clone,
1.0.0
Self: Iterator<Item = &'a T>,
T: 'a + Clone,
Creates an iterator which [clone
]s all of its elements. Read more
fn cycle(self) -> Cycle<Self> where
Self: Clone,
1.0.0
Self: Clone,
Repeats an iterator endlessly. Read more
fn sum<S>(self) -> S where
S: Sum<Self::Item>,
1.11.0
S: Sum<Self::Item>,
Sums the elements of an iterator. Read more
fn product<P>(self) -> P where
P: Product<Self::Item>,
1.11.0
P: Product<Self::Item>,
Iterates over the entire iterator, multiplying all the elements Read more
fn cmp<I>(self, other: I) -> Ordering where
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord,
1.5.0
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord,
Lexicographically compares the elements of this Iterator
with those of another. Read more
fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Lexicographically compares the elements of this Iterator
with those of another. Read more
fn eq<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
1.5.0
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are equal to those of another. Read more
fn ne<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
1.5.0
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are unequal to those of another. Read more
fn lt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are lexicographically less than those of another. Read more
fn le<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are lexicographically less or equal to those of another. Read more
fn gt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are lexicographically greater than those of another. Read more
fn ge<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are lexicographically greater than or equal to those of another. Read more