Struct generational_cache::collections::list::LinkedList

pub struct LinkedList<V, T> { /* private fields */ }

A double-linked linked list implementation powered by a generational arena.

Implementations

impl<V, T> LinkedList<V, T>

where V: Vector<Entry<Node<T>>>,

pub fn with_backing_vector(vector: V) -> Self

pub fn clear(&mut self) -> Result<(), ListError<V::Error>>

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

pub fn capacity(&self) -> usize

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn get_mut(&mut self, link: &Link) -> Option<&mut T>

pub fn get(&self, link: &Link) -> Option<&T>

pub fn push_front(&mut self, value: T) -> Result<Link, ListError<V::Error>>

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

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

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

pub fn unlink(&mut self, link: &Link) -> Option<Link>

pub fn remove(&mut self, link: &Link) -> Option<T>

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

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

pub fn shift_push_front(&mut self, link: &Link) -> Option<()>

pub fn shift_push_back(&mut self, link: &Link) -> Option<()>

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

Trait Implementations

impl<V, T> Default for LinkedList<V, T>

where V: Default + Vector<Entry<Node<T>>>,

fn default() -> Self

Returns the “default value” for a type.

impl<'a, V, T> IntoIterator for &'a LinkedList<V, T>

where V: Vector<Entry<Node<T>>>,

type Item = (&'a Link, &'a T)

The type of the elements being iterated over.

type IntoIter = Iter<'a, V, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.