Struct tranche::BasedTranche

pub struct BasedTranche<'a, T> { /* fields omitted */ }

A based tranche of T.

Based tranches are just like tranches, with the addition of an offset method which returns how many items were taken from the front of the original based tranche returned from BasedTranche::new.

Methods

impl<'a, T> BasedTranche<'a, T>

pub fn new(slice: &'a impl AsRef<[T]>) -> Self

Creates a new based tranche of T.

Examples

let parisien = BasedTranche::new(&[
    "baguette",
    "jambon",
    "beurre",
]);

pub fn len(&self) -> usize

Returns the number of elements in the tranche.

Examples

let a = BasedTranche::new(&[1, 2, 3]);
assert_eq!(a.len(), 3);

pub fn is_empty(&self) -> bool

Returns true if the tranche has a length of 0.

Examples

let a = BasedTranche::new(&[1, 2, 3]);
assert!(!a.is_empty());

pub fn offset(&self) -> usize

Returns the starting offset of this based tranche.

pub fn take_first(&mut self) -> Result<&'a T, UnexpectedEndError>

Takes the first element out of the tranche.

Returns the first element of self, or Err(_) if it is empty.

Examples

let mut v = BasedTranche::new(&[10, 40, 30]);
assert_eq!(v.take_first().unwrap(), &10);
assert_eq!(v.as_slice(), &[40, 30]);

let mut w = <BasedTranche<i32>>::new(&[]);
let err = w.take_first().unwrap_err();
assert_eq!(err.needed(), 1);
assert_eq!(err.len(), 0);

pub fn take_front(&mut self, n: usize) -> Result<Self, UnexpectedEndError>

Takes the first n elements out of the tranche.

Returns a new tranche with the first n elements of self, or Err(_) if it is not long enough.

Examples

let mut v = BasedTranche::new(&[10, 40, 30]);
assert_eq!(v.take_front(2).unwrap().as_slice(), &[10, 40]);
assert_eq!(v.as_slice(), &[30]);

let err = v.take_front(3).unwrap_err();
assert_eq!(err.needed(), 3);
assert_eq!(err.len(), 1);

pub fn as_slice(&self) -> &'a [T]

Views the tranche's buffer as a slice.

This has the same lifetime as the original buffer, and so the tranche can continue to be used while this exists.

Examples

let mut tranche = BasedTranche::new(&[1, 2, 3]);
assert_eq!(tranche.as_slice(), &[1, 2, 3]);

assert!(tranche.take_first().is_ok());
assert_eq!(tranche.as_slice(), &[2, 3]);

pub const fn as_ptr(&self) -> *const T

Returns a raw pointer to the tranche's buffer.

Examples

let tranche = BasedTranche::new(&[1, 2, 3]);
let ptr = tranche.as_ptr();

impl<'a> BasedTranche<'a, u8>

pub fn take_front_as<T>(
    &mut self,
    n: usize
) -> Result<Tranche<'a, T>, UnexpectedEndError> where
    T: AlwaysAligned + AlwaysValid + Immutable, 

impl<'_> BasedTranche<'a, u8>

pub fn take_u8(&mut self) -> Result<u8, UnexpectedEndError>

Takes the first u8 out of the tranche.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_i8(&mut self) -> Result<i8, UnexpectedEndError>

Takes the first i8 out of the tranche.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_u16_ne(&mut self) -> Result<u16, UnexpectedEndError>

Returns a u16 by taking the first mem::size_of::<u16>() bytes out of the tranche in native endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_u16_le(&mut self) -> Result<u16, UnexpectedEndError>

Returns a u16 by taking the first mem::size_of::<u16>() bytes out of the tranche in little endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_u16_be(&mut self) -> Result<u16, UnexpectedEndError>

Returns a u16 by taking the first mem::size_of::<u16>() bytes out of the tranche in big endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_i16_ne(&mut self) -> Result<i16, UnexpectedEndError>

Returns a i16 by taking the first mem::size_of::<i16>() bytes out of the tranche in native endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_i16_le(&mut self) -> Result<i16, UnexpectedEndError>

Returns a i16 by taking the first mem::size_of::<i16>() bytes out of the tranche in little endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_i16_be(&mut self) -> Result<i16, UnexpectedEndError>

Returns a i16 by taking the first mem::size_of::<i16>() bytes out of the tranche in big endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_u32_ne(&mut self) -> Result<u32, UnexpectedEndError>

Returns a u32 by taking the first mem::size_of::<u32>() bytes out of the tranche in native endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_u32_le(&mut self) -> Result<u32, UnexpectedEndError>

Returns a u32 by taking the first mem::size_of::<u32>() bytes out of the tranche in little endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_u32_be(&mut self) -> Result<u32, UnexpectedEndError>

Returns a u32 by taking the first mem::size_of::<u32>() bytes out of the tranche in big endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_i32_ne(&mut self) -> Result<i32, UnexpectedEndError>

Returns a i32 by taking the first mem::size_of::<i32>() bytes out of the tranche in native endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_i32_le(&mut self) -> Result<i32, UnexpectedEndError>

Returns a i32 by taking the first mem::size_of::<i32>() bytes out of the tranche in little endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_i32_be(&mut self) -> Result<i32, UnexpectedEndError>

Returns a i32 by taking the first mem::size_of::<i32>() bytes out of the tranche in big endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_u64_ne(&mut self) -> Result<u64, UnexpectedEndError>

Returns a u64 by taking the first mem::size_of::<u64>() bytes out of the tranche in native endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_u64_le(&mut self) -> Result<u64, UnexpectedEndError>

Returns a u64 by taking the first mem::size_of::<u64>() bytes out of the tranche in little endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_u64_be(&mut self) -> Result<u64, UnexpectedEndError>

Returns a u64 by taking the first mem::size_of::<u64>() bytes out of the tranche in big endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_i64_ne(&mut self) -> Result<i64, UnexpectedEndError>

Returns a i64 by taking the first mem::size_of::<i64>() bytes out of the tranche in native endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_i64_le(&mut self) -> Result<i64, UnexpectedEndError>

Returns a i64 by taking the first mem::size_of::<i64>() bytes out of the tranche in little endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_i64_be(&mut self) -> Result<i64, UnexpectedEndError>

Returns a i64 by taking the first mem::size_of::<i64>() bytes out of the tranche in big endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_u128_ne(&mut self) -> Result<u128, UnexpectedEndError>

Returns a u128 by taking the first mem::size_of::<u128>() bytes out of the tranche in native endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_u128_le(&mut self) -> Result<u128, UnexpectedEndError>

Returns a u128 by taking the first mem::size_of::<u128>() bytes out of the tranche in little endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_u128_be(&mut self) -> Result<u128, UnexpectedEndError>

Returns a u128 by taking the first mem::size_of::<u128>() bytes out of the tranche in big endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_i128_ne(&mut self) -> Result<i128, UnexpectedEndError>

Returns a i128 by taking the first mem::size_of::<i128>() bytes out of the tranche in native endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_i128_le(&mut self) -> Result<i128, UnexpectedEndError>

Returns a i128 by taking the first mem::size_of::<i128>() bytes out of the tranche in little endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_i128_be(&mut self) -> Result<i128, UnexpectedEndError>

Returns a i128 by taking the first mem::size_of::<i128>() bytes out of the tranche in big endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_usize_ne(&mut self) -> Result<usize, UnexpectedEndError>

Returns a usize by taking the first mem::size_of::<usize>() bytes out of the tranche in native endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_usize_le(&mut self) -> Result<usize, UnexpectedEndError>

Returns a usize by taking the first mem::size_of::<usize>() bytes out of the tranche in little endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_usize_be(&mut self) -> Result<usize, UnexpectedEndError>

Returns a usize by taking the first mem::size_of::<usize>() bytes out of the tranche in big endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_isize_ne(&mut self) -> Result<isize, UnexpectedEndError>

Returns a isize by taking the first mem::size_of::<isize>() bytes out of the tranche in native endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_isize_le(&mut self) -> Result<isize, UnexpectedEndError>

Returns a isize by taking the first mem::size_of::<isize>() bytes out of the tranche in little endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

pub fn take_isize_be(&mut self) -> Result<isize, UnexpectedEndError>

Returns a isize by taking the first mem::size_of::<isize>() bytes out of the tranche in big endian order.

The internal offset is incremented accordingly.

Returns Err(_) if self is not long enough.

Trait Implementations

impl<'_, T> Clone for BasedTranche<'_, T>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'_, T> Debug for BasedTranche<'_, T> where
    T: Debug, 

fn fmt(&self, fmt: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<'_, T> Default for BasedTranche<'_, T>

fn default() -> Self

Returns the "default value" for a type.

impl<'_, T> ExactSizeIterator for BasedTranche<'_, T>

fn len(&self) -> usize

Returns the exact length of the iterator.

fn is_empty(&self) -> bool

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

Returns true if the iterator is empty.

impl<'a, T> From<BasedTranche<'a, T>> for Tranche<'a, T>

fn from(based_tranche: BasedTranche<'a, T>) -> Self

Performs the conversion.

impl<'a, T> From<Tranche<'a, T>> for BasedTranche<'a, T>

fn from(tranche: Tranche<'a, T>) -> Self

Performs the conversion.

impl<'_, T> FusedIterator for BasedTranche<'_, T>

impl<'a, T> Iterator for BasedTranche<'a, T>

type Item = &'a T

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 count(self) -> usize

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

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

Consumes the iterator, returning the last element.

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

Returns the nth element of the iterator.

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

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
    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
    U: IntoIterator, 

'Zips up' two iterators into a single iterator of pairs.

fn map<B, F>(self, f: F) -> Map<Self, F> where
    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
    F: FnMut(Self::Item), 

Calls a closure on each element of an iterator.

fn filter<P>(self, predicate: P) -> Filter<Self, P> where
    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
    F: FnMut(Self::Item) -> Option<B>, 

Creates an iterator that both filters and maps.

fn enumerate(self) -> Enumerate<Self>

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

fn peekable(self) -> Peekable<Self>

Creates an iterator which can use peek to look at the next element of the iterator without consuming it.

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
    P: FnMut(&Self::Item) -> bool, 

Creates an iterator that [skip]s elements based on a predicate.

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
    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
    P: FnMut(Self::Item) -> Option<B>, 

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

recently added

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

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

Creates an iterator that skips the first n elements.

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

Creates an iterator that yields its first n elements.

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
    F: FnMut(&mut St, Self::Item) -> Option<B>, 

An iterator adaptor similar to [fold] that holds internal state and produces a new iterator.

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
    F: FnMut(Self::Item) -> U,
    U: IntoIterator, 

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

fn flatten(self) -> Flatten<Self> where
    Self::Item: IntoIterator, 

Creates an iterator that flattens nested structure.

fn fuse(self) -> Fuse<Self>

Creates an iterator which ends after the first [None].

fn inspect<F>(self, f: F) -> Inspect<Self, F> where
    F: FnMut(&Self::Item), 

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

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

Borrows an iterator, rather than consuming it.

#[must_use = "if you really need to exhaust the iterator, consider `.for_each(drop)` instead"]fn collect<B>(self) -> B where
    B: FromIterator<Self::Item>, 

Transforms an iterator into a collection.

fn partition<B, F>(self, f: F) -> (B, B) where
    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
    P: FnMut(&T) -> bool,
    Self: DoubleEndedIterator<Item = &'a mut T>,
    T: 'a, 

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

new API

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
    P: FnMut(Self::Item) -> bool, 

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

new API

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
    F: FnMut(B, Self::Item) -> R,
    R: Try<Ok = 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
    F: FnMut(Self::Item) -> R,
    R: Try<Ok = ()>, 

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
    F: FnMut(B, Self::Item) -> B, 

An iterator method that applies a function, producing a single, final value.

fn fold_first<F>(self, f: F) -> Option<Self::Item> where
    F: FnMut(Self::Item, Self::Item) -> Self::Item, 

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

The same as fold(), but uses the first element in the iterator as the initial value, folding every subsequent element into it. If the iterator is empty, return None; otherwise, return the result of the fold.

fn all<F>(&mut self, f: F) -> bool where
    F: FnMut(Self::Item) -> bool, 

Tests if every element of the iterator matches a predicate.

fn any<F>(&mut self, f: F) -> bool where
    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
    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
    F: FnMut(Self::Item) -> Option<B>, 

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

fn try_find<F, E, R>(&mut self, f: F) -> Result<Option<Self::Item>, E> where
    F: FnMut(&Self::Item) -> R,
    R: Try<Ok = bool, Error = E>, 

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

new API

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

fn position<P>(&mut self, predicate: P) -> Option<usize> where
    P: FnMut(Self::Item) -> bool, 

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

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
    P: FnMut(Self::Item) -> bool,
    Self: ExactSizeIterator + DoubleEndedIterator, 

Searches for an element in an iterator from the right, returning its index.

fn max(self) -> Option<Self::Item> where
    Self::Item: Ord, 

Returns the maximum element of an iterator.

fn min(self) -> Option<Self::Item> where
    Self::Item: Ord, 

Returns the minimum element of an iterator.

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where
    B: Ord,
    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
    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,
    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
    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: 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: Iterator<Item = (A, B)>, 

Converts an iterator of pairs into a pair of containers.

fn copied<'a, T>(self) -> Copied<Self> where
    Self: Iterator<Item = &'a T>,
    T: 'a + Copy, 

Creates an iterator which copies all of its elements.

fn cloned<'a, T>(self) -> Cloned<Self> where
    Self: Iterator<Item = &'a T>,
    T: 'a + Clone, 

Creates an iterator which [clone]s all of its elements.

fn cycle(self) -> Cycle<Self> where
    Self: Clone, 

Repeats an iterator endlessly.

fn sum<S>(self) -> S where
    S: Sum<Self::Item>, 

Sums the elements of an iterator.

fn product<P>(self) -> P where
    P: Product<Self::Item>, 

Iterates over the entire iterator, multiplying all the elements

fn cmp<I>(self, other: I) -> Ordering where
    I: IntoIterator<Item = Self::Item>,
    Self::Item: Ord, 

Lexicographically compares the elements of this Iterator with those of another.

fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering where
    F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,
    I: IntoIterator, 

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

Lexicographically compares the elements of this Iterator with those of another.

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering> where
    F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,
    I: IntoIterator, 

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

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
    F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,
    I: IntoIterator, 

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

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

fn lt<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

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

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

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

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

fn is_sorted(self) -> bool where
    Self::Item: PartialOrd<Self::Item>, 

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

new API

Checks if the elements of this iterator are sorted.

fn is_sorted_by<F>(self, compare: F) -> bool where
    F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>, 

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

new API

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
    F: FnMut(Self::Item) -> K,
    K: PartialOrd<K>, 

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

new API

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

impl<'_, T> Send for BasedTranche<'_, T> where
    T: Sync, 

impl<'_, T> Sync for BasedTranche<'_, T> where
    T: Sync,