pub struct Iterator { /* private fields */ }
Expand description
Iterator over a flat-tree.
Implementations§
source§impl Iterator
impl Iterator
sourcepub fn new(index: u64) -> Self
pub fn new(index: u64) -> Self
Create a new iterator.
Examples
use flat_tree::Iterator;
assert_eq!(Iterator::new(0).take(3).collect::<Vec<u64>>(), [2, 4, 6]);
sourcepub fn seek(&mut self, index: u64)
pub fn seek(&mut self, index: u64)
Seek to a position in the iterator.
Examples
let mut iter = flat_tree::Iterator::new(0);
iter.seek(4);
assert_eq!(iter.next(), Some(6));
iter.seek(2);
assert_eq!(iter.next(), Some(4));
sourcepub fn is_left(&self) -> bool
pub fn is_left(&self) -> bool
Check if the position of the iterator is currently on a left node.
Examples
assert_eq!(flat_tree::Iterator::new(0).is_left(), true);
assert_eq!(flat_tree::Iterator::new(2).is_left(), false);
assert_eq!(flat_tree::Iterator::new(1).is_left(), true);
sourcepub fn is_right(&self) -> bool
pub fn is_right(&self) -> bool
Check if the position of the iterator is currently on a right node.
Examples
assert_eq!(flat_tree::Iterator::new(0).is_right(), false);
assert_eq!(flat_tree::Iterator::new(2).is_right(), true);
assert_eq!(flat_tree::Iterator::new(1).is_right(), false);
sourcepub fn contains(&self, index: u64) -> bool
pub fn contains(&self, index: u64) -> bool
Check if the the iterator contains given index.
Examples
let iter = flat_tree::Iterator::new(3);
assert_eq!(iter.contains(0), true);
assert_eq!(iter.contains(1), true);
assert_eq!(iter.contains(2), true);
assert_eq!(iter.contains(3), true);
assert_eq!(iter.contains(4), true);
assert_eq!(iter.contains(5), true);
assert_eq!(iter.contains(6), true);
assert_eq!(iter.contains(7), false);
assert_eq!(iter.contains(8), false);
let iter = flat_tree::Iterator::new(9);
assert_eq!(iter.contains(8), true);
assert_eq!(iter.contains(9), true);
assert_eq!(iter.contains(10), true);
assert_eq!(iter.contains(6), false);
assert_eq!(iter.contains(7), false);
assert_eq!(iter.contains(12), false);
assert_eq!(iter.contains(13), false);
let iter = flat_tree::Iterator::new(8);
assert_eq!(iter.contains(8), true);
assert_eq!(iter.contains(6), false);
assert_eq!(iter.contains(7), false);
assert_eq!(iter.contains(9), false);
assert_eq!(iter.contains(10), false);
sourcepub fn count_nodes(&self) -> u64
pub fn count_nodes(&self) -> u64
Returns how many nodes are in the tree of the current position.
Examples
assert_eq!(flat_tree::Iterator::new(0).count_nodes(), 1);
assert_eq!(flat_tree::Iterator::new(1).count_nodes(), 3);
assert_eq!(flat_tree::Iterator::new(3).count_nodes(), 7);
assert_eq!(flat_tree::Iterator::new(5).count_nodes(), 3);
assert_eq!(flat_tree::Iterator::new(23).count_nodes(), 15);
assert_eq!(flat_tree::Iterator::new(27).count_nodes(), 7);
sourcepub fn count_leaves(&self) -> u64
pub fn count_leaves(&self) -> u64
Returns how many leaves are in the tree of the current position.
Examples
assert_eq!(flat_tree::Iterator::new(0).count_leaves(), 1);
assert_eq!(flat_tree::Iterator::new(1).count_leaves(), 2);
assert_eq!(flat_tree::Iterator::new(2).count_leaves(), 1);
assert_eq!(flat_tree::Iterator::new(3).count_leaves(), 4);
assert_eq!(flat_tree::Iterator::new(5).count_leaves(), 2);
assert_eq!(flat_tree::Iterator::new(23).count_leaves(), 8);
assert_eq!(flat_tree::Iterator::new(27).count_leaves(), 4);
sourcepub fn prev(&mut self) -> u64
pub fn prev(&mut self) -> u64
Move the cursor and get the previous item from the current position.
Examples
let mut iter = flat_tree::Iterator::new(6);
assert_eq!(iter.prev(), 4);
assert_eq!(iter.prev(), 2);
assert_eq!(iter.prev(), 0);
sourcepub fn sibling(&mut self) -> u64
pub fn sibling(&mut self) -> u64
Get the sibling for the current position and move the cursor.
Examples
assert_eq!(flat_tree::Iterator::new(0).sibling(), 2);
assert_eq!(flat_tree::Iterator::new(1).sibling(), 5);
assert_eq!(flat_tree::Iterator::new(4).sibling(), 6);
sourcepub fn parent(&mut self) -> u64
pub fn parent(&mut self) -> u64
Get the parent for the current position and move the cursor.
Examples
assert_eq!(flat_tree::Iterator::new(0).parent(), 1);
assert_eq!(flat_tree::Iterator::new(1).parent(), 3);
assert_eq!(flat_tree::Iterator::new(4).parent(), 5);
sourcepub fn left_span(&mut self) -> u64
pub fn left_span(&mut self) -> u64
Get the left_span for the current position and move the cursor.
Examples
assert_eq!(flat_tree::Iterator::new(0).left_span(), 0);
assert_eq!(flat_tree::Iterator::new(1).left_span(), 0);
assert_eq!(flat_tree::Iterator::new(3).left_span(), 0);
assert_eq!(flat_tree::Iterator::new(23).left_span(), 16);
assert_eq!(flat_tree::Iterator::new(27).left_span(), 24);
sourcepub fn right_span(&mut self) -> u64
pub fn right_span(&mut self) -> u64
Get the right_span for the current position and move the cursor.
Examples
assert_eq!(flat_tree::Iterator::new(0).right_span(), 0);
assert_eq!(flat_tree::Iterator::new(1).right_span(), 2);
assert_eq!(flat_tree::Iterator::new(3).right_span(), 6);
assert_eq!(flat_tree::Iterator::new(23).right_span(), 30);
assert_eq!(flat_tree::Iterator::new(27).right_span(), 30);
sourcepub fn left_child(&mut self) -> u64
pub fn left_child(&mut self) -> u64
Get the left_child for the current position and move the cursor.
Examples
assert_eq!(flat_tree::Iterator::new(1).left_child(), 0);
assert_eq!(flat_tree::Iterator::new(3).left_child(), 1);
assert_eq!(flat_tree::Iterator::new(7).left_child(), 3);
sourcepub fn right_child(&mut self) -> u64
pub fn right_child(&mut self) -> u64
Get the right_child for the current position and move the cursor.
Examples
assert_eq!(flat_tree::Iterator::new(1).right_child(), 2);
assert_eq!(flat_tree::Iterator::new(3).right_child(), 5);
assert_eq!(flat_tree::Iterator::new(7).right_child(), 11);
sourcepub fn next_tree(&mut self) -> u64
pub fn next_tree(&mut self) -> u64
Move to the next tree from the current position and return new index.
Examples
assert_eq!(flat_tree::Iterator::new(0).next_tree(), 2);
assert_eq!(flat_tree::Iterator::new(1).next_tree(), 4);
assert_eq!(flat_tree::Iterator::new(3).next_tree(), 8);
assert_eq!(flat_tree::Iterator::new(7).next_tree(), 16);
sourcepub fn prev_tree(&mut self) -> u64
pub fn prev_tree(&mut self) -> u64
Move to the previous tree from the current position and return new index.
Examples
assert_eq!(flat_tree::Iterator::new(0).prev_tree(), 0);
assert_eq!(flat_tree::Iterator::new(1).prev_tree(), 0);
assert_eq!(flat_tree::Iterator::new(2).prev_tree(), 0);
assert_eq!(flat_tree::Iterator::new(3).prev_tree(), 0);
assert_eq!(flat_tree::Iterator::new(7).prev_tree(), 0);
assert_eq!(flat_tree::Iterator::new(5).prev_tree(), 2);
assert_eq!(flat_tree::Iterator::new(9).prev_tree(), 6);
assert_eq!(flat_tree::Iterator::new(11).prev_tree(), 6);
sourcepub fn full_root(&mut self, index: u64) -> bool
pub fn full_root(&mut self, index: u64) -> bool
Move cursor to the full root of given leaf index that the iterator index is a part of. If the cursor is already there, nothing is changed.
Returns true if a full root exists (moved or not), false if there are no full roots for the cursor or if given index is not a leaf.
See full_roots() for what is meant by a full root.
Examples
let mut iter = flat_tree::Iterator::new(0);
assert_eq!(iter.full_root(0), false);
assert_eq!(iter.full_root(22), true);
assert_eq!(iter.index(), 7);
assert_eq!(iter.next_tree(), 16);
assert_eq!(iter.full_root(22), true);
assert_eq!(iter.index(), 17);
assert_eq!(iter.next_tree(), 20);
assert_eq!(iter.full_root(22), true);
assert_eq!(iter.index(), 20);
assert_eq!(iter.next_tree(), 22);
assert_eq!(iter.full_root(22), false);
Trait Implementations§
source§impl Iterator for Iterator
impl Iterator for Iterator
source§fn next(&mut self) -> Option<Self::Item>
fn next(&mut self) -> Option<Self::Item>
source§fn next_chunk<const N: usize>(
&mut self
) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where
Self: Sized,
fn next_chunk<const N: usize>( &mut self ) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where Self: Sized,
iter_next_chunk
)N
values. Read more1.0.0 · source§fn size_hint(&self) -> (usize, Option<usize>)
fn size_hint(&self) -> (usize, Option<usize>)
1.0.0 · source§fn count(self) -> usizewhere
Self: Sized,
fn count(self) -> usizewhere Self: Sized,
1.0.0 · source§fn last(self) -> Option<Self::Item>where
Self: Sized,
fn last(self) -> Option<Self::Item>where Self: Sized,
source§fn advance_by(&mut self, n: usize) -> Result<(), NonZeroUsize>
fn advance_by(&mut self, n: usize) -> Result<(), NonZeroUsize>
iter_advance_by
)n
elements. Read more1.0.0 · source§fn nth(&mut self, n: usize) -> Option<Self::Item>
fn nth(&mut self, n: usize) -> Option<Self::Item>
n
th element of the iterator. Read more1.28.0 · source§fn step_by(self, step: usize) -> StepBy<Self>where
Self: Sized,
fn step_by(self, step: usize) -> StepBy<Self>where Self: Sized,
1.0.0 · source§fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>where
Self: Sized,
U: IntoIterator<Item = Self::Item>,
fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>where Self: Sized, U: IntoIterator<Item = Self::Item>,
1.0.0 · source§fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>where
Self: Sized,
U: IntoIterator,
fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>where Self: Sized, U: IntoIterator,
source§fn intersperse(self, separator: Self::Item) -> Intersperse<Self>where
Self: Sized,
Self::Item: Clone,
fn intersperse(self, separator: Self::Item) -> Intersperse<Self>where Self: Sized, Self::Item: Clone,
iter_intersperse
)separator
between adjacent
items of the original iterator. Read moresource§fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>where
Self: Sized,
G: FnMut() -> Self::Item,
fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>where Self: Sized, G: FnMut() -> Self::Item,
iter_intersperse
)separator
between adjacent items of the original iterator. Read more1.0.0 · source§fn map<B, F>(self, f: F) -> Map<Self, F>where
Self: Sized,
F: FnMut(Self::Item) -> B,
fn map<B, F>(self, f: F) -> Map<Self, F>where Self: Sized, F: FnMut(Self::Item) -> B,
1.21.0 · source§fn for_each<F>(self, f: F)where
Self: Sized,
F: FnMut(Self::Item),
fn for_each<F>(self, f: F)where Self: Sized, F: FnMut(Self::Item),
1.0.0 · source§fn filter<P>(self, predicate: P) -> Filter<Self, P>where
Self: Sized,
P: FnMut(&Self::Item) -> bool,
fn filter<P>(self, predicate: P) -> Filter<Self, P>where Self: Sized, P: FnMut(&Self::Item) -> bool,
1.0.0 · source§fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>where
Self: Sized,
F: FnMut(Self::Item) -> Option<B>,
fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>where Self: Sized, F: FnMut(Self::Item) -> Option<B>,
1.0.0 · source§fn enumerate(self) -> Enumerate<Self>where
Self: Sized,
fn enumerate(self) -> Enumerate<Self>where Self: Sized,
1.0.0 · source§fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>where
Self: Sized,
P: FnMut(&Self::Item) -> bool,
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>where Self: Sized, P: FnMut(&Self::Item) -> bool,
1.0.0 · source§fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>where
Self: Sized,
P: FnMut(&Self::Item) -> bool,
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>where Self: Sized, P: FnMut(&Self::Item) -> bool,
1.57.0 · source§fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>where
Self: Sized,
P: FnMut(Self::Item) -> Option<B>,
fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>where Self: Sized, P: FnMut(Self::Item) -> Option<B>,
1.0.0 · source§fn skip(self, n: usize) -> Skip<Self>where
Self: Sized,
fn skip(self, n: usize) -> Skip<Self>where Self: Sized,
n
elements. Read more1.0.0 · source§fn take(self, n: usize) -> Take<Self>where
Self: Sized,
fn take(self, n: usize) -> Take<Self>where Self: Sized,
n
elements, or fewer
if the underlying iterator ends sooner. Read more1.0.0 · source§fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>where
Self: Sized,
F: FnMut(&mut St, Self::Item) -> Option<B>,
fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>where Self: Sized, F: FnMut(&mut St, Self::Item) -> Option<B>,
1.0.0 · source§fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>where
Self: Sized,
U: IntoIterator,
F: FnMut(Self::Item) -> U,
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>where Self: Sized, U: IntoIterator, F: FnMut(Self::Item) -> U,
1.0.0 · source§fn inspect<F>(self, f: F) -> Inspect<Self, F>where
Self: Sized,
F: FnMut(&Self::Item),
fn inspect<F>(self, f: F) -> Inspect<Self, F>where Self: Sized, F: FnMut(&Self::Item),
1.0.0 · source§fn by_ref(&mut self) -> &mut Selfwhere
Self: Sized,
fn by_ref(&mut self) -> &mut Selfwhere Self: Sized,
1.0.0 · source§fn collect<B>(self) -> Bwhere
B: FromIterator<Self::Item>,
Self: Sized,
fn collect<B>(self) -> Bwhere B: FromIterator<Self::Item>, Self: Sized,
source§fn collect_into<E>(self, collection: &mut E) -> &mut Ewhere
E: Extend<Self::Item>,
Self: Sized,
fn collect_into<E>(self, collection: &mut E) -> &mut Ewhere E: Extend<Self::Item>, Self: Sized,
iter_collect_into
)1.0.0 · source§fn partition<B, F>(self, f: F) -> (B, B)where
Self: Sized,
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool,
fn partition<B, F>(self, f: F) -> (B, B)where Self: Sized, B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> bool,
source§fn is_partitioned<P>(self, predicate: P) -> boolwhere
Self: Sized,
P: FnMut(Self::Item) -> bool,
fn is_partitioned<P>(self, predicate: P) -> boolwhere Self: Sized, P: FnMut(Self::Item) -> bool,
iter_is_partitioned
)true
precede all those that return false
. Read more1.27.0 · source§fn try_fold<B, F, R>(&mut self, init: B, f: F) -> Rwhere
Self: Sized,
F: FnMut(B, Self::Item) -> R,
R: Try<Output = B>,
fn try_fold<B, F, R>(&mut self, init: B, f: F) -> Rwhere Self: Sized, F: FnMut(B, Self::Item) -> R, R: Try<Output = B>,
1.27.0 · source§fn try_for_each<F, R>(&mut self, f: F) -> Rwhere
Self: Sized,
F: FnMut(Self::Item) -> R,
R: Try<Output = ()>,
fn try_for_each<F, R>(&mut self, f: F) -> Rwhere Self: Sized, F: FnMut(Self::Item) -> R, R: Try<Output = ()>,
1.0.0 · source§fn fold<B, F>(self, init: B, f: F) -> Bwhere
Self: Sized,
F: FnMut(B, Self::Item) -> B,
fn fold<B, F>(self, init: B, f: F) -> Bwhere Self: Sized, F: FnMut(B, Self::Item) -> B,
1.51.0 · source§fn reduce<F>(self, f: F) -> Option<Self::Item>where
Self: Sized,
F: FnMut(Self::Item, Self::Item) -> Self::Item,
fn reduce<F>(self, f: F) -> Option<Self::Item>where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Self::Item,
source§fn try_reduce<F, R>(
&mut self,
f: F
) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryTypewhere
Self: Sized,
F: FnMut(Self::Item, Self::Item) -> R,
R: Try<Output = Self::Item>,
<R as Try>::Residual: Residual<Option<Self::Item>>,
fn try_reduce<F, R>( &mut self, f: F ) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryTypewhere Self: Sized, F: FnMut(Self::Item, Self::Item) -> R, R: Try<Output = Self::Item>, <R as Try>::Residual: Residual<Option<Self::Item>>,
iterator_try_reduce
)1.0.0 · source§fn all<F>(&mut self, f: F) -> boolwhere
Self: Sized,
F: FnMut(Self::Item) -> bool,
fn all<F>(&mut self, f: F) -> boolwhere Self: Sized, F: FnMut(Self::Item) -> bool,
1.0.0 · source§fn any<F>(&mut self, f: F) -> boolwhere
Self: Sized,
F: FnMut(Self::Item) -> bool,
fn any<F>(&mut self, f: F) -> boolwhere Self: Sized, F: FnMut(Self::Item) -> bool,
1.0.0 · source§fn find<P>(&mut self, predicate: P) -> Option<Self::Item>where
Self: Sized,
P: FnMut(&Self::Item) -> bool,
fn find<P>(&mut self, predicate: P) -> Option<Self::Item>where Self: Sized, P: FnMut(&Self::Item) -> bool,
1.30.0 · source§fn find_map<B, F>(&mut self, f: F) -> Option<B>where
Self: Sized,
F: FnMut(Self::Item) -> Option<B>,
fn find_map<B, F>(&mut self, f: F) -> Option<B>where Self: Sized, F: FnMut(Self::Item) -> Option<B>,
source§fn try_find<F, R>(
&mut self,
f: F
) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryTypewhere
Self: Sized,
F: FnMut(&Self::Item) -> R,
R: Try<Output = bool>,
<R as Try>::Residual: Residual<Option<Self::Item>>,
fn try_find<F, R>( &mut self, f: F ) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryTypewhere Self: Sized, F: FnMut(&Self::Item) -> R, R: Try<Output = bool>, <R as Try>::Residual: Residual<Option<Self::Item>>,
try_find
)1.0.0 · source§fn position<P>(&mut self, predicate: P) -> Option<usize>where
Self: Sized,
P: FnMut(Self::Item) -> bool,
fn position<P>(&mut self, predicate: P) -> Option<usize>where Self: Sized, P: FnMut(Self::Item) -> bool,
1.0.0 · source§fn max(self) -> Option<Self::Item>where
Self: Sized,
Self::Item: Ord,
fn max(self) -> Option<Self::Item>where Self: Sized, Self::Item: Ord,
1.0.0 · source§fn min(self) -> Option<Self::Item>where
Self: Sized,
Self::Item: Ord,
fn min(self) -> Option<Self::Item>where Self: Sized, Self::Item: Ord,
1.6.0 · source§fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>where
B: Ord,
Self: Sized,
F: FnMut(&Self::Item) -> B,
fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>where B: Ord, Self: Sized, F: FnMut(&Self::Item) -> B,
1.15.0 · source§fn max_by<F>(self, compare: F) -> Option<Self::Item>where
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn max_by<F>(self, compare: F) -> Option<Self::Item>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,
1.6.0 · source§fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>where
B: Ord,
Self: Sized,
F: FnMut(&Self::Item) -> B,
fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>where B: Ord, Self: Sized, F: FnMut(&Self::Item) -> B,
1.15.0 · source§fn min_by<F>(self, compare: F) -> Option<Self::Item>where
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn min_by<F>(self, compare: F) -> Option<Self::Item>where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,
1.0.0 · source§fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)where
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Sized + Iterator<Item = (A, B)>,
fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)where FromA: Default + Extend<A>, FromB: Default + Extend<B>, Self: Sized + Iterator<Item = (A, B)>,
1.36.0 · source§fn copied<'a, T>(self) -> Copied<Self>where
T: 'a + Copy,
Self: Sized + Iterator<Item = &'a T>,
fn copied<'a, T>(self) -> Copied<Self>where T: 'a + Copy, Self: Sized + Iterator<Item = &'a T>,
1.0.0 · source§fn cloned<'a, T>(self) -> Cloned<Self>where
T: 'a + Clone,
Self: Sized + Iterator<Item = &'a T>,
fn cloned<'a, T>(self) -> Cloned<Self>where T: 'a + Clone, Self: Sized + Iterator<Item = &'a T>,
source§fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>where
Self: Sized,
fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>where Self: Sized,
iter_array_chunks
)N
elements of the iterator at a time. Read more1.11.0 · source§fn sum<S>(self) -> Swhere
Self: Sized,
S: Sum<Self::Item>,
fn sum<S>(self) -> Swhere Self: Sized, S: Sum<Self::Item>,
1.11.0 · source§fn product<P>(self) -> Pwhere
Self: Sized,
P: Product<Self::Item>,
fn product<P>(self) -> Pwhere Self: Sized, P: Product<Self::Item>,
1.5.0 · source§fn cmp<I>(self, other: I) -> Orderingwhere
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord,
Self: Sized,
fn cmp<I>(self, other: I) -> Orderingwhere I: IntoIterator<Item = Self::Item>, Self::Item: Ord, Self: Sized,
source§fn cmp_by<I, F>(self, other: I, cmp: F) -> Orderingwhere
Self: Sized,
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,
fn cmp_by<I, F>(self, other: I, cmp: F) -> Orderingwhere Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,
iter_order_by
)Iterator
with those
of another with respect to the specified comparison function. Read more1.5.0 · source§fn partial_cmp<I>(self, other: I) -> Option<Ordering>where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Self: Sized,
fn partial_cmp<I>(self, other: I) -> Option<Ordering>where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,
PartialOrd
elements of
this Iterator
with those of another. The comparison works like short-circuit
evaluation, returning a result without comparing the remaining elements.
As soon as an order can be determined, the evaluation stops and a result is returned. Read moresource§fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>where
Self: Sized,
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,
fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,
iter_order_by
)Iterator
with those
of another with respect to the specified comparison function. Read more1.5.0 · source§fn eq<I>(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
Self: Sized,
fn eq<I>(self, other: I) -> boolwhere I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,
source§fn eq_by<I, F>(self, other: I, eq: F) -> boolwhere
Self: Sized,
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,
fn eq_by<I, F>(self, other: I, eq: F) -> boolwhere Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,
iter_order_by
)1.5.0 · source§fn ne<I>(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
Self: Sized,
fn ne<I>(self, other: I) -> boolwhere I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,
1.5.0 · source§fn lt<I>(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Self: Sized,
fn lt<I>(self, other: I) -> boolwhere I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,
Iterator
are lexicographically
less than those of another. Read more1.5.0 · source§fn le<I>(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Self: Sized,
fn le<I>(self, other: I) -> boolwhere I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,
Iterator
are lexicographically
less or equal to those of another. Read more1.5.0 · source§fn gt<I>(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Self: Sized,
fn gt<I>(self, other: I) -> boolwhere I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,
Iterator
are lexicographically
greater than those of another. Read more1.5.0 · source§fn ge<I>(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Self: Sized,
fn ge<I>(self, other: I) -> boolwhere I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,
Iterator
are lexicographically
greater than or equal to those of another. Read moresource§fn is_sorted(self) -> boolwhere
Self: Sized,
Self::Item: PartialOrd<Self::Item>,
fn is_sorted(self) -> boolwhere Self: Sized, Self::Item: PartialOrd<Self::Item>,
is_sorted
)source§fn is_sorted_by<F>(self, compare: F) -> boolwhere
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,
fn is_sorted_by<F>(self, compare: F) -> boolwhere Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,
is_sorted
)source§fn is_sorted_by_key<F, K>(self, f: F) -> boolwhere
Self: Sized,
F: FnMut(Self::Item) -> K,
K: PartialOrd<K>,
fn is_sorted_by_key<F, K>(self, f: F) -> boolwhere Self: Sized, F: FnMut(Self::Item) -> K, K: PartialOrd<K>,
is_sorted
)