Struct PinnedDeque 

pub struct PinnedDeque<T: Sized> { /* private fields */ }

Implementations

impl<T> PinnedDeque<T>

where T: Sized,

pub fn new() -> Self

Creates an empty deque with the adaptive capacity per chunk.

Caveat: The default capacity per chunk intends to fit a chunk into a memory page. So, if the size of a single element plus the chunk overhead (8B) exceeds the size of a memory page, do not use this constructor.

pub fn with_capacity_per_chunk(cap_per_chunk: u32) -> Self

Creates an empty deque with the given capacity per chunk.

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

Reserves additional capacity in order to avoid memory allocations then.

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn capacity(&self) -> usize

Returns the total capacity of the deque.

This deque do not guarantee that pushing elements will not cause memory allocations even if there is enough free capacity (i.e., capacity() - len()).

pub fn push_back(&mut self, elem: T)

pub fn push_front(&mut self, elem: T)

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

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

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

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

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

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

pub fn clear(&mut self)

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

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

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

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

Trait Implementations

impl<T> Clone for PinnedDeque<T>

where T: Sized + Clone,

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Debug for PinnedDeque<T>

where T: Sized + Debug,

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

Formats the value using the given formatter.

impl<T> Default for PinnedDeque<T>

where T: Sized,

fn default() -> Self

Returns the “default value” for a type.

impl<T> Drop for PinnedDeque<T>

where T: Sized,

fn drop(&mut self)

Executes the destructor for this type.

impl<T> Extend<T> for PinnedDeque<T>

where T: Sized,

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<'a, T> From<&'a [T]> for PinnedDeque<&'a T>

where T: Sized,

fn from(value: &'a [T]) -> Self

Converts to this type from the input type.

impl<T, const N: usize> From<[T; N]> for PinnedDeque<T>

where T: Sized,

fn from(value: [T; N]) -> Self

Converts to this type from the input type.

impl<T> From<Vec<T>> for PinnedDeque<T>

where T: Sized,

fn from(value: Vec<T>) -> Self

Converts to this type from the input type.

impl<T> FromIterator<T> for PinnedDeque<T>

where T: Sized,

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

Creates a value from an iterator.

impl<'a, T: Sized> IntoIterator for &'a PinnedDeque<T>

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, T: Sized> IntoIterator for &'a mut PinnedDeque<T>

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<T: Sized> IntoIterator for PinnedDeque<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T> Ord for PinnedDeque<T>

where T: Sized + Ord,

fn cmp(&self, other: &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<T> PartialEq for PinnedDeque<T>

where T: Sized + PartialEq,

fn eq(&self, other: &Self) -> 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<T> PartialOrd for PinnedDeque<T>

where T: Sized + PartialOrd,

fn partial_cmp(&self, other: &Self) -> 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> Eq for PinnedDeque<T>

where T: Sized + Eq,