Struct Buffer 

struct Buffer<T, const N: usize> {
    buffer: [[MaybeUninit<T>; N]; 2],
    start: usize,
}

Buffer<T, N> is semantically [MaybeUninit<T>; 2 * N]. This helps reduce moves while iterating. However, due to limitations of const generics, we use this different type. Note that it has the same underlying memory layout.

Safety invariant

self.buffer[self.start..self.start + N] must be initialized, with all other elements being uninitialized. This also implies that self.start <= N.

Fields

buffer: [[MaybeUninit<T>; N]; 2]

start: usize

Implementations

impl<T, const N: usize> Buffer<T, N>

fn try_from_iter(iter: &mut impl Iterator<Item = T>) -> Option<Self>

fn buffer_ptr(&self) -> *const MaybeUninit<T>

fn buffer_mut_ptr(&mut self) -> *mut MaybeUninit<T>

fn as_array_ref(&self) -> &[T; N]

fn as_uninit_array_mut(&mut self) -> &mut MaybeUninit<[T; N]>

fn push(&mut self, next: T)

Pushes a new item next to the back, and pops the front-most one.

All the elements will be shifted to the front end when pushing reaches the back end.

Trait Implementations

impl<T: Clone, const N: usize> Clone for Buffer<T, N>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

where Self:,

Performs copy-assignment from source.

impl<T, const N: usize> Drop for Buffer<T, N>

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics #130494)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.