Struct RangeIter 

pub struct RangeIter<'a, 'g, P, A>
where
    P: LeafPolicy,
    A: TreeAllocator<P>,
{ /* private fields */ }

Iterator over a key range in a crate::MassTree.

Yields entries in lexicographic key order. The iterator maintains internal state for the scan position and handles concurrent modifications via the optimistic concurrency control protocol.

Implements both Iterator and DoubleEndedIterator, allowing forward iteration with next() and reverse iteration with next_back() or .rev().

Thread Safety

The iterator holds a reference to the tree and the guard. The guard must remain alive for the duration of iteration to protect pointers from garbage collection.

Consistency

Range scans are weakly consistent:

• Keys are yielded in sorted order
• May see some concurrent inserts and miss others
• No torn reads (partial key/value data)
• Duplicates filtered via cursor key tracking (may rarely occur under extreme contention)

Performance

The iterator allocates:

• Vec<u8> for each key (unavoidable for owned keys)
• SmallVec for layer stack (usually inline, up to 4 layers)
• No per-item allocation for value cloning (Arc refcount bump or Copy)

For higher performance, use the batch methods: for_each, for_each_ref, or for_each_intra_leaf_batch_ref.

Example

let guard = tree.guard();
let mut count = 0;

for entry in tree.range(
    RangeBound::Included(b"prefix:"),
    RangeBound::Excluded(b"prefix;"), // ';' is after ':' in ASCII
    &guard
) {
    count += 1;
}

println!("Found {} entries", count);

Implementations

impl<P, A> RangeIter<'_, '_, P, A>

where P: LeafPolicy, A: TreeAllocator<P>,

pub fn for_each<F>(self, visitor: F) -> usize

where F: FnMut(&[u8], P::Output) -> bool,

Zero-allocation iteration with a visitor closure.

This is significantly faster than the Iterator trait because it:

• Avoids allocating Vec<u8> for each key
• Uses references directly from internal buffers

Arguments

• visitor: Closure receiving (&[u8], P::Output). Return true to continue, false to stop early.

Returns

Number of entries visited.

pub fn for_each_ref<F>(self, visitor: F) -> usize

where P: RefLeafPolicy, F: FnMut(&[u8], &P::Value) -> bool,

Zero-copy iteration with borrowed value references.

Unlike Self::for_each which clones values (Arc increment for LeafValue), this returns &P::Value references tied to the guard lifetime.

Arguments

• visitor: Closure receiving (&[u8], &P::Value). Return true to continue, false to stop early.

Returns

Number of entries visited.

Lifetime Guarantees

References are borrowed from internal buffers and protected by the guard. The closure signature prevents storing them beyond the callback scope.

pub fn for_each_batch_ref<F>(self, visitor: F) -> usize

where P: RefLeafPolicy, F: FnMut(&[u8], &P::Value) -> bool,

Batch iteration with zero-copy value references and reduced dispatch overhead.

This is the highest-performance iteration method. It eliminates state machine dispatch overhead while maintaining identical correctness to Self::for_each_ref.

Correctness

Unlike approaches that validate only once per leaf, this method:

• Uses per-entry OCC validation (same as for_each_ref)
• Properly updates cursor key for duplicate filtering
• Handles layer transitions correctly (dynamically switches from single-layer to multi-layer mode when Down is encountered)

Arguments

• visitor: Closure receiving (&[u8], &P::Value). Return true to continue.

Returns

Number of entries visited.

pub fn for_each_intra_leaf_batch_ref<F>(self, visitor: F) -> usize

where P: RefLeafPolicy, F: FnMut(&[u8], &P::Value) -> bool,

Intra-leaf batch iteration with maximum performance.

This is the highest-performance iteration method. It processes entire leaves in tight loops, minimizing per-entry overhead.

Performance Characteristics

• Processes all entries in a leaf before moving to next leaf
• Amortized OCC validation overhead (validates once, processes batch)
• No function call overhead per entry within a leaf
• Falls back to state machine for layer transitions

Arguments

• visitor: Closure receiving (&[u8], &P::Value). Return true to continue.

Returns

Number of entries visited.

pub fn for_each_intra_leaf_batch<F>(self, visitor: F) -> usize

where F: FnMut(&[u8], P::Output) -> bool,

Intra-leaf batch iteration returning values by copy.

This is the variant of Self::for_each_intra_leaf_batch_ref that works for ALL LeafPolicy types, including true-inline storage. Instead of returning &P::Value references, it returns P::Output by value.

Performance Characteristics

Same optimizations as for_each_intra_leaf_batch_ref:

• Processes all entries in a leaf before moving to next leaf
• Amortized OCC validation overhead (validates once, processes batch)
• No function call overhead per entry within a leaf
• Falls back to state machine for layer transitions

Use Cases

• True-inline storage: Required since inline values cannot be returned by reference
• Copy types: When cloning is cheap (integers, small structs)
• Arc storage: Works but incurs refcount operations per entry

For Arc-based storage where zero-copy matters, prefer for_each_intra_leaf_batch_ref.

Arguments

• visitor: Closure receiving (&[u8], P::Output). Return true to continue.

Returns

Number of entries visited.

pub fn for_each_values_batch<F>(self, visitor: F) -> usize

where F: FnMut(P::Output) -> bool,

Highest-performance value-only batch iteration (no key materialization).

This is the fastest scan method when you only need values. Keys are not built or copied, saving up to 56 bytes of copying per entry for long keys.

End Bound Behavior

• Unbounded: Exact (scans all entries)
• Included/Excluded: Approximate for keys with suffix

For bounded scans, the end check uses ikey comparison only. This means:

• Keys where ikey < bound_ikey: correctly included
• Keys where ikey > bound_ikey: correctly excluded
• Keys where ikey == bound_ikey: may over-include entries

If you need exact end bounds with long keys, use for_each_intra_leaf_batch.

Arguments

• visitor: Closure receiving P::Output. Return true to continue.

Returns

Number of entries visited.

Example

use masstree::MassTree;
let tree: MassTree<u64> = MassTree::new();
let guard = tree.guard();
let mut sum = 0u64;
tree.iter(&guard).for_each_values_batch(|value| {
    sum += value; // value is u64 directly (MassTree uses inline storage)
    true
});

pub fn try_for_each_ref<F, E>(self, visitor: F) -> Result<usize, E>

where P: RefLeafPolicy, F: FnMut(&[u8], &P::Value) -> Result<bool, E>,

Fallible iteration with zero-copy value references.

Like Self::for_each_ref, but the visitor can return an error to stop iteration early. This is useful when processing entries might fail (e.g., serialization, validation, I/O).

Arguments

• visitor: Closure receiving (&[u8], &P::Value). Return Ok(true) to continue, Ok(false) to stop early, or Err(E) to stop with an error.

Returns

• Ok(count): Number of entries successfully visited
• Err(e): The error returned by the visitor

Example

let result = tree.iter(&guard).try_for_each_ref(|key, value| {
    if key.len() > MAX_KEY_LEN {
        return Err(ValidationError::KeyTooLong);
    }
    writer.write_entry(key, value)?;
    Ok(true)
});

match result {
    Ok(count) => println!("Wrote {} entries", count),
    Err(e) => eprintln!("Failed: {}", e),
}

Errors

Returns an error if the visitor returns an error.

impl<P, A> RangeIter<'_, '_, P, A>

where P: LeafPolicy, A: TreeAllocator<P>,

pub fn rev_for_each_ref<F>(self, visitor: F) -> usize

where P: RefLeafPolicy, F: FnMut(&[u8], &P::Value) -> bool,

High-performance reverse iteration with zero-copy references.

This is the fastest reverse iteration method. It processes entire leaves in tight loops, minimizing per-entry overhead.

Performance Characteristics

• Processes all entries in a leaf before moving to previous leaf
• Single OCC validation per leaf
• No function call overhead per entry within a leaf
• Falls back to state machine for layer transitions

Arguments

• visitor: Closure receiving (&[u8], &P::Value). Return true to continue.

Returns

Number of entries visited.

pub fn rev_for_each_intra_leaf_batch<F>(self, visitor: F) -> usize

where F: FnMut(&[u8], P::Output) -> bool,

Highest-performance batch-optimized reverse iteration (value by copy).

This is the non-reference variant that works with ALL storage types including true-inline (MassTree15Inline). Unlike rev_for_each_ref which returns &P::Value references, this returns P::Output by value.

Performance Characteristics

• Processes all entries in a leaf before moving to previous leaf
• Single OCC validation per leaf
• No function call overhead per entry within a leaf
• Falls back to state machine for layer transitions

Availability

Available for ALL storage types:

• MassTree15<V> (Box-based)
• MassTree15Inline<V> (true-inline)

Arguments

• visitor: Callback function fn(&[u8], P::Output) -> bool

Returns

Number of entries visited.

pub fn rev_for_each_values_batch<F>(self, visitor: F) -> usize

where F: FnMut(P::Output) -> bool,

Highest-performance reverse value-only batch iteration (no key materialization).

This is the fastest reverse scan method when you only need values. Keys are not built or copied, saving up to 56 bytes of copying per entry for long keys.

Performance

For 64-byte keys: ~1.5-2x faster than rev_for_each_intra_leaf_batch when the visitor would ignore the key parameter anyway.

Start Bound Behavior (Reverse Iteration)

• Unbounded: Exact (scans all entries)
• Included/Excluded: Approximate for keys with suffix

For bounded scans, the start check uses ikey comparison only. This means:

• Keys where ikey > bound_ikey: correctly included
• Keys where ikey < bound_ikey: correctly excluded
• Keys where ikey == bound_ikey: may over-include entries

If you need exact start bounds with long keys, use rev_for_each_intra_leaf_batch.

Arguments

• visitor: Closure receiving P::Output. Return true to continue.

Returns

Number of entries visited.

impl<'a, 'g, P, A> RangeIter<'a, 'g, P, A>

where P: LeafPolicy, A: TreeAllocator<P>,

pub const fn keys(self) -> KeysIter<'a, 'g, P, A>

Convert to a keys-only iterator.

pub const fn values(self) -> ValuesIter<'a, 'g, P, A>

Convert to a values-only iterator.

Trait Implementations

impl<P, A> Debug for RangeIter<'_, '_, P, A>

where P: LeafPolicy, A: TreeAllocator<P>,

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

Formats the value using the given formatter.

impl<P, A> DoubleEndedIterator for RangeIter<'_, '_, P, A>

where P: LeafPolicy, A: TreeAllocator<P>,

fn next_back(&mut self) -> Option<Self::Item>

Removes and returns an element from the end of the iterator.

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

🔬This is a nightly-only experimental API. (iter_advance_by)

Advances the iterator from the back by n elements.

fn nth_back(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element from the end of the iterator.

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

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

This is the reverse version of Iterator::try_fold(): it takes elements starting from the back of the iterator.

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

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

An iterator method that reduces the iterator’s elements to a single, final value, starting from the back.

fn rfind<P>(&mut self, predicate: P) -> Option<Self::Item>

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

Searches for an element of an iterator from the back that satisfies a predicate.

impl<P, A> Iterator for RangeIter<'_, '_, P, A>

where P: LeafPolicy, A: TreeAllocator<P>,

type Item = ScanEntry<<P as LeafPolicy>::Output>

The type of the elements being iterated over.

fn next(&mut self) -> Option<Self::Item>

Advances the iterator and returns the next value.

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

Returns the bounds on the remaining length of the iterator.

fn next_chunk<const N: usize>( &mut self, ) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>

where Self: Sized,

🔬This is a nightly-only experimental API. (iter_next_chunk)

Advances the iterator and returns an array containing the next N values.

fn count(self) -> usize

where Self: Sized,

Consumes the iterator, counting the number of iterations and returning it.

fn last(self) -> Option<Self::Item>

where Self: Sized,

Consumes the iterator, returning the last element.

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

🔬This is a nightly-only experimental API. (iter_advance_by)

Advances the iterator by n elements.

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

Returns the nth element of the iterator.

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

where Self: Sized,

Creates an iterator starting at the same point, but stepping by the given amount at each iteration.

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>

where Self: Sized, U: IntoIterator<Item = Self::Item>,

Takes two iterators and creates a new iterator over both in sequence.

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>

where Self: Sized, U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs.

fn intersperse(self, separator: Self::Item) -> Intersperse<Self>

where Self: Sized, Self::Item: Clone,

🔬This is a nightly-only experimental API. (iter_intersperse)

Creates a new iterator which places a copy of separator between adjacent items of the original iterator.

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

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

🔬This is a nightly-only experimental API. (iter_intersperse)

Creates a new iterator which places an item generated by separator between adjacent items of the original iterator.

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

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

Takes a closure and creates an iterator which calls that closure on each element.

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

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

Calls a closure on each element of an iterator.

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

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

Creates an iterator which uses a closure to determine if an element should be yielded.

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

where Self: Sized, F: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both filters and maps.

fn enumerate(self) -> Enumerate<Self>

where Self: Sized,

Creates an iterator which gives the current iteration count as well as the next value.

fn peekable(self) -> Peekable<Self>

where Self: Sized,

Creates an iterator which can use the peek and peek_mut methods to look at the next element of the iterator without consuming it. See their documentation for more information.

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

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

Creates an iterator that skips elements based on a predicate.

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

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

Creates an iterator that yields elements based on a predicate.

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

where Self: Sized, P: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both yields elements based on a predicate and maps.

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

where Self: Sized,

Creates an iterator that skips the first n elements.

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

where Self: Sized,

Creates an iterator that yields the first n elements, or fewer if the underlying iterator ends sooner.

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>,

An iterator adapter which, like fold, holds internal state, but unlike fold, produces a new iterator.

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>

where Self: Sized, U: IntoIterator, F: FnMut(Self::Item) -> U,

Creates an iterator that works like map, but flattens nested structure.

fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>

where Self: Sized, F: FnMut(&[Self::Item; N]) -> R,

🔬This is a nightly-only experimental API. (iter_map_windows)

Calls the given function f for each contiguous window of size N over self and returns an iterator over the outputs of f. Like slice::windows(), the windows during mapping overlap as well.

fn fuse(self) -> Fuse<Self>

where Self: Sized,

Creates an iterator which ends after the first None.

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

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

Does something with each element of an iterator, passing the value on.

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

where Self: Sized,

Creates a “by reference” adapter for this instance of Iterator.

fn collect<B>(self) -> B

where B: FromIterator<Self::Item>, Self: Sized,

Transforms an iterator into a collection.

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

where E: Extend<Self::Item>, Self: Sized,

🔬This is a nightly-only experimental API. (iter_collect_into)

Collects all the items from an iterator into a collection.

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

where Self: Sized, B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> bool,

Consumes an iterator, creating two collections from it.

fn partition_in_place<'a, T, P>(self, predicate: P) -> usize

where T: 'a, Self: Sized + DoubleEndedIterator<Item = &'a mut T>, P: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (iter_partition_in_place)

Reorders the elements of this iterator in-place according to the given predicate, such that all those that return true precede all those that return false. Returns the number of true elements found.

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

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

🔬This is a nightly-only experimental API. (iter_is_partitioned)

Checks if the elements of this iterator are partitioned according to the given predicate, such that all those that return true precede all those that return false.

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

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

An iterator method that applies a function as long as it returns successfully, producing a single, final value.

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

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

An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error.

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

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

Folds every element into an accumulator by applying an operation, returning the final result.

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

where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Self::Item,

Reduces the elements to a single one, by repeatedly applying a reducing operation.

fn try_reduce<R>( &mut self, f: impl FnMut(Self::Item, Self::Item) -> R, ) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType

where Self: Sized, R: Try<Output = Self::Item>, <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (iterator_try_reduce)

Reduces the elements to a single one by repeatedly applying a reducing operation. If the closure returns a failure, the failure is propagated back to the caller immediately.

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

where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate.

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

where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if any element of the iterator matches a predicate.

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

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

Searches for an element of an iterator that satisfies a predicate.

fn find_map<B, F>(&mut self, f: F) -> Option<B>

where Self: Sized, F: FnMut(Self::Item) -> Option<B>,

Applies function to the elements of iterator and returns the first non-none result.

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

where Self: Sized, R: Try<Output = bool>, <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (try_find)

Applies function to the elements of iterator and returns the first true result or the first error.

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

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

Searches for an element in an iterator, returning its index.

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

where B: Ord, Self: Sized, F: FnMut(&Self::Item) -> B,

Returns the element that gives the maximum value from the specified function.

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

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the maximum value with respect to the specified comparison function.

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

where B: Ord, Self: Sized, F: FnMut(&Self::Item) -> B,

Returns the element that gives the minimum value from the specified function.

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

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the minimum value with respect to the specified comparison function.

fn rev(self) -> Rev<Self>

where Self: Sized + DoubleEndedIterator,

Reverses an iterator’s direction.

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)

where FromA: Default + Extend<A>, FromB: Default + Extend<B>, Self: Sized + Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers.

fn copied<'a, T>(self) -> Copied<Self>

where T: Copy + 'a, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements.

fn cloned<'a, T>(self) -> Cloned<Self>

where T: Clone + 'a, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements.

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>

where Self: Sized,

🔬This is a nightly-only experimental API. (iter_array_chunks)

Returns an iterator over N elements of the iterator at a time.

fn sum<S>(self) -> S

where Self: Sized, S: Sum<Self::Item>,

Sums the elements of an iterator.

fn product<P>(self) -> P

where Self: Sized, P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements

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

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,

🔬This is a nightly-only experimental API. (iter_order_by)

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

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

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Lexicographically compares the 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.

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>,

🔬This is a nightly-only experimental API. (iter_order_by)

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

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

where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are equal to those of another.

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

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_order_by)

Determines if the elements of this Iterator are equal to those of another with respect to the specified equality function.

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

where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are not equal to those of another.

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

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically less than those of another.

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

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically less or equal to those of another.

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

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically greater than those of another.

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

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically greater than or equal to those of another.

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

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> bool,

Checks if the elements of this iterator are sorted using the given comparator function.

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

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

Checks if the elements of this iterator are sorted using the given key extraction function.

impl<P, A> FusedIterator for RangeIter<'_, '_, P, A>

where P: LeafPolicy, A: TreeAllocator<P>,