[−][src]Struct sized_chunks::ring_buffer::Slice
An indexable representation of a subset of a RingBuffer
.
Methods
impl<'a, A: 'a, N: ChunkLength<A> + 'a> Slice<'a, A, N>
[src]
#[must_use]
pub fn len(&self) -> usize
[src]
Get the length of the slice.
#[must_use]
pub fn is_empty(&self) -> bool
[src]
Test if the slice is empty.
#[must_use]
pub fn get(&self, index: usize) -> Option<&'a A>
[src]
Get a reference to the value at a given index.
#[must_use]
pub fn first(&self) -> Option<&A>
[src]
Get a reference to the first value in the slice.
#[must_use]
pub fn last(&self) -> Option<&A>
[src]
Get a reference to the last value in the slice.
#[must_use]
pub fn iter(&self) -> Iter<A, N>
[src]
Get an iterator over references to the items in the slice in order.
#[must_use]
pub fn slice<R: RangeBounds<usize>>(self, range: R) -> Slice<'a, A, N>
[src]
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)
.
#[must_use]
pub fn split_at(self, index: usize) -> (Slice<'a, A, N>, Slice<'a, A, N>)
[src]
Split the slice into two subslices at the given index.
#[must_use]
pub fn to_owned(&self) -> RingBuffer<A, N> where
A: Clone,
[src]
A: Clone,
Construct a new RingBuffer
by copying the elements in this slice.
Trait Implementations
impl<'a, A: 'a, N: ChunkLength<A> + 'a> Clone for Slice<'a, A, N>
[src]
#[must_use]
fn clone(&self) -> Self
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl<'a, A: Debug + 'a, N: ChunkLength<A> + 'a> Debug for Slice<'a, A, N>
[src]
impl<'a, A: Eq + 'a, N: ChunkLength<A> + 'a> Eq for Slice<'a, A, N>
[src]
impl<'a, A: 'a, N: ChunkLength<A> + 'a> From<&'a RingBuffer<A, N>> for Slice<'a, A, N>
[src]
#[must_use]
fn from(buffer: &'a RingBuffer<A, N>) -> Self
[src]
impl<'a, A: Hash + 'a, N: ChunkLength<A> + 'a> Hash for Slice<'a, A, N>
[src]
fn hash<H: Hasher>(&self, hasher: &mut H)
[src]
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl<'a, A: 'a, N: ChunkLength<A> + 'a> Index<usize> for Slice<'a, A, N>
[src]
type Output = A
The returned type after indexing.
#[must_use]
fn index(&self, index: usize) -> &Self::Output
[src]
impl<'a, A: 'a, N: ChunkLength<A> + 'a> Into<Slice<'a, A, N>> for SliceMut<'a, A, N>
[src]
impl<'a, A: 'a, N: ChunkLength<A> + 'a> IntoIterator for &'a Slice<'a, A, N>
[src]
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?
#[must_use]
fn into_iter(self) -> Self::IntoIter
[src]
impl<'a, A: Ord + 'a, N: ChunkLength<A> + 'a> Ord for Slice<'a, A, N>
[src]
#[must_use]
fn cmp(&self, other: &Self) -> Ordering
[src]
#[must_use]
fn max(self, other: Self) -> Self
1.21.0[src]
#[must_use]
fn min(self, other: Self) -> Self
1.21.0[src]
#[must_use]
fn clamp(self, min: Self, max: Self) -> Self
[src]
impl<'a, A: PartialEq + 'a, N: ChunkLength<A> + 'a, S> PartialEq<S> for Slice<'a, A, N> where
S: Borrow<[A]>,
[src]
S: Borrow<[A]>,
#[must_use]
fn eq(&self, other: &S) -> bool
[src]
#[must_use]
fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a, A: PartialEq + 'a, N: ChunkLength<A> + 'a> PartialEq<Slice<'a, A, N>> for Slice<'a, A, N>
[src]
#[must_use]
fn eq(&self, other: &Self) -> bool
[src]
#[must_use]
fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a, A: PartialOrd + 'a, N: ChunkLength<A> + 'a> PartialOrd<Slice<'a, A, N>> for Slice<'a, A, N>
[src]
Auto Trait Implementations
impl<'a, A, N> RefUnwindSafe for Slice<'a, A, N> where
A: RefUnwindSafe,
N: RefUnwindSafe,
<N as ChunkLength<A>>::SizedType: RefUnwindSafe,
A: RefUnwindSafe,
N: RefUnwindSafe,
<N as ChunkLength<A>>::SizedType: RefUnwindSafe,
impl<'a, A, N> Send for Slice<'a, A, N> where
A: Sync,
N: Sync,
<N as ChunkLength<A>>::SizedType: Sync,
A: Sync,
N: Sync,
<N as ChunkLength<A>>::SizedType: Sync,
impl<'a, A, N> Sync for Slice<'a, A, N> where
A: Sync,
N: Sync,
<N as ChunkLength<A>>::SizedType: Sync,
A: Sync,
N: Sync,
<N as ChunkLength<A>>::SizedType: Sync,
impl<'a, A, N> Unpin for Slice<'a, A, N>
impl<'a, A, N> UnwindSafe for Slice<'a, A, N> where
A: RefUnwindSafe,
N: RefUnwindSafe,
<N as ChunkLength<A>>::SizedType: RefUnwindSafe,
A: RefUnwindSafe,
N: RefUnwindSafe,
<N as ChunkLength<A>>::SizedType: RefUnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> Same<T> for T
[src]
type Output = T
Should always be Self
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,