Struct SliceRef

pub struct SliceRef<'a, T>
where
    T: 'a + Soapy,
{ /* private fields */ }

An immutably borrowed Slice.

A SliceRef is a thin wrapper over a Slice that applies the same borrowing rules as an immutable reference. It is semantically equivalent to &Slice.

Methods from Deref<Target = Slice<T>>

pub fn len(&self) -> usize

Returns the number of elements in the slice, also referred to as its length.

Examples

let soa = soa![Foo(1), Foo(2), Foo(3)];
assert_eq!(soa.len(), 3);

pub fn is_empty(&self) -> bool

Returns true if the slice contains no elements.

Examples

let mut soa = Soa::<Foo>::new();
assert!(soa.is_empty());
soa.push(Foo(1));
assert!(!soa.is_empty());

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

Returns an iterator over the elements.

The iterator yields all items from start to end.

Examples

let soa = soa![Foo(1), Foo(2), Foo(4)];
let mut iter = soa.iter();
assert_eq!(iter.next().unwrap(), Foo(1));
assert_eq!(iter.next().unwrap(), Foo(2));
assert_eq!(iter.next().unwrap(), Foo(4));
assert_eq!(iter.next(), None);

pub fn get<I>(&self, index: I) -> Option<I::Output<'_>>

where I: SoaIndex<T>,

Returns a reference to an element or subslice depending on the type of index.

• If given a position, returns a reference to the element at that position or None if out of bounds.

• If given a range, returns the subslice corresponding to that range, or None if out of bounds.

Examples

let soa = soa![Foo(10), Foo(40), Foo(30), Foo(20)];
assert_eq!(soa.get(1).unwrap(), Foo(40));
assert_eq!(soa.get(4), None);
assert_eq!(soa.get(..).unwrap(), [Foo(10), Foo(40), Foo(30), Foo(20)]);
assert_eq!(soa.get(..2).unwrap(), [Foo(10), Foo(40)]);
assert_eq!(soa.get(..=2).unwrap(), [Foo(10), Foo(40), Foo(30)]);
assert_eq!(soa.get(2..).unwrap(), [Foo(30), Foo(20)]);
assert_eq!(soa.get(1..3).unwrap(), [Foo(40), Foo(30)]);
assert_eq!(soa.get(1..=3).unwrap(), [Foo(40), Foo(30), Foo(20)]);
assert_eq!(soa.get(2..5), None);

pub fn idx<I>(&self, index: I) -> I::Output<'_>

where I: SoaIndex<T>,

Returns a reference to the element at the given index.

This is similar to Index, which is not implementable for this type. See get for a non-panicking version.

Panics

Panics if the index is out-of-bounds, which is whenever SoaIndex::get returns None.

Examples

let soa = soa![Foo(10), Foo(40), Foo(30), Foo(90)];
assert_eq!(soa.idx(3), Foo(90));
assert_eq!(soa.idx(1..3), [Foo(40), Foo(30)]);

pub fn first(&self) -> Option<T::Ref<'_>>

Returns the first element of the slice, or None if empty.

Examples

let soa = soa![Foo(10), Foo(40), Foo(30)];
assert_eq!(soa.first().unwrap(), Foo(10));

let soa = Soa::<Foo>::new();
assert_eq!(soa.first(), None);

pub fn last(&self) -> Option<T::Ref<'_>>

Returns the last element of the slice, or None if empty.

Examples

let soa = soa![Foo(10), Foo(40), Foo(30)];
assert_eq!(soa.last().unwrap(), Foo(30));

let soa = Soa::<Foo>::new();
assert_eq!(soa.last(), None);

pub fn chunks_exact(&self, chunk_size: usize) -> ChunksExact<'_, T>

Returns an iterator over chunk_size elements of the slice at a time, starting at the beginning of the slice.

The chunks are slices and do not overlap. If chunk_size does not divide the length of the slice, then the last up to chunk_size-1 elements will be omitted and can be retrieved from the remainder function of the iterator.

Due to each chunk having exactly chunk_size elements, the compiler can often optimize the resulting code better than in the case of chunks.

Examples

let soa = soa![Foo('l'), Foo('o'), Foo('r'), Foo('e'), Foo('m')];
let mut iter = soa.chunks_exact(2);
assert_eq!(iter.next().unwrap(), [Foo('l'), Foo('o')]);
assert_eq!(iter.next().unwrap(), [Foo('r'), Foo('e')]);
assert!(iter.next().is_none());
assert_eq!(iter.remainder(), [Foo('m')]);

pub fn slices(&self) -> T::Slices<'_>

Returns a collection of slices for each field of the slice.

For convenience, slices can also be aquired using the getter methods for individual fields.

Examples

let soa = soa![Foo { foo: 1, bar: 2 }, Foo { foo: 3, bar: 4 }];
let slices = soa.slices();
assert_eq!(slices.foo, soa.foo());
assert_eq!(slices.bar, soa.bar());

Trait Implementations

impl<'a, T> AsRef<Slice<T>> for SliceRef<'a, T>

where T: Soapy,

fn as_ref(&self) -> &Slice<T>

Converts this type into a shared reference of the (usually inferred) input type.

impl<'a, T> Clone for SliceRef<'a, T>

where T: Soapy,

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'a, T> Debug for SliceRef<'a, T>

where T: Soapy, for<'b> T::Ref<'b>: Debug,

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

Formats the value using the given formatter.

impl<'a, T> Deref for SliceRef<'a, T>

where T: Soapy,

type Target = Slice<T>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<'a, T> Hash for SliceRef<'a, T>

where T: Soapy, for<'b> T::Ref<'b>: 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, T> IntoIterator for SliceRef<'a, T>

where T: Soapy,

type Item = <T as Soapy>::Ref<'a>

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, T> Ord for SliceRef<'a, T>

where T: Soapy + Ord, for<'b> T::Ref<'b>: Ord,

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<T> PartialEq<&[T]> for SliceRef<'_, T>

where T: Soapy, for<'a> T::Ref<'a>: PartialEq,

fn eq(&self, other: &&[T]) -> 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<T, const N: usize> PartialEq<&[T; N]> for SliceRef<'_, T>

where T: Soapy, for<'a> T::Ref<'a>: PartialEq,

fn eq(&self, other: &&[T; 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<T> PartialEq<&mut [T]> for SliceRef<'_, T>

where T: Soapy, for<'a> T::Ref<'a>: PartialEq,

fn eq(&self, other: &&mut [T]) -> 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<T, const N: usize> PartialEq<&mut [T; N]> for SliceRef<'_, T>

where T: Soapy, for<'a> T::Ref<'a>: PartialEq,

fn eq(&self, other: &&mut [T; 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<T> PartialEq<[T]> for SliceRef<'_, T>

where T: Soapy, for<'a> T::Ref<'a>: PartialEq,

fn eq(&self, other: &[T]) -> 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<T, const N: usize> PartialEq<[T; N]> for SliceRef<'_, T>

where T: Soapy, for<'a> T::Ref<'a>: PartialEq,

fn eq(&self, other: &[T; 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<T> PartialEq<Slice<T>> for SliceRef<'_, T>

where T: Soapy, for<'a> T::Ref<'a>: PartialEq,

fn eq(&self, other: &Slice<T>) -> 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<T> PartialEq<SliceMut<'_, T>> for SliceRef<'_, T>

where T: Soapy, for<'a> T::Ref<'a>: PartialEq,

fn eq(&self, other: &SliceMut<'_, T>) -> 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<T> PartialEq<SliceRef<'_, T>> for &[T]

where T: Soapy, for<'a> T::Ref<'a>: PartialEq,

fn eq(&self, other: &SliceRef<'_, T>) -> 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<T, const N: usize> PartialEq<SliceRef<'_, T>> for &[T; N]

where T: Soapy, for<'a> T::Ref<'a>: PartialEq,

fn eq(&self, other: &SliceRef<'_, T>) -> 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<T> PartialEq<SliceRef<'_, T>> for &Slice<T>

where T: Soapy, for<'a> T::Ref<'a>: PartialEq,

fn eq(&self, other: &SliceRef<'_, T>) -> 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<T> PartialEq<SliceRef<'_, T>> for &mut [T]

where T: Soapy, for<'a> T::Ref<'a>: PartialEq,

fn eq(&self, other: &SliceRef<'_, T>) -> 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<T, const N: usize> PartialEq<SliceRef<'_, T>> for &mut [T; N]

where T: Soapy, for<'a> T::Ref<'a>: PartialEq,

fn eq(&self, other: &SliceRef<'_, T>) -> 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<T> PartialEq<SliceRef<'_, T>> for &mut Slice<T>

where T: Soapy, for<'a> T::Ref<'a>: PartialEq,

fn eq(&self, other: &SliceRef<'_, T>) -> 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<T> PartialEq<SliceRef<'_, T>> for [T]

where T: Soapy, for<'a> T::Ref<'a>: PartialEq,

fn eq(&self, other: &SliceRef<'_, T>) -> 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<T, const N: usize> PartialEq<SliceRef<'_, T>> for [T; N]

where T: Soapy, for<'a> T::Ref<'a>: PartialEq,

fn eq(&self, other: &SliceRef<'_, T>) -> 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<T> PartialEq<SliceRef<'_, T>> for Slice<T>

where T: Soapy, for<'a> T::Ref<'a>: PartialEq,

fn eq(&self, other: &SliceRef<'_, T>) -> 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<T> PartialEq<SliceRef<'_, T>> for SliceMut<'_, T>

where T: Soapy, for<'a> T::Ref<'a>: PartialEq,

fn eq(&self, other: &SliceRef<'_, T>) -> 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<T> PartialEq<SliceRef<'_, T>> for SliceRef<'_, T>

where T: Soapy, for<'a> T::Ref<'a>: PartialEq,

fn eq(&self, other: &SliceRef<'_, T>) -> 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<T> PartialEq<SliceRef<'_, T>> for Soa<T>

where T: Soapy, for<'a> T::Ref<'a>: PartialEq,

fn eq(&self, other: &SliceRef<'_, T>) -> 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<T> PartialEq<SliceRef<'_, T>> for Vec<T>

where T: Soapy, for<'a> T::Ref<'a>: PartialEq,

fn eq(&self, other: &SliceRef<'_, T>) -> 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<T> PartialEq<Soa<T>> for SliceRef<'_, T>

where T: Soapy, for<'a> T::Ref<'a>: PartialEq,

fn eq(&self, other: &Soa<T>) -> 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<T> PartialEq<Vec<T>> for SliceRef<'_, T>

where T: Soapy, for<'a> T::Ref<'a>: PartialEq,

fn eq(&self, other: &Vec<T>) -> 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, T> PartialOrd for SliceRef<'a, T>

where T: Soapy, for<'b> T::Ref<'b>: 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, T> Copy for SliceRef<'a, T>

where T: 'a + Soapy,

impl<'a, T> Eq for SliceRef<'_, T>

where T: Soapy, for<'b> T::Ref<'b>: Eq,