Struct LinkedList

pub struct LinkedList { /* private fields */ }

Doubly linked list

Implementations

impl LinkedList

pub fn with_capacity(capacity: usize) -> Self

Create a LinkedList with the given predicted capacity.

pub fn len(&self) -> usize

How many nodes in the list

pub fn peek(&self, index: usize) -> Option<u64>

Peek into the list

pub fn exist_near_head(&self, value: u64, search_limit: usize) -> bool

Whether the value exists closed (up to search_limit nodes) to the head of the list

pub fn push_head(&mut self, data: u64) -> usize

Put the data at the head of the list.

pub fn push_tail(&mut self, data: u64) -> usize

Put the data at the tail of the list.

pub fn remove(&mut self, index: usize) -> u64

Remove the node at the index, and return the value

pub fn pop_tail(&mut self) -> Option<u64>

Remove the tail of the list

pub fn promote(&mut self, index: usize)

Put the node at the index to the head

pub fn head(&self) -> Option<usize>

Get the head of the list

pub fn tail(&self) -> Option<usize>

Get the tail of the list

pub fn iter(&self) -> LinkedListIter<'_>

Iterate over the list