Struct Slice

pub struct Slice<S> {
    pub lower: usize,
    pub upper: usize,
    pub slice: S,
}

A struct representing a slice of a range of values.

The lower and upper bounds should be meaningfully set on construction.

Fields

lower: usize

upper: usize

slice: S

Implementations

impl<S> Slice<S>

pub fn slice<R: RangeBounds<usize>>(self, range: R) -> Self

pub fn new(lower: u64, upper: u64, slice: S) -> Self

pub fn len(&self) -> usize

impl<S: Index + Len> Slice<S>

pub fn into_iter(self) -> IterOwn<Slice<S>>

Converts the slice into an iterator.

This method exists rather than an IntoIterator implementation to avoid a conflicting implementation for pushing an I: IntoIterator into Vecs.

impl<'a, T> Slice<&'a [T]>

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

Trait Implementations

impl<S: Clone> Clone for Slice<S>

fn clone(&self) -> Slice<S>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<S: Debug> Debug for Slice<S>

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

Formats the value using the given formatter.

impl<S> Hash for Slice<S>

where Self: Index<Ref: Hash>,

fn hash<H: Hasher>(&self, state: &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, S> Index for &'a Slice<S>

where &'a S: Index,

type Ref = <&'a S as Index>::Ref

The type returned by the get method.

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

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

where Self: Len,

fn index_iter(&self) -> IterOwn<&Self>

Converts &self into an iterator.

fn into_index_iter(self) -> IterOwn<Self>

where Self: Sized,

Converts self into an iterator.

impl<S: Index> Index for Slice<S>

type Ref = <S as Index>::Ref

The type returned by the get method.

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

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

where Self: Len,

fn index_iter(&self) -> IterOwn<&Self>

Converts &self into an iterator.

fn into_index_iter(self) -> IterOwn<Self>

where Self: Sized,

Converts self into an iterator.

impl<S: IndexMut> IndexMut for Slice<S>

type IndexMut<'a> = <S as IndexMut>::IndexMut<'a> where S: 'a

Type mutably referencing an indexed element.

fn get_mut(&mut self, index: usize) -> Self::IndexMut<'_>

fn last_mut(&mut self) -> Option<Self::IndexMut<'_>>

where Self: Len,

A reference to the last element, should one exist.

impl<S> Len for Slice<S>

fn len(&self) -> usize

The number of contained elements.

fn is_empty(&self) -> bool

Whether this contains no elements.

impl<S: Index> Ord for Slice<S>

where S::Ref: Ord + Eq,

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<S: Index> PartialEq<[<S as Index>::Ref]> for Slice<S>

where S::Ref: PartialEq,

fn eq(&self, other: &[S::Ref]) -> 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<S: Index> PartialEq<Vec<<S as Index>::Ref>> for Slice<S>

where S::Ref: PartialEq,

fn eq(&self, other: &Vec<S::Ref>) -> 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<S: Index> PartialEq for Slice<S>

where S::Ref: PartialEq,

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<S: Index> PartialOrd for Slice<S>

where S::Ref: PartialOrd,

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, TC: Container, BC: for<'b> Push<&'b u64>> Push<Slice<<TC as Container>::Borrowed<'a>>> for Vecs<TC, BC>

fn push(&mut self, item: Slice<TC::Borrowed<'a>>)

Pushes an item onto self.

fn extend(&mut self, iter: impl IntoIterator<Item = T>)

Pushes elements of an iterator onto self.

impl<S: Copy> Copy for Slice<S>

impl<S: Index> Eq for Slice<S>

where S::Ref: Eq,