Struct Slice

pub struct Slice<'a, A, const N: usize> { /* private fields */ }

An indexable representation of a subset of a RingBuffer.

Implementations

impl<'a, A: 'a, const N: usize> Slice<'a, A, N>

pub unsafe fn get_unchecked(&self, index: usize) -> &A

Get an unchecked reference to the value at the given index.

Safety

You must ensure the index is not out of bounds.

pub fn iter(&self) -> Iter<'_, A, N>

Get an iterator over references to the items in the slice in order.

pub fn slice<R: RangeBounds<usize>>(self, range: R) -> Slice<'a, A, N>

Create a subslice of this slice.

This consumes the slice. To create a subslice without consuming it, clone it first: my_slice.clone().slice(1..2).

pub fn split_at(self, index: usize) -> (Slice<'a, A, N>, Slice<'a, A, N>)

Split the slice into two subslices at the given index.

pub fn to_owned(&self) -> RingBuffer<A, N>

where A: Clone,

Construct a new RingBuffer by copying the elements in this slice.

Trait Implementations

impl<'a, A: 'a, const N: usize> Array for Slice<'a, A, N>

fn get(&self, index: usize) -> Option<&A>

Get a reference to the value at a given index.

fn first(&self) -> Option<&Self::Output>

Get a reference to the first element in the array.

fn last(&self) -> Option<&Self::Output>

Get a reference to the last element in the array.

fn contains(&self, target: &Self::Output) -> bool

where Self::Output: PartialEq,

Return true if an element equivalent to target exists in the array.

fn binary_search(&self, target: &Self::Output) -> Result<usize, usize>

where Self::Output: Ord,

Perform a binary search for target.

fn binary_search_by<F>(&self, compare: F) -> Result<usize, usize>

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

Perform a binary search using a comparator function.

fn binary_search_by_key<K, F>( &self, key: &K, extract: F, ) -> Result<usize, usize>

where F: FnMut(&Self::Output) -> K, K: Ord,

Perform a binary search using a key and a key extractor function.

fn is_sorted(&self) -> bool

where Self::Output: PartialOrd,

Test whether the array is sorted.

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

where F: FnMut(&Self::Output, &Self::Output) -> Option<Ordering>,

Test whether the array is sorted using a comparator function.

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

where F: FnMut(&Self::Output) -> K, K: PartialOrd,

Test whether the array is sorted using a key extractor function.

fn starts_with(&self, slice: &[Self::Output]) -> bool

where Self::Output: Sized + PartialEq,

Test whether the array starts with the elements in slice.

fn ends_with(&self, slice: &[Self::Output]) -> bool

where Self::Output: Sized + PartialEq,

Test whether the array ends with the elements in slice.

impl<'a, A: 'a, const N: usize> Clone for Slice<'a, A, N>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'a, A: Debug + 'a, const N: usize> Debug for Slice<'a, A, N>

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

Formats the value using the given formatter.

impl<'a, A: 'a, const N: usize> From<&'a RingBuffer<A, N>> for Slice<'a, A, N>

fn from(buffer: &'a RingBuffer<A, N>) -> Self

Converts to this type from the input type.

impl<'a, A: 'a, const N: usize> HasLength for Slice<'a, A, N>

fn len(&self) -> usize

Get the length of the slice.

fn is_empty(&self) -> bool

Return whether the data structure is empty.

impl<'a, A: Hash + 'a, const N: usize> Hash for Slice<'a, A, N>

fn hash<H: Hasher>(&self, hasher: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a, A: 'a, const N: usize> Index<usize> for Slice<'a, A, N>

type Output = A

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<'a, A: 'a, const N: usize> Into<Slice<'a, A, N>> for SliceMut<'a, A, N>

fn into(self) -> Slice<'a, A, N>

Converts this type into the (usually inferred) input type.

impl<'a, A: 'a, const N: usize> IntoIterator for &'a Slice<'a, A, N>

type Item = &'a A

The type of the elements being iterated over.

type IntoIter = Iter<'a, A, N>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, A: Ord + 'a, const N: usize> Ord for Slice<'a, A, N>

fn cmp(&self, other: &Self) -> 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<'a, A: PartialEq + 'a, const N: usize> PartialEq<RingBuffer<A, N>> for Slice<'a, A, N>

fn eq(&self, other: &RingBuffer<A, N>) -> 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<'a, A: PartialEq + 'a, S, const N: usize> PartialEq<S> for Slice<'a, A, N>

where S: Borrow<[A]>,

fn eq(&self, other: &S) -> 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<A, const N: usize> PartialEq<Slice<'_, A, N>> for RingBuffer<A, N>

where A: PartialEq,

fn eq(&self, other: &Slice<'_, A, N>) -> 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<'a, A: PartialEq + 'a, const N: usize> PartialEq<Slice<'a, A, N>> for SliceMut<'a, A, N>

fn eq(&self, other: &Slice<'a, A, N>) -> 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<'a, A: PartialEq + 'a, const N: usize> PartialEq<SliceMut<'a, A, N>> for Slice<'a, A, N>

fn eq(&self, other: &SliceMut<'a, A, N>) -> 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<'a, A: PartialEq + 'a, const N: usize> PartialEq for Slice<'a, A, N>

fn eq(&self, other: &Self) -> 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<'a, A: PartialOrd + 'a, const N: usize> PartialOrd for Slice<'a, A, N>

fn partial_cmp(&self, other: &Self) -> 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<'a, A: Eq + 'a, const N: usize> Eq for Slice<'a, A, N>