Struct BufferLinearStaticExample 

pub struct BufferLinearStaticExample<T, S> { /* private fields */ }

✨ 🗃️ A static linear buffer over contiguous storage, made with buffer_linear!.

---

^{📍 data/layout/buffer::BufferLinearStaticExample}

^{📦 size_of::<BufferLinearStaticExample<(), [(); 8]>>() == 1 bytes / 8 bits ⚗️Option<T> 🟰 T}

^{📦 size_of::<BufferLinearStaticExample<u8, [u8; 8]>>() == 9 bytes / 72 bits ⚗️Option<T> 🟰 T}

^{📦 size_of::<BufferLinearStaticExample<i32, [i32; 8]>>() == 36 bytes / 288 bits ⚗️Option<T> 🟰 T}

^{📦 size_of::<BufferLinearStaticExample<char, &[i32]>>() == 12 bytes / 96 bits #️⃣ #[cfg(target_pointer_width = “32”)] ⚗️Option<T> 🟰 T}

^{📦 size_of::<BufferLinearStaticExample<char, &[i32]>>() == 24 bytes / 192 bits #️⃣ #[cfg(target_pointer_width = “64”)] ⚗️Option<T> 🟰 T}

---

Methods

• common methods
  • Size: len (_prim), is_empty.
• Fully initialized array (array)
  • Constructors: new (_init), from_array (from_array_clamped, _prim), from_slice (_clone, _copy, _move_default).
  • Capacity: CAP (_PRIM), capacity (_prim), remaining_capacity (_prim), is_full.
  • Logical range control: clear (_copy), truncate, (_copy, _prim, _prim_copy).
  • Push: push_back (_copy), push_slice (_copy, _copy_exact).
  • Pop: pop_back_clone, pop_back_copy.
  • Peek: peek_back (_mut).
  • Get: get (_mut).
  • Take: take_default, take_init, take_with (_copy).
  • Views: as_slice (_mut),
  • Iteration: iter (_mut).
  • Visitation: visit_each (_mut), visit_slice (_mut).
• Partially initialized array (uninit)^⚠
  • Constructors: new, from_array (_exact _unchecked^⚠), from_slice (_clone, _copy, _move_default, _move_init).
  • Capacity: CAP (_PRIM), capacity (_prim), remaining_capacity (_prim), is_full.
  • Logical range control: clear, drop_back, truncate, (_prim).
  • Push: push_back, push_slice (_copy, _copy_exact).
  • Pop: pop_back.
  • Peek: peek_back (_mut).
  • Get: get (_mut).
  • Views: as_slice (_mut),
  • Iteration: iter (_mut).
  • Visitation: visit_each (_mut), visit_slice (_mut).
• Fully initialized array of options (option)
  • Constructors: new, from_array (_clone, _copy, _unchecked^⚠, _linear, _prefix), from_slice (_clone, _copy, _move_default, _move_init).
  • Capacity: CAP (_PRIM), capacity (_prim), remaining_capacity (_prim), is_full.
  • Logical range control: clear, truncate.
  • Push: push_back (_copy), push_slice (_copy, _copy_exact).
  • Pop: pop_back.
  • Peek: peek_back (_mut).
  • Get: get (_mut).
  • Swap: swap_remove (_prim, _copy, _copy_prim).
  • Views: as_slice (_mut),
  • Iteration: iter (_mut).
  • Visitation: visit_each (_mut), visit_slice (_mut).

Implementations

impl<T, S> BufferLinearStaticExample<T, S>

Common methods.

pub const fn len(&self) -> NonValueU8<{ u8::MAX }>

Returns the number of elements currently stored in the buffer.

pub const fn len_prim(&self) -> u8

Returns the number of elements currently stored in the buffer.

pub const fn is_empty(&self) -> bool

Returns true if the buffer contains no elements.

impl<T, const CAP: usize> BufferLinearStaticExample<T, [T; CAP]>

Fully initialized linear array.

Invariants

• All CAP slots always contain a valid T.
• len controls logical membership, not initialization.
• Dropping the array drops all CAP elements.

Consequences

• Moving out T requires immediately installing another valid T.
• Popping by value therefore requires Copy, Clone, or a replacement value.
• Shrinking len does not affect drop behavior.

pub const CAP: NonValueU8<{ u8::MAX }>

The fixed capacity of the buffer as the index type.

pub const CAP_PRIM: u8

The fixed capacity of the buffer as the primitive type.

pub const fn new(array: [T; CAP]) -> Self

Creates a buffer from an already initialized array, with logical length 0.

pub const fn new_init() -> Self

where T: ConstInit,

Creates a new fully initialized buffer with logical length 0.

pub const fn from_array_clamped( array: [T; CAP], max_len: NonValueU8<{ u8::MAX }>, ) -> Self

Creates a buffer from an already initialized array, limiting the logical length to max_len.

pub const fn from_array_clamped_prim(array: [T; CAP], max_len: u8) -> Self

Primitive-index variant of from_array_clamped.

pub fn from_slice_clone(src: &[T], init: T) -> Option<Self>

where T: Clone,

Creates a new buffer by cloning all the possible elements from src, after initializing the capacity with the init value.

pub const fn from_slice_copy(src: &[T], init: T) -> Option<Self>

where T: Copy,

Creates a new buffer by copying all the possible elements from src, after initializing the capacity with the init value.

pub fn from_slice_move_default(src: &mut [T]) -> Option<Self>

where T: Default,

Creates a new buffer by moving all the possible elements from src, and replacing them with the default value, after initializing the capacity with the default value.

pub const fn capacity(&self) -> NonValueU8<{ u8::MAX }>

Returns the fixed capacity of the buffer.

pub const fn capacity_prim(&self) -> u8

Returns the fixed capacity of the buffer.

pub const fn remaining_capacity(&self) -> NonValueU8<{ u8::MAX }>

Returns the number of additional elements that fit within the current capacity.

pub const fn remaining_capacity_prim(&self) -> u8

Returns the number of additional elements that fit within the current capacity.

pub const fn is_full(&self) -> bool

Returns true if the buffer has reached its capacity.

pub const fn clear(&mut self)

Sets the logical length to zero.

Does not drop elements.

pub const fn truncate(&mut self, new_len: NonValueU8<{ u8::MAX }>)

Sets the logical length to min(new_len, len).

If new_len >= len, this is a no-op.

pub const fn truncate_prim(&mut self, new_len: u8) -> Result<(), InvalidValue>

Primitive-index variant of truncate,

pub fn push_back(&mut self, value: T) -> Result<(), T>

Appends a value to the back of the buffer.

Returns Err(value) if the buffer is full.

pub const fn push_back_copy(&mut self, value: T) -> Result<(), T>

where T: Copy,

Appends a copy of value to the back of the buffer.

Returns Err(value) if the buffer is full.

pub fn push_slice(&mut self, src: &[T]) -> usize

where T: Clone,

Appends as many cloned elements from src as fit.

Returns the number of elements appended.

pub const fn push_slice_copy(&mut self, src: &[T]) -> usize

where T: Copy,

Appends as many copied elements from src as fit.

Returns the number of elements appended.

pub const fn push_slice_copy_exact(&mut self, src: &[T]) -> Result<(), usize>

where T: Copy,

Appends all copied elements from src, or returns the number appended before running out of space.

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

where T: ConstInit,

Removes and returns the value at the back, replacing its storage slot with T::INIT.

pub fn pop_back_with(&mut self, replacement: T) -> Option<T>

Removes and returns the value at the back, replacing its storage slot with replacement.

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

where T: Clone,

Removes and returns a cloned value from the back of the buffer.

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

where T: Copy,

Removes and returns a copied value from the back of the buffer.

pub const fn peek_back(&self) -> Option<&T>

Returns a shared reference to the last element without removing it.

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

Returns an exclusive reference to the last element without removing it.

pub const fn get(&self, index: NonValueU8<{ u8::MAX }>) -> Option<&T>

Returns a shared reference to the element at index, or None if out of bounds.

pub const fn get_mut( &mut self, index: NonValueU8<{ u8::MAX }>, ) -> Option<&mut T>

Returns an exclusive reference to the element at index, or None if out of bounds.

pub fn take_default(&mut self, index: NonValueU8<{ u8::MAX }>) -> Option<T>

where T: Default,

Takes the value at index, replacing it with T::default().

pub const fn take_init(&mut self, index: NonValueU8<{ u8::MAX }>) -> Option<T>

where T: ConstInit,

Takes the value at index, replacing it with T::INIT.

pub fn take_with( &mut self, index: NonValueU8<{ u8::MAX }>, other: T, ) -> Option<T>

Takes the value at index, replacing it with other.

pub const fn take_with_copy( &mut self, index: NonValueU8<{ u8::MAX }>, other: T, ) -> Option<T>

where T: Copy,

Takes the value at index, replacing it with a copy of other.

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

Returns the active logical range as a slice.

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

Returns the active logical range as an exclusive slice.

pub fn iter(&self) -> impl Iterator<Item = &T>

Iterates over the initialized elements.

pub fn iter_mut(&mut self) -> impl Iterator<Item = &mut T>

Iterates mutably over the initialized elements.

pub fn visit_each<F>(&self, f: F)

where for<'v> F: Fn(&'v T),

Visits each initialized element without exposing borrow identity.

pub fn visit_each_mut<F>(&mut self, f: F)

where for<'v> F: Fn(&'v mut T),

Visits each initialized element mutably without exposing borrow identity.

pub fn visit_slice<F, R>(&self, f: F) -> R

where for<'v> F: FnOnce(&'v [T]) -> R,

Visits the active logical range as a shared slice of Some(T), without exposing borrow identity.

pub fn visit_mut_slice<F, R>(&mut self, f: F) -> R

where for<'v> F: FnOnce(&'v mut [T]) -> R,

Visits the active logical range as an exclusive slice of Some(T), without exposing borrow identity.

impl<T, const CAP: usize> BufferLinearStaticExample<T, [MaybeUninit<T>; CAP]>

Partially initialized array.

Invariants

• Only slots 0 .. len are initialized
• Slots len .. CAP are uninitialized and must never be dropped as T
• Drop behavior depends on len

Consequences

• pop_back can safely move out T
• Real drop operations are meaningful
• len controls both logical membership and initialization

pub const CAP: NonValueU8<{ u8::MAX }>

Available on crate feature unsafe_array only.

The fixed capacity of the buffer as the index type.

pub const CAP_PRIM: u8

Available on crate feature unsafe_array only.

The fixed capacity of the buffer as the primitive type.

pub const fn new() -> Self

Available on crate feature unsafe_array only.

Creates an empty buffer with uninitialized storage.

pub fn from_array_exact<const N: usize>(src: [T; N]) -> Self

Available on crate feature unsafe_array only.

Creates a buffer by moving all elements from an array.

Initializes exactly N elements.

Panics

Panics if N > CAP.

pub const unsafe fn from_array_unchecked( storage: [MaybeUninit<T>; CAP], len: NonValueU8<{ u8::MAX }>, ) -> Self

Available on crate feature unsafe_array only.

Creates a buffer from raw uninitialized storage.

Panics

Panics in debug if len > CAP.

Safety

Caller must guarantee:

• storage[0..len] are initialized
• storage[len..] are uninitialized

pub fn from_slice_clone(src: &[T]) -> Option<Self>

where T: Clone,

Available on crate feature unsafe_array only.

Creates a new buffer by cloning all the possible elements from src.

pub const fn from_slice_copy(src: &[T]) -> Option<Self>

where T: Copy,

Available on crate feature unsafe_array only.

Creates a new buffer by copying all the possible elements from src.

pub fn from_slice_move_default(src: &mut [T]) -> Option<Self>

where T: Default,

Available on crate feature unsafe_array only.

Creates a new buffer by moving all the possible elements from src, and replacing them with the default value.

pub const fn from_slice_move_init(src: &mut [T]) -> Option<Self>

where T: ConstInit,

Available on crate feature unsafe_array only.

Creates a new buffer by moving all the possible elements from src, and replacing them with the initializing value.

pub const fn capacity(&self) -> NonValueU8<{ u8::MAX }>

Available on crate feature unsafe_array only.

Returns the fixed capacity of the buffer.

pub const fn capacity_prim(&self) -> u8

Available on crate feature unsafe_array only.

Returns the fixed capacity of the buffer.

pub const fn remaining_capacity(&self) -> NonValueU8<{ u8::MAX }>

Available on crate feature unsafe_array only.

Returns the number of additional elements that fit within the current capacity.

pub const fn remaining_capacity_prim(&self) -> u8

Available on crate feature unsafe_array only.

Returns the number of additional elements that fit within the current capacity.

pub const fn is_full(&self) -> bool

Available on crate feature unsafe_array only.

Returns true if the buffer has reached its capacity.

pub fn clear(&mut self)

Available on crate feature unsafe_array only.

Drops all initialized elements and resets the buffer.

pub const fn clear_copy(&mut self)

where T: Copy,

Available on crate feature unsafe_array only.

Resets the buffer of Copy elements.

pub fn drop_back(&mut self) -> bool

Available on crate feature unsafe_array only.

Drops the last element without returning it.

pub fn truncate(&mut self, new_len: NonValueU8<{ u8::MAX }>)

Available on crate feature unsafe_array only.

Sets the length to min(new_len, len), dropping the truncated elements.

If new_len >= len, this is a no-op.

pub const fn truncate_copy(&mut self, new_len: NonValueU8<{ u8::MAX }>)

where T: Copy,

Available on crate feature unsafe_array only.

Shortens the buffer of Copy elements.

If new_len >= len, this is a no-op.

pub fn truncate_prim(&mut self, new_len: u8) -> Result<(), InvalidValue>

Available on crate feature unsafe_array only.

Primitive-index variant of truncate,

pub const fn truncate_prim_copy( &mut self, new_len: u8, ) -> Result<(), InvalidValue>

where T: Copy,

Available on crate feature unsafe_array only.

Primitive-index variant of truncate_copy,

pub const fn push_back(&mut self, value: T) -> Result<(), T>

Available on crate feature unsafe_array only.

Appends a value to the back of the buffer.

Returns Err(value) if the buffer is full.

pub fn push_slice(&mut self, src: &[T]) -> usize

where T: Clone,

Available on crate feature unsafe_array only.

Appends as many elements cloned from src as fit.

Returns the number of elements appended.

pub const fn push_slice_copy(&mut self, src: &[T]) -> usize

where T: Copy,

Available on crate feature unsafe_array only.

Appends as many copied elements from src as fit.

Returns the number of elements appended.

pub const fn push_slice_copy_exact(&mut self, src: &[T]) -> Result<(), usize>

where T: Copy,

Available on crate feature unsafe_array only.

Appends all copied elements from src, or none if insufficient capacity.

Returns Err(remaining_capacity) if not enough space is available.

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

Available on crate feature unsafe_array only.

Removes and returns the last element.

This moves the value out without requiring T: Copy or T: Clone.

pub const fn peek_back(&self) -> Option<&T>

Available on crate feature unsafe_array only.

Returns a reference to the last element without removing it.

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

Available on crate feature unsafe_array only.

Returns an exclusive reference to the last element without removing it.

pub const fn get(&self, index: NonValueU8<{ u8::MAX }>) -> Option<&T>

Available on crate feature unsafe_array only.

Returns a reference to the element at index, if within bounds.

pub const fn get_mut( &mut self, index: NonValueU8<{ u8::MAX }>, ) -> Option<&mut T>

Available on crate feature unsafe_array only.

Returns an exclusive reference to the element at index, if within bounds.

pub fn take_default(&mut self, index: NonValueU8<{ u8::MAX }>) -> Option<T>

where T: Default,

Available on crate feature unsafe_array only.

Takes the value at index, replacing it with T::default().

pub const fn take_init(&mut self, index: NonValueU8<{ u8::MAX }>) -> Option<T>

where T: ConstInit,

Available on crate feature unsafe_array only.

Takes the value at index, replacing it with T::INIT.

pub fn take_with( &mut self, index: NonValueU8<{ u8::MAX }>, value: T, ) -> Option<T>

Available on crate feature unsafe_array only.

Takes the value at index, replacing it with value.

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

Available on crate feature unsafe_array only.

Returns the active logical range as a slice.

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

Available on crate feature unsafe_array only.

Returns the active logical range as a mutable slice.

pub fn iter(&self) -> impl Iterator<Item = &T>

Available on crate feature unsafe_array only.

Iterates over the initialized elements.

pub fn iter_mut(&mut self) -> impl Iterator<Item = &mut T>

Available on crate feature unsafe_array only.

Iterates mutably over the initialized elements.

pub fn visit_each<F>(&self, f: F)

where for<'v> F: Fn(&'v T),

Available on crate feature unsafe_array only.

Visits each initialized element without exposing borrow identity.

pub fn visit_each_mut<F>(&mut self, f: F)

where for<'v> F: Fn(&'v mut T),

Available on crate feature unsafe_array only.

Visits each initialized element mutably without exposing borrow identity.

pub fn visit_slice<F, R>(&self, f: F) -> R

where for<'v> F: FnOnce(&'v [T]) -> R,

Available on crate feature unsafe_array only.

Visits the active logical range as a shared slice of Some(T), without exposing borrow identity.

pub fn visit_mut_slice<F, R>(&mut self, f: F) -> R

where for<'v> F: FnOnce(&'v mut [T]) -> R,

Available on crate feature unsafe_array only.

Visits the active logical range as an exclusive slice of Some(T), without exposing borrow identity.

impl<T, const CAP: usize> BufferLinearStaticExample<T, [Option<T>; CAP]>

Fully initialized array using Option<T> as a drop boundary.

Invariants

• Slots 0 .. len are Some
• Slots len .. CAP are logically outside the buffer
• No holes are permitted in the active logical range.

Notes

• Option<T> is used to control initialization and dropping, not sparsity
• len is the number of elements
• Methods never access storage past len

pub const CAP: NonValueU8<{ u8::MAX }>

The fixed capacity of the buffer as the index type.

pub const CAP_PRIM: u8

The fixed capacity of the buffer as the primitive type.

pub const fn new() -> Self

Creates a buffer from a fully initialized array with logical length 0.

pub fn from_array_clone<const N: usize>(src: [T; N]) -> Self

where T: Clone,

Creates a buffer from a fully initialized array of clonable elements.

Panic

Panics if N > CAP.

pub const fn from_array_copy<const N: usize>(src: [T; N]) -> Self

where T: Copy,

Creates a buffer of Copy elements from a fully initialized array.

Panic

Panics if N > CAP.

pub const unsafe fn from_array_unchecked( array: [Option<T>; CAP], len: NonValueU8<{ u8::MAX }>, ) -> Self

Available on crate feature unsafe_array only.

Creates a buffer from an array of options and an explicit logical length, without validating the linear invariant.

Panics

Panics in debug if len > CAP.

Safety

Caller must guarantee:

• len <= CAP
• storage[0..len] are Some
• storage[len..CAP] are None

pub fn from_array_linear(array: [Option<T>; CAP]) -> Option<Self>

Creates a buffer from an array of options, validating the linear invariant.

Returns None if:

• a None appears before a Some
• any element after the active logical range is Some

pub fn from_array_prefix(array: [Option<T>; CAP]) -> Option<Self>

Creates a buffer from an array of options by taking the prefix of Some values.

The logical length is inferred as the index of the first None. Elements after the first None are ignored and need not be None.

Returns None if a None appears before a Some in the prefix.

pub fn from_slice_clone(src: &[T]) -> Option<Self>

where T: Clone,

Creates a new buffer by cloning all the possible elements from src.

pub const fn from_slice_copy(src: &[T]) -> Option<Self>

where T: Copy,

Creates a new buffer by copying all the possible elements from src.

pub const fn capacity(&self) -> NonValueU8<{ u8::MAX }>

Returns the fixed capacity of the buffer.

pub const fn capacity_prim(&self) -> u8

Returns the fixed capacity of the buffer.

pub const fn remaining_capacity(&self) -> NonValueU8<{ u8::MAX }>

Returns the number of additional elements that fit within the current capacity.

pub const fn remaining_capacity_prim(&self) -> u8

Returns the number of additional elements that fit within the current capacity.

pub const fn is_full(&self) -> bool

Returns true if the buffer has reached its capacity.

pub fn clear(&mut self)

Clears the buffer, dropping all elements.

pub const fn clear_copy(&mut self)

where T: Copy,

Clears the buffer of Copy elements.

pub fn truncate(&mut self, new_len: NonValueU8<{ u8::MAX }>)

Truncates the buffer to new_len, dropping excess elements.

If new_len >= len this is a no-op.

pub const fn truncate_copy(&mut self, new_len: NonValueU8<{ u8::MAX }>)

where T: Copy,

Truncates the buffer of Copy elements to new_len.

If new_len >= len this is a no-op.

pub fn truncate_prim(&mut self, new_len: u8) -> Result<(), InvalidValue>

Primitive-index variant of truncate,

pub const fn truncate_prim_copy( &mut self, new_len: u8, ) -> Result<(), InvalidValue>

where T: Copy,

Primitive-index variant of truncate_copy,

pub fn push_back(&mut self, value: T) -> Result<(), T>

Appends a value to the back of the buffer.

Returns Err(value) if the buffer is full.

pub const fn push_back_copy(&mut self, value: T) -> Result<(), T>

where T: Copy,

Appends a copy of value to the back of the buffer.

Returns Err(value) if the buffer is full.

pub fn push_slice(&mut self, src: &[T]) -> usize

where T: Clone,

Appends as many elements cloned from src as fit.

Returns the number of elements appended.

pub const fn push_slice_copy(&mut self, src: &[T]) -> usize

where T: Copy,

Appends as many copied elements from src as fit.

Returns the number of elements appended.

pub const fn push_slice_copy_exact(&mut self, src: &[T]) -> Result<(), usize>

where T: Copy,

Appends all copied elements from src, or none if insufficient capacity.

Returns Err(remaining_capacity) if not enough space is available.

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

Removes and returns a value from the back of the buffer.

pub const fn peek_back(&self) -> Option<&T>

Returns a reference to the last element without removing it.

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

Returns a reference to the last element without removing it.

pub const fn get(&self, index: NonValueU8<{ u8::MAX }>) -> Option<&T>

Returns a shared reference to the element at index, or None if out of bounds.

pub const fn get_mut( &mut self, index: NonValueU8<{ u8::MAX }>, ) -> Option<&mut T>

Returns an exclusive reference to the element at index, or None if out of bounds.

pub fn swap_remove(&mut self, index: NonValueU8<{ u8::MAX }>) -> Option<T>

Removes and returns the value at index, filling the gap with the last element.

Decrements len. Does not preserve order.

pub fn swap_remove_prim(&mut self, index: u8) -> Result<Option<T>, InvalidValue>

Primitive-index variant of swap_remove.

pub const fn swap_remove_copy( &mut self, index: NonValueU8<{ u8::MAX }>, ) -> Option<T>

where T: Copy,

Removes and returns the value at index, filling the gap with the last element.

Decrements len. Does not preserve order.

pub fn swap_remove_copy_prim( &mut self, index: u8, ) -> Result<Option<T>, InvalidValue>

where T: Copy,

Primitive-index variant of swap_remove_copy.

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

Returns the active logical range as a slice.

pub const fn as_mut_slice(&mut self) -> &mut [Option<T>]

Returns the active logical range as a mutable slice.

pub fn iter(&self) -> impl Iterator<Item = &T>

Iterates over the initialized elements.

pub fn iter_mut(&mut self) -> impl Iterator<Item = &mut T>

Iterates mutably over the initialized elements.

pub fn visit_each<F>(&self, f: F)

where for<'v> F: Fn(&'v T),

Visits each initialized element without exposing borrow identity.

pub fn visit_each_mut<F>(&mut self, f: F)

where for<'v> F: Fn(&'v mut T),

Visits each initialized element mutably without exposing borrow identity.

pub fn visit_slice<F, R>(&self, f: F) -> R

where for<'v> F: FnOnce(&'v [Option<T>]) -> R,

Visits the active logical range as a shared slice of Some(T), without exposing borrow identity.

pub fn visit_mut_slice<F, R>(&mut self, f: F) -> R

where for<'v> F: FnOnce(&'v mut [Option<T>]) -> R,

Visits the active logical range as an exclusive slice of Some(T), without exposing borrow identity.

Trait Implementations

impl<T: Clone, S: Clone> Clone for BufferLinearStaticExample<T, S>

fn clone(&self) -> BufferLinearStaticExample<T, S>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Copy, S: Copy> Copy for BufferLinearStaticExample<T, S>

impl<T: Debug, S: Debug> Debug for BufferLinearStaticExample<T, S>

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

Formats the value using the given formatter.

impl<T, const CAP: usize> Default for BufferLinearStaticExample<T, [MaybeUninit<T>; CAP]>

fn default() -> Self

Returns the “default value” for a type.

impl<T, const CAP: usize> Default for BufferLinearStaticExample<T, [Option<T>; CAP]>

fn default() -> Self

Returns the “default value” for a type.

impl<T: Eq, S: Eq> Eq for BufferLinearStaticExample<T, S>

impl<T: Hash, S: Hash> Hash for BufferLinearStaticExample<T, S>

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<T: Ord, S: Ord> Ord for BufferLinearStaticExample<T, S>

fn cmp(&self, other: &BufferLinearStaticExample<T, S>) -> 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.

fn clamp_to<R>(self, range: R) -> Self

where Self: Sized, R: ClampBounds<Self>,

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

Restrict a value to a certain range.

impl<T: PartialEq, S: PartialEq> PartialEq for BufferLinearStaticExample<T, S>

fn eq(&self, other: &BufferLinearStaticExample<T, S>) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl<T: PartialOrd, S: PartialOrd> PartialOrd for BufferLinearStaticExample<T, S>

fn partial_cmp( &self, other: &BufferLinearStaticExample<T, S>, ) -> 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<T: PartialEq, S: PartialEq> StructuralPartialEq for BufferLinearStaticExample<T, S>