Struct LeftIterator 

pub struct LeftIterator<L>(pub L);

Tuple Fields

0: L

Trait Implementations

impl<L: Clone> Clone for LeftIterator<L>

fn clone(&self) -> LeftIterator<L>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<L: Debug> Debug for LeftIterator<L>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<L> ExactSizeLender for LeftIterator<L>

where L: Lender + for<'next> NodeLabelsLender<'next> + ExactSizeLender, for<'next> LenderLabel<'next, L>: Pair,

fn len(&self) -> usize

Returns the exact remaining length of the lender.

fn is_empty(&self) -> bool

Returns true if the lender has no more elements.

impl<L> Lender for LeftIterator<L>

where L: Lender + for<'next> NodeLabelsLender<'next>, for<'next> LenderLabel<'next, L>: Pair,

fn __check_covariance<'long: 'short, 'short>( proof: CovariantProof<<Self as Lending<'long>>::Lend>, ) -> CovariantProof<<Self as Lending<'short>>::Lend>

Internal method for compile-time covariance checking.

fn next(&mut self) -> Option<Lend<'_, Self>>

Yields the next lend, if any, of the lender.

fn size_hint(&self) -> (usize, Option<usize>)

Gets the estimated minimum and maximum length of the lender. Use .len() for the exact length if the lender implements ExactSizeLender.

fn next_chunk(&mut self, chunk_size: usize) -> Chunk<'_, Self>

where Self: Sized,

Takes the next chunk_size lends of the lender with temporary lender Chunk. This is equivalent to cloning the lender and calling take(chunk_size) on it.

fn count(self) -> usize

where Self: Sized,

Counts the number of lends in the lender by consuming it.

fn last<'call>(&'call mut self) -> Option<Self::Lend>

where Self: Sized,

Gets the last lend of the lender, if any, by consuming it.

fn advance_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

Advances the lender by n lends.

fn nth(&mut self, n: usize) -> Option<Self::Lend>

Yields the nth lend of the lender, if any, by consuming it. If the lender does not have enough lends, returns None.

fn step_by(self, step: usize) -> StepBy<Self>

where Self: Sized,

Skips step - 1 lends between each lend of the lender.

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoLender>::Lender>

where Self: Sized, U: for<'all> IntoLender + for<'all> Lending<'all, Lend = Self::Lend>,

Chains the lender with another lender of the same type.

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoLender>::Lender>

where U: IntoLender, Self: Sized,

Zips the lender with another lender of the same or different type.

fn intersperse<'call>(self, separator: Self::Lend) -> Intersperse<'call, Self>

where Self: Sized, Self::Lend: for<'all> Clone,

Intersperses each lend of this lender with the given separator.

fn intersperse_with<'call, G>( self, separator: G, ) -> IntersperseWith<'call, Self, G>

where Self: Sized, G: FnMut() -> Self::Lend,

Intersperses each lend of this lender with the separator produced by the given function.

fn map<F>(self, f: Covar<F>) -> Map<Self, F>

where Self: Sized, F: for<'all> FnMutHKA<'all, Self::Lend>,

Maps each lend of this lender using the given function.

fn map_into_iter<O, F>(self, f: F) -> MapIntoIter<Self, O, F>

where F: FnMut(Self::Lend) -> O, Self: Sized,

Maps each lend of this lender into an owned value using the given function.

fn for_each<F>(self, f: F)

where Self: Sized, F: FnMut(Self::Lend),

Calls the given function with each lend of this lender.

fn filter<P>(self, predicate: P) -> Filter<Self, P>

where Self: Sized, P: FnMut(&Self::Lend) -> bool,

Filters this lender using the given predicate.

fn filter_map<F>(self, f: Covar<F>) -> FilterMap<Self, F>

where Self: Sized, F: for<'all> FnMutHKAOpt<'all, Self::Lend>,

Filters and maps this lender using the given function.

fn enumerate(self) -> Enumerate<Self>

where Self: Sized,

Enumerates this lender. Each lend is paired with its zero-based index.

fn peekable<'call>(self) -> Peekable<'call, Self>

where Self: Sized,

Makes this lender peekable, so that it is possible to peek at the next lend without consuming it.

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>

where Self: Sized, P: FnMut(&Self::Lend) -> bool,

Skips the first contiguous sequence of lends of this lender that satisfy the given predicate.

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>

where Self: Sized, P: FnMut(&Self::Lend) -> bool,

Takes the first contiguous sequence of lends of this lender that satisfy the given predicate.

fn map_while<P>(self, predicate: Covar<P>) -> MapWhile<Self, P>

where Self: Sized, P: for<'all> FnMutHKAOpt<'all, Self::Lend>,

Maps this lender using the given function while it returns Some.

fn skip(self, n: usize) -> Skip<Self>

where Self: Sized,

Skips the first n lends of this lender.

fn take(self, n: usize) -> Take<Self>

where Self: Sized,

Takes the first n lends of this lender.

fn scan<St, F>(self, initial_state: St, f: Covar<F>) -> Scan<Self, St, F>

where Self: Sized, F: for<'all> FnMutHKAOpt<'all, (&'all mut St, Self::Lend)>,

The Lender version of Iterator::scan.

fn flat_map<'call, F>(self, f: Covar<F>) -> FlatMap<'call, Self, F>

where Self: Sized, F: for<'all> FnMutHKA<'all, Self::Lend>, <F as FnMutHKA<'all, Self::Lend>>::B: for<'all> IntoLender,

The Lender version of Iterator::flat_map.

fn flatten<'call>(self) -> Flatten<'call, Self>

where Self: Sized, Self::Lend: for<'all> IntoLender,

The Lender version of Iterator::flatten.

fn fuse(self) -> Fuse<Self>

where Self: Sized,

The Lender version of Iterator::fuse.

fn inspect<F>(self, f: F) -> Inspect<Self, F>

where Self: Sized, F: FnMut(&Self::Lend),

The Lender version of Iterator::inspect.

fn mutate<F>(self, f: F) -> Mutate<Self, F>

where Self: Sized, F: FnMut(&mut Self::Lend),

Mutates each lend with the given function.

fn by_ref(&mut self) -> &mut Self

where Self: Sized,

The Lender version of Iterator::by_ref.

fn collect<B>(self) -> B

where Self: Sized, B: FromLender<Self>,

The Lender version of Iterator::collect.

fn try_collect<'a, B>( &'a mut self, ) -> <<Self::Lend as Try>::Residual as Residual<B>>::TryType

where Self: Sized, Self::Lend: for<'all> Try, <Self::Lend as Try>::Residual: for<'all> Residual<B>, B: for<'all> FromLender<TryShunt<'all, &'a mut Self>>,

The Lender version of Iterator::try_collect.

fn collect_into<E>(self, collection: &mut E) -> &mut E

where Self: Sized, E: ExtendLender<Self>,

The Lender version of Iterator::collect_into.

fn partition<E, F>(self, f: F) -> (E, E)

where Self: Sized, E: Default + ExtendLender<Self>, F: FnMut(&Self::Lend) -> bool,

The Lender version of Iterator::partition.

fn is_partitioned<P>(self, predicate: P) -> bool

where Self: Sized, P: FnMut(Self::Lend) -> bool,

The Lender version of Iterator::is_partitioned.

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R

where F: FnMut(B, Self::Lend) -> R, R: Try<Output = B>,

The Lender version of Iterator::try_fold.

fn try_for_each<F, R>(&mut self, f: F) -> R

where F: FnMut(Self::Lend) -> R, R: Try<Output = ()>,

The Lender version of Iterator::try_for_each.

fn fold<B, F>(self, init: B, f: F) -> B

where Self: Sized, F: FnMut(B, Self::Lend) -> B,

The Lender version of Iterator::fold.

fn reduce<T, F>(self, f: F) -> Option<T>

where Self: Sized, Self::Lend: for<'all> ToOwned<Owned = T>, F: FnMut(T, Self::Lend) -> T,

The Lender version of Iterator::reduce.

fn try_reduce<T, F, R>( self, f: F, ) -> <<R as Try>::Residual as Residual<Option<T>>>::TryType

where Self: Sized, Self::Lend: for<'all> ToOwned<Owned = T>, F: FnMut(T, Self::Lend) -> R, R: Try<Output = T>, <R as Try>::Residual: Residual<Option<T>>,

The Lender version of Iterator::try_reduce.

fn all<F>(&mut self, f: F) -> bool

where F: FnMut(Self::Lend) -> bool,

The Lender version of Iterator::all.

fn any<F>(&mut self, f: F) -> bool

where F: FnMut(Self::Lend) -> bool,

The Lender version of Iterator::any.

fn find<P>(&mut self, predicate: P) -> Option<Self::Lend>

where Self: Sized, P: FnMut(&Self::Lend) -> bool,

The Lender version of Iterator::find.

fn find_map<'a, F>( &'a mut self, f: F, ) -> Option<<F as FnMutHKAOpt<'a, Self::Lend>>::B>

where Self: Sized, F: for<'all> FnMutHKAOpt<'all, Self::Lend>,

The Lender version of Iterator::find_map.

fn try_find<F, R>( &mut self, f: F, ) -> <<R as Try>::Residual as Residual<Option<Self::Lend>>>::TryType

where Self: Sized, F: FnMut(&Self::Lend) -> R, R: Try<Output = bool>, <R as Try>::Residual: for<'all> Residual<Option<Self::Lend>>,

The Lender version of Iterator::try_find.

fn position<P>(&mut self, predicate: P) -> Option<usize>

where Self: Sized, P: FnMut(Self::Lend) -> bool,

The Lender version of Iterator::position.

fn max<T>(self) -> Option<T>

where T: Ord, Self: Sized, Self::Lend: for<'all> ToOwned<Owned = T>,

The Lender version of Iterator::max.

fn min<T>(self) -> Option<T>

where T: Ord, Self: Sized, Self::Lend: for<'all> ToOwned<Owned = T>,

The Lender version of Iterator::min.

fn max_by_key<B, T, F>(self, f: F) -> Option<T>

where B: Ord, Self: Sized, Self::Lend: for<'all> ToOwned<Owned = T>, F: FnMut(&T) -> B,

The Lender version of Iterator::max_by_key.

fn max_by<T, F>(self, compare: F) -> Option<T>

where Self: Sized, Self::Lend: for<'all> ToOwned<Owned = T>, F: FnMut(&T, &Self::Lend) -> Ordering,

The Lender version of Iterator::max_by.

fn min_by_key<B, T, F>(self, f: F) -> Option<T>

where B: Ord, Self: Sized, Self::Lend: for<'all> ToOwned<Owned = T>, F: FnMut(&T) -> B,

The Lender version of Iterator::min_by_key.

fn min_by<T, F>(self, compare: F) -> Option<T>

where Self: Sized, Self::Lend: for<'all> ToOwned<Owned = T>, F: FnMut(&T, &Self::Lend) -> Ordering,

The Lender version of Iterator::min_by.

fn unzip<ExtA, ExtB>(self) -> (ExtA, ExtB)

where Self: Sized, Self::Lend: for<'all> TupleLend<'all>, ExtA: Default + ExtendLender<FirstShunt<Self>>, ExtB: Default + ExtendLender<SecondShunt<Self>>,

The Lender version of Iterator::unzip.

fn copied<T>(self) -> Copied<Self>

where Self: Sized + for<'all> Lending<'all, Lend = &'all T>, T: Copy,

The Lender version of Iterator::copied.

fn cloned<T>(self) -> Cloned<Self>

where Self: Sized + for<'all> Lending<'all, Lend = &'all T>, T: Clone,

The Lender version of Iterator::cloned.

fn owned(self) -> Owned<Self>

where Self: Sized, Self::Lend: for<'all> ToOwned,

Turns this Lender into an Iterator.

fn cycle(self) -> Cycle<Self>

where Self: Sized + Clone,

The Lender version of Iterator::cycle.

fn sum<S>(self) -> S

where Self: Sized, S: SumLender<Self>,

The Lender version of Iterator::sum.

fn product<P>(self) -> P

where Self: Sized, P: ProductLender<Self>,

The Lender version of Iterator::product.

fn cmp<L>(self, other: L) -> Ordering

where L: IntoLender, <L as IntoLender>::Lender: for<'all> Lending<'all, Lend = Self::Lend>, Self::Lend: for<'all> Ord, Self: Sized,

The Lender version of Iterator::cmp.

fn cmp_by<L, F>(self, other: L, cmp: F) -> Ordering

where Self: Sized, L: IntoLender, F: for<'all> FnMut(Self::Lend, <<L as IntoLender>::Lender as Lending<'all>>::Lend) -> Ordering,

The Lender version of Iterator::cmp_by.

fn partial_cmp<L>(self, other: L) -> Option<Ordering>

where L: IntoLender, Self::Lend: for<'all> PartialOrd<<<L as IntoLender>::Lender as Lending<'all>>::Lend>, Self: Sized,

The Lender version of Iterator::partial_cmp.

fn partial_cmp_by<L, F>(self, other: L, partial_cmp: F) -> Option<Ordering>

where Self: Sized, L: IntoLender, F: for<'all> FnMut(Self::Lend, <<L as IntoLender>::Lender as Lending<'all>>::Lend) -> Option<Ordering>,

The Lender version of Iterator::partial_cmp_by.

fn eq<L>(self, other: L) -> bool

where L: IntoLender, Self::Lend: for<'all> PartialEq<<<L as IntoLender>::Lender as Lending<'all>>::Lend>, Self: Sized,

The Lender version of Iterator::eq.

fn eq_by<L, F>(self, other: L, eq: F) -> bool

where Self: Sized, L: IntoLender, F: for<'all> FnMut(Self::Lend, <<L as IntoLender>::Lender as Lending<'all>>::Lend) -> bool,

The Lender version of Iterator::eq_by.

fn ne<L>(self, other: L) -> bool

where L: IntoLender, Self::Lend: for<'all> PartialEq<<<L as IntoLender>::Lender as Lending<'all>>::Lend>, Self: Sized,

The Lender version of Iterator::ne.

fn lt<L>(self, other: L) -> bool

where L: IntoLender, Self::Lend: for<'all> PartialOrd<<<L as IntoLender>::Lender as Lending<'all>>::Lend>, Self: Sized,

The Lender version of Iterator::lt.

fn le<L>(self, other: L) -> bool

where L: IntoLender, Self::Lend: for<'all> PartialOrd<<<L as IntoLender>::Lender as Lending<'all>>::Lend>, Self: Sized,

The Lender version of Iterator::le.

fn gt<L>(self, other: L) -> bool

where L: IntoLender, Self::Lend: for<'all> PartialOrd<<<L as IntoLender>::Lender as Lending<'all>>::Lend>, Self: Sized,

The Lender version of Iterator::gt.

fn ge<L>(self, other: L) -> bool

where L: IntoLender, Self::Lend: for<'all> PartialOrd<<<L as IntoLender>::Lender as Lending<'all>>::Lend>, Self: Sized,

The Lender version of Iterator::ge.

fn is_sorted<T>(self) -> bool

where Self: Sized, Self::Lend: for<'all> ToOwned<Owned = T>, T: PartialOrd,

The Lender version of Iterator::is_sorted.

fn is_sorted_by<T, F>(self, compare: F) -> bool

where Self: Sized, Self::Lend: for<'all> ToOwned<Owned = T>, F: FnMut(&T, &T) -> Option<Ordering>,

The Lender version of Iterator::is_sorted_by.

fn is_sorted_by_key<F, K>(self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Lend) -> K, K: PartialOrd,

The Lender version of Iterator::is_sorted_by_key.

fn iter<'this>(self) -> Iter<'this, Self>

where Self: Sized + 'this, Self::Lend: 'this,

Turns this Lender into an Iterator where it has already fulfilled the requirements of the Iterator trait.

fn lender_by_ref<'this>(self) -> FromIterRef<Iter<'this, Self>>

where Self: Sized + 'this, Self::Lend: 'this,

Turns this Lender into a new Lender that lends references to the items of the original lender.

fn chunky(self, chunk_size: usize) -> Chunky<Self>

where Self: Sized + ExactSizeLender,

A lending replacement for Iterator::array_chunks.

fn convert<E>(self) -> Convert<E, Self>

where Self: Sized,

Converts a Lender whose lend type is Result<T, E> into a FallibleLender with error type E and lend type T.

fn into_fallible(self) -> IntoFallible<Self>

where Self: Sized,

Converts a Lender into a FallibleLender by wrapping into Result<Lend<'_, Self>, Infallible> where Infallible is an error that can never actually happen.

impl<'succ, L> Lending<'succ> for LeftIterator<L>

where L: Lender + for<'next> NodeLabelsLender<'next>, for<'next> LenderLabel<'next, L>: Pair,

type Lend = (usize, <LeftIterator<L> as NodeLabelsLender<'succ>>::IntoIterator)

The type being lent.

impl<'succ, L> NodeLabelsLender<'succ> for LeftIterator<L>

where L: Lender + for<'next> NodeLabelsLender<'next>, for<'next> LenderLabel<'next, L>: Pair,

type Label = <<L as NodeLabelsLender<'succ>>::Label as Pair>::Left

type IntoIterator = IntoLeftSucc<<L as NodeLabelsLender<'succ>>::IntoIterator>

fn into_labeled_pairs<'a>(self) -> IntoLabeledPairs<'a, Self>

where Self: Sized + for<'b> NodeLabelsLender<'b, Label: Pair<Left = usize>>,

Converts this lender into an iterator of labeled pairs of type ((usize, usize), Label), provided that the label type implements Pair with Left = usize.

fn into_pairs<'a>(self) -> IntoPairs<'a, Self>

where Self: Sized + for<'b> NodeLabelsLender<'b, Label = usize>,

Converts this lender into an iterator of pairs, provided that the label type is usize.

impl<L: Ord> Ord for LeftIterator<L>

fn cmp(&self, other: &LeftIterator<L>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<L: PartialEq> PartialEq for LeftIterator<L>

fn eq(&self, other: &LeftIterator<L>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<L: PartialOrd> PartialOrd for LeftIterator<L>

fn partial_cmp(&self, other: &LeftIterator<L>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<L: Eq> Eq for LeftIterator<L>

impl<L> SortedLender for LeftIterator<L>

where L: Lender + for<'next> NodeLabelsLender<'next> + SortedLender, for<'next> LenderLabel<'next, L>: Pair,

impl<L> StructuralPartialEq for LeftIterator<L>