Struct IndexSmallVec

pub struct IndexSmallVec<I, T, const CAP: usize> { /* private fields */ }

Available on crate feature smallvec only.

Implementations

impl<I: Idx, T, const CAP: usize> IndexSmallVec<I, T, CAP>

pub const fn new() -> Self

pub fn swap_remove(&mut self, idx: I) -> T

pub fn reserve(&mut self, additional: I)

pub fn reserve_len(&mut self, additional: usize)

pub fn extend_from_slice(&mut self, slice: &[T])

where T: Clone,

pub fn push(&mut self, v: T)

pub fn pop(&mut self) -> Option<T>

pub fn clear(&mut self)

pub fn as_array_vec(&self) -> &SmallVec<[T; CAP]>

pub fn as_array_vec_mut(&mut self) -> &mut SmallVec<[T; CAP]>

pub fn into_array_vec(self) -> SmallVec<[T; CAP]>

pub fn push_get_id(&mut self, v: T) -> I

pub fn truncate(&mut self, end: I)

pub fn truncate_len(&mut self, len: usize)

pub fn iter_enumerated(&self) -> IdxEnumerate<I, Iter<'_, T>>

pub fn iter_enumerated_mut(&mut self) -> IdxEnumerate<I, IterMut<'_, T>>

pub fn into_iter_enumerated(self) -> IdxEnumerate<I, IntoIter<[T; CAP]>>

pub fn indices(&self) -> IdxRange<I>

pub fn capacity(&self) -> usize

pub fn as_index_slice(&self) -> &IndexSlice<I, T>

pub fn as_index_slice_mut(&mut self) -> &IndexSlice<I, T>

Methods from Deref<Target = IndexSlice<I, T>>

pub fn iter_enumerated(&self, initial_offset: I) -> IdxEnumerate<I, Iter<'_, T>>

pub fn iter_enumerated_mut( &mut self, initial_offset: I, ) -> IdxEnumerate<I, IterMut<'_, T>>

pub fn is_empty(&self) -> bool

pub fn len(&self) -> usize

pub fn len_idx(&self) -> I

pub fn last_idx(&self) -> Option<I>

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

pub fn first_mut(&mut self) -> Option<&mut T>

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

pub fn last_mut(&mut self) -> Option<&mut T>

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

pub fn as_slice_mut(&mut self) -> &mut [T]

pub fn get(&self, idx: I) -> Option<&T>

pub fn get_mut(&mut self, idx: I) -> Option<&mut T>

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

pub fn iter_mut(&mut self) -> IterMut<'_, T>

pub fn split_at_mut( &mut self, idx: I, ) -> (&mut IndexSlice<I, T>, &mut IndexSlice<I, T>)

pub unsafe fn get_disjoint_unchecked_mut<ISI: IndexSliceIndex<IndexSlice<I, T>> + GetDisjointMutIndex<I>, const N: usize>( &mut self, indices: [ISI; N], ) -> [&mut ISI::Output; N]

Safety

Calling this method with overlapping keys is undefined behavior even if the resulting references are not used.

pub fn get_disjoint_mut<ISI: IndexSliceIndex<IndexSlice<I, T>> + GetDisjointMutIndex<I>, const N: usize>( &mut self, indices: [ISI; N], ) -> Result<[&mut ISI::Output; N], GetDisjointMutError>

Trait Implementations

impl<I: Clone, T: Clone, const CAP: usize> Clone for IndexSmallVec<I, T, CAP>

fn clone(&self) -> IndexSmallVec<I, T, CAP>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<I: Idx, T: Debug, const CAP: usize> Debug for IndexSmallVec<I, T, CAP>

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

Formats the value using the given formatter.

impl<I, T, const CAP: usize> Default for IndexSmallVec<I, T, CAP>

fn default() -> Self

Returns the “default value” for a type.

impl<I: Idx, T, const CAP: usize> Deref for IndexSmallVec<I, T, CAP>

type Target = IndexSlice<I, T>

The resulting type after dereferencing.

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

Dereferences the value.

impl<I: Idx, T, const CAP: usize> DerefMut for IndexSmallVec<I, T, CAP>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<'de, I: Idx, T, const CAP: usize> Deserialize<'de> for IndexSmallVec<I, T, CAP>

where SmallVec<[T; CAP]>: Deserialize<'de>,

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<I, T, const CAP: usize> Extend<T> for IndexSmallVec<I, T, CAP>

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

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<I, T, const CAP: usize> From<IndexSmallVec<I, T, CAP>> for SmallVec<[T; CAP]>

fn from(value: IndexSmallVec<I, T, CAP>) -> Self

Converts to this type from the input type.

impl<I, T, const CAP: usize> From<SmallVec<[T; CAP]>> for IndexSmallVec<I, T, CAP>

fn from(v: SmallVec<[T; CAP]>) -> Self

Converts to this type from the input type.

impl<I, T, const CAP: usize> FromIterator<T> for IndexSmallVec<I, T, CAP>

fn from_iter<ITER: IntoIterator<Item = T>>(iter: ITER) -> Self

Creates a value from an iterator.

impl<I: Hash, T: Hash, const CAP: usize> Hash for IndexSmallVec<I, T, CAP>

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<I: Idx, T, const CAP: usize> Index<I> for IndexSmallVec<I, T, CAP>

type Output = T

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<I: Idx, T, const CAP: usize> Index<Range<I>> for IndexSmallVec<I, T, CAP>

type Output = IndexSlice<I, T>

The returned type after indexing.

fn index(&self, index: Range<I>) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<I: Idx, T, const CAP: usize> Index<RangeFrom<I>> for IndexSmallVec<I, T, CAP>

type Output = IndexSlice<I, T>

The returned type after indexing.

fn index(&self, rb: RangeFrom<I>) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<I: Idx, T, const CAP: usize> Index<RangeInclusive<I>> for IndexSmallVec<I, T, CAP>

type Output = IndexSlice<I, T>

The returned type after indexing.

fn index(&self, rb: RangeInclusive<I>) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<I: Idx, T, const CAP: usize> Index<RangeTo<I>> for IndexSmallVec<I, T, CAP>

type Output = IndexSlice<I, T>

The returned type after indexing.

fn index(&self, rb: RangeTo<I>) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<I: Idx, T, const CAP: usize> Index<RangeToInclusive<I>> for IndexSmallVec<I, T, CAP>

type Output = IndexSlice<I, T>

The returned type after indexing.

fn index(&self, rb: RangeToInclusive<I>) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<I: Idx, T, const CAP: usize> IndexMut<I> for IndexSmallVec<I, T, CAP>

fn index_mut(&mut self, index: I) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<I: Idx, T, const CAP: usize> IndexMut<Range<I>> for IndexSmallVec<I, T, CAP>

fn index_mut(&mut self, index: Range<I>) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<I: Idx, T, const CAP: usize> IndexMut<RangeFrom<I>> for IndexSmallVec<I, T, CAP>

fn index_mut(&mut self, rb: RangeFrom<I>) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<I: Idx, T, const CAP: usize> IndexMut<RangeInclusive<I>> for IndexSmallVec<I, T, CAP>

fn index_mut(&mut self, rb: RangeInclusive<I>) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<I: Idx, T, const CAP: usize> IndexMut<RangeTo<I>> for IndexSmallVec<I, T, CAP>

fn index_mut(&mut self, rb: RangeTo<I>) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<I: Idx, T, const CAP: usize> IndexMut<RangeToInclusive<I>> for IndexSmallVec<I, T, CAP>

fn index_mut(&mut self, rb: RangeToInclusive<I>) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<'a, I: Idx, T, const CAP: usize> IntoIterator for &'a IndexSmallVec<I, T, CAP>

type Item = &'a T

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, I: Idx, T, const CAP: usize> IntoIterator for &'a mut IndexSmallVec<I, T, CAP>

type Item = &'a mut T

The type of the elements being iterated over.

type IntoIter = IterMut<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<I: Idx, T, const CAP: usize> IntoIterator for IndexSmallVec<I, T, CAP>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<[T; CAP]>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<I: Ord, T: Ord, const CAP: usize> Ord for IndexSmallVec<I, T, CAP>

fn cmp(&self, other: &IndexSmallVec<I, T, CAP>) -> 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<I: Idx, T: PartialEq, const CAP: usize> PartialEq<[T]> for IndexSmallVec<I, T, CAP>

fn eq(&self, other: &[T]) -> bool

Tests for self and other values to be equal, and is used by ==.

const 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<I: Idx, T: PartialEq, const CAP: usize, const N: usize> PartialEq<[T; N]> for IndexSmallVec<I, T, CAP>

fn eq(&self, other: &[T; N]) -> bool

Tests for self and other values to be equal, and is used by ==.

const 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<I: Idx, T: PartialEq, const CAP: usize> PartialEq<IndexSlice<I, T>> for IndexSmallVec<I, T, CAP>

fn eq(&self, other: &IndexSlice<I, T>) -> bool

Tests for self and other values to be equal, and is used by ==.

const 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<I: Idx, T: PartialEq, const CAP: usize> PartialEq<IndexSmallVec<I, T, CAP>> for [T]

fn eq(&self, other: &IndexSmallVec<I, T, CAP>) -> bool

Tests for self and other values to be equal, and is used by ==.

const 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<I: Idx, T: PartialEq, const CAP: usize, const N: usize> PartialEq<IndexSmallVec<I, T, CAP>> for [T; N]

fn eq(&self, other: &IndexSmallVec<I, T, CAP>) -> bool

Tests for self and other values to be equal, and is used by ==.

const 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<I: Idx, T: PartialEq, const CAP: usize> PartialEq<IndexSmallVec<I, T, CAP>> for IndexSlice<I, T>

fn eq(&self, other: &IndexSmallVec<I, T, CAP>) -> bool

Tests for self and other values to be equal, and is used by ==.

const 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<I: PartialEq, T: PartialEq, const CAP: usize> PartialEq for IndexSmallVec<I, T, CAP>

fn eq(&self, other: &IndexSmallVec<I, T, CAP>) -> bool

Tests for self and other values to be equal, and is used by ==.

const 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<I: PartialOrd, T: PartialOrd, const CAP: usize> PartialOrd for IndexSmallVec<I, T, CAP>

fn partial_cmp(&self, other: &IndexSmallVec<I, T, CAP>) -> 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<I: Idx, T, const CAP: usize> Serialize for IndexSmallVec<I, T, CAP>

where SmallVec<[T; CAP]>: Serialize,

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<I: Eq, T: Eq, const CAP: usize> Eq for IndexSmallVec<I, T, CAP>

impl<I, T, const CAP: usize> StructuralPartialEq for IndexSmallVec<I, T, CAP>