Struct SliceVTable

#[non_exhaustive]
#[repr(C)]
pub struct SliceVTable {
    pub len: SliceLenFn,
    pub get_item_ptr: SliceGetItemPtrFn,
}

Virtual table for a slice-like type (like Vec<T>, but also HashSet<T>, etc.)

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

len: SliceLenFn

Number of items in the slice

get_item_ptr: SliceGetItemPtrFn

Get pointer to the item at the given index. Panics if out of bounds.

Implementations

impl SliceVTable

pub const fn builder() -> SliceVTableBuilder

Returns a builder for SliceVTable

Trait Implementations

impl Clone for SliceVTable

fn clone(&self) -> SliceVTable

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for SliceVTable

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

Formats the value using the given formatter.

impl Hash for SliceVTable

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 PartialEq for SliceVTable

fn eq(&self, other: &SliceVTable) -> 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 Copy for SliceVTable

impl Eq for SliceVTable

impl StructuralPartialEq for SliceVTable