Struct Slice

impl<T> Slice<T>

const fn new<'a>() -> &'a Self

Returns an empty slice.

const fn len(&self) -> usize

Return the number of elements in the set slice.

const fn is_empty(&self) -> bool

Returns true if the set slice contains no elements.

fn get_index(&self, index: usize) -> Option<&T>

Get a value by index.

Valid indices are 0 <= index < self.len().

fn get_range<R: RangeBounds<usize>>(&self, range: R) -> Option<&Self>

Returns a slice of values in the given range of indices.

Valid indices are 0 <= index < self.len().

const fn first(&self) -> Option<&T>

Get the first value.

const fn last(&self) -> Option<&T>

Get the last value.

const fn split_at(&self, index: usize) -> (&Self, &Self)

Divides one slice into two at an index.

Panics if index > len. For a non-panicking alternative see [split_at_checked][Self::split_at_checked].

const fn split_at_checked(&self, index: usize) -> Option<(&Self, &Self)>

Divides one slice into two at an index.

Returns None if index > len.

const fn split_first(&self) -> Option<(&T, &Self)>

Returns the first value and the rest of the slice, or None if it is empty.

const fn split_last(&self) -> Option<(&T, &Self)>

Returns the last value and the rest of the slice, or None if it is empty.

fn iter(&self) -> Iter<'_, T>

Return an iterator over the values of the set slice.

fn binary_search(&self, x: &T) -> Result<usize, usize>
where
    T: Ord,

Search over a sorted set for a value.

Returns the position where that value is present, or the position where it can be inserted to maintain the sort. See slice::binary_search for more details.

Computes in O(log(n)) time, which is notably less scalable than looking the value up in the set this is a slice from using IndexSet::get_index_of, but this can also position missing values.

fn binary_search_by<'a, F>(&'a self, f: F) -> Result<usize, usize>
where
    F: FnMut(&'a T) -> Ordering,

Search over a sorted set with a comparator function.

Returns the position where that value is present, or the position where it can be inserted to maintain the sort. See slice::binary_search_by for more details.

Computes in O(log(n)) time.

fn binary_search_by_key<'a, B, F>(&'a self, b: &B, f: F) -> Result<usize, usize>
where
    F: FnMut(&'a T) -> B,
    B: Ord,

Search over a sorted set with an extraction function.

Returns the position where that value is present, or the position where it can be inserted to maintain the sort. See slice::binary_search_by_key for more details.

Computes in O(log(n)) time.

fn is_sorted(&self) -> bool
where
    T: PartialOrd,

Checks if the values of this slice are sorted.

fn is_sorted_by<'a, F>(&'a self, cmp: F) -> bool
where
    F: FnMut(&'a T, &'a T) -> bool,

Checks if this slice is sorted using the given comparator function.

fn is_sorted_by_key<'a, F, K>(&'a self, sort_key: F) -> bool
where
    F: FnMut(&'a T) -> K,
    K: PartialOrd,

Checks if this slice is sorted using the given sort-key function.

fn partition_point<P>(&self, pred: P) -> usize
where
    P: FnMut(&T) -> bool,

Returns the index of the partition point of a sorted set according to the given predicate (the index of the first element of the second partition).

See slice::partition_point for more details.

Computes in O(log(n)) time.