Struct HeaderVec

pub struct HeaderVec<H, T> { /* private fields */ }

Implementations

impl<H, T> HeaderVec<H, T>

pub fn capacity(&self) -> usize

The total reserved capacity of the vector.

pub fn as_ptr(&self) -> NonNull<HeaderSlice<H, T>>

Returns a pointer to a HeaderSlice representing this vector.

pub fn as_raw_parts( &mut self, ) -> (NonNull<Pair<H, MaybeUninit<T>>>, usize, usize)

Returns the raw parts (ptr, length, capacity) of the vector without consuming it. Use at your own risk: it is possible to create multiple instances of the same vector by passing this to from_raw_parts. Having multiple instances with the same pointer is “safe” as long as it is never used mutably (or dropped/consumed) as long as more than one instance exists.

pub fn into_raw_parts(self) -> (NonNull<Pair<H, MaybeUninit<T>>>, usize, usize)

Returns the raw parts (ptr, length, capacity) of the vector. Reconstruct the vector by passing these values to from_raw_parts.

pub unsafe fn from_raw_parts( ptr: NonNull<Pair<H, MaybeUninit<T>>>, len: usize, cap: usize, ) -> Self

Constructs an instance of this struct using the raw parts returned from as_raw_parts or into_raw_parts.

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

Push a value to the end of the vector.

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

Pop a value from the end of the vec, if there is one.

pub fn remove(&mut self, index: usize) -> Option<T>

Removes a value at the given index, if it exiss. All entries after index will be shifted to the left.

pub fn swap_remove(&mut self, index: usize) -> Option<T>

Remove an element at index if it exists by replacing it with the last element of the vector.

pub fn insert(&mut self, index: usize, val: T)

Inserts an element at index, shifting all elements after index to the right. Panics if index > self.len()

pub fn with_capacity(head: H, cap: usize) -> Self

Creates an empty HeaderVec with the specified capacity.

pub fn new(head: H) -> Self

Creates an empty HeaderVec.

pub fn truncate(&mut self, new_len: usize)

Shortens the vector to the given length. Panics if new_len > self.len().

pub fn resize_with(&mut self, new_len: usize, f: impl FnMut() -> T)

Resizes the vector. If new_len > self.len(), the elements will be instantiated with the given function.

pub fn from_iter<I: IntoIterator<Item = T>>(head: H, iter: I) -> Self

Creates a new instance of HeaderVec from the given header and iterator.

pub fn shrink_to_fit(&mut self)

Reallocates so there is no excess capacity (i.e. capacity == length).

pub fn into_box(self) -> Box<HeaderSlice<H, T>>

Converts the vector into a boxed HeaderSlice.

pub fn from_box(src: Box<HeaderSlice<H, T>>) -> Self

Creates a vector from a boxed HeaderSlice.

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

Reserve enough capacity to add at least additional elements without realllocating.

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

Reserve enough capacity to add exactly additional elements without realllocating.

pub fn into_values(self) -> IntoValuesIter<H, T>

Consumes the vector and returns an iterator of its values.

pub fn into_header_values(self) -> (H, IntoValuesIter<H, T>)

Consumes the vector and returns its header and an iterator of its values.

pub fn clear(&mut self)

Delete all items in the vector and reallocate so there is no excess capacity.

pub fn clear_in_place(&mut self)

Delete all items in the vector without reallocating.

pub unsafe fn dealloc_without_dropping(self)

pub unsafe fn copy_from_ptr_unsafe(head: H, src: *mut T, len: usize) -> Self

Copies the contents of a slice into a new HeaderVec. Do not use or drop the contents of the original slice after this.

impl<H, T> HeaderVec<H, MaybeUninit<T>>

pub fn new_uninit_values(head: H, len: usize) -> Self

pub unsafe fn assume_init_values(self) -> HeaderVec<H, T>

impl<H, T> HeaderVec<MaybeUninit<H>, MaybeUninit<T>>

pub unsafe fn assume_init(self) -> HeaderVec<H, T>

impl<H, T> HeaderVec<MaybeUninit<H>, T>

pub unsafe fn assume_init_head(self) -> HeaderVec<H, T>

impl<H, T: Copy> HeaderVec<H, T>

pub fn copy_from_slice(head: H, src: &[T]) -> Self

Copies the contents of a slice into a new HeaderVec.

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

Copies the contents onto the end of the vector.

impl<H, T: Clone> HeaderVec<H, T>

pub fn resize(&mut self, new_len: usize, val: T)

Resize the vector. If new_len > self.len(), new entries will be cloned from val.

impl<H, T: Default> HeaderVec<H, T>

pub fn resize_default(&mut self, new_len: usize)

Resize the vector. If new_len > self.len(), new entries will use the default value of T.

impl<H, T: Ord> HeaderVec<H, T>

pub fn insert_sorted(&mut self, val: T)

Assuming the vector is sorted, insert the given value into its sorted position. Behavior is undefined if the vector is not sorted.

pub fn insert_or_replace_sorted(&mut self, val: T) -> Option<T>

Assuming the vector is sorted, insert the given value into its sorted position if it does not already exist in the vector. If an element already exists that compares equal to val, reaplce it with val and return its original value. Behavior is undefined if the vector is not sorted.

Methods from Deref<Target = HeaderSlice<H, T>>

pub fn as_truncated(&self, len: usize) -> &Self

pub fn as_truncated_mut(&mut self, len: usize) -> &mut Self

pub unsafe fn resized_unchecked(&mut self, len: usize) -> &mut Self

pub fn len(&self) -> usize

Trait Implementations

impl<H, T, I: IntoIterator<Item = T>> Add<I> for HeaderVec<H, T>

type Output = HeaderVec<H, T>

The resulting type after applying the + operator.

fn add(self, rhs: I) -> Self

Performs the + operation.

impl<H, T, I: IntoIterator<Item = T>> AddAssign<I> for HeaderVec<H, T>

fn add_assign(&mut self, rhs: I)

Performs the += operation.

impl<H, T> AsMut<HeaderSlice<H, T>> for HeaderVec<H, T>

fn as_mut(&mut self) -> &mut HeaderSlice<H, T>

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

impl<H, T> AsRef<HeaderSlice<H, T>> for HeaderVec<H, T>

fn as_ref(&self) -> &HeaderSlice<H, T>

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

impl<H, T> Borrow<HeaderSlice<H, T>> for HeaderVec<H, T>

fn borrow(&self) -> &HeaderSlice<H, T>

Immutably borrows from an owned value.

impl<H, T> BorrowMut<HeaderSlice<H, T>> for HeaderVec<H, T>

fn borrow_mut(&mut self) -> &mut HeaderSlice<H, T>

Mutably borrows from an owned value.

impl<H: Clone, T: Clone> Clone for HeaderVec<H, T>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<H: Debug, T: Debug> Debug for HeaderVec<H, T>

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

Formats the value using the given formatter.

impl<H: Default, T> Default for HeaderVec<H, T>

fn default() -> Self

Returns the “default value” for a type.

impl<H, T> Deref for HeaderVec<H, T>

type Target = HeaderSlice<H, T>

The resulting type after dereferencing.

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

Dereferences the value.

impl<H, T> DerefMut for HeaderVec<H, T>

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

Mutably dereferences the value.

impl<H, T> Drop for HeaderVec<H, T>

fn drop(&mut self)

Executes the destructor for this type.

impl<H, T> Extend<T> for HeaderVec<H, T>

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

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<H, T> From<Box<HeaderSlice<H, T>>> for HeaderVec<H, T>

fn from(src: Box<HeaderSlice<H, T>>) -> Self

Converts to this type from the input type.

impl<H, T> From<HeaderVec<H, T>> for Box<HeaderSlice<H, T>>

fn from(src: HeaderVec<H, T>) -> Self

Converts to this type from the input type.

impl<H: Default, T> FromIterator<T> for HeaderVec<H, T>

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

Creates a value from an iterator.

impl<H: Hash, T: Hash> Hash for HeaderVec<H, T>

fn hash<S: Hasher>(&self, state: &mut S)

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<H: Ord, T: Ord> Ord for HeaderVec<H, T>

fn cmp(&self, rhs: &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<H, T, Rhs> PartialEq<Rhs> for HeaderVec<H, T>

where H: PartialEq, T: PartialEq, Rhs: Borrow<HeaderSlice<H, T>> + ?Sized,

fn eq(&self, rhs: &Rhs) -> 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<H, T, Rhs> PartialOrd<Rhs> for HeaderVec<H, T>

where H: PartialOrd, T: PartialOrd, Rhs: Borrow<HeaderSlice<H, T>> + ?Sized,

fn partial_cmp(&self, rhs: &Rhs) -> 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<H: Eq, T: Eq> Eq for HeaderVec<H, T>