Struct BudgetedDeque 

pub struct BudgetedDeque<T> { /* private fields */ }

Implementations

impl<T> BudgetedDeque<T>

pub fn new(budget: &MemoryBudget) -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn capacity(&self) -> usize

pub fn reserve(&mut self, additional: usize) -> Result<(), MemoryError>

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

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

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

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

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

Trait Implementations

impl<T: Debug> Debug for BudgetedDeque<T>

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

Formats the value using the given formatter.

impl<T> Index<usize> for BudgetedDeque<T>

type Output = T

The returned type after indexing.

fn index(&self, index: usize) -> &T

Performs the indexing (container[index]) operation.

impl<T> IndexMut<usize> for BudgetedDeque<T>

fn index_mut(&mut self, index: usize) -> &mut T

Performs the mutable indexing (container[index]) operation.

impl<'a, T> IntoIterator for &'a BudgetedDeque<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.