Struct LinkedList

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

About

All operations run in O(1) time unless otherwise noted. See the module-level documentation for more information.

Implementations

impl<T> LinkedList<T>

pub fn new() -> LinkedList<T>

Creates a new list

pub fn push_head(&mut self, element: T)

Inserts a node at the head of the list.

Can be used like a push(k) or add(k) operation for a stack.

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

Returns a reference to the data at the list’s head, if the list has a head node.

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

Returns a reference to the data at the list’s tail, if the list has a tail.

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

Returns an owned value of the head Node’s data. Use like a pop() or a dequeue() operation for a stack or queue.

pub fn push_tail(&mut self, element: T)

Inserts a node at the tail of the list. Use like an enqueue() operation for a queue.

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

Removes and returns the tail node of the list.

pub fn len(&self) -> usize

Returns the length of the list.

pub fn is_empty(&self) -> bool

Returns a Boolean indicating whether the list is empty.

pub fn clear(&mut self)

Clears all elements from the list in O(n) time.

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

Returns an iterator of references to data in the list’s nodes as list.iter().

pub fn cursor_mut(&mut self) -> CursorMut<'_, T>

Acts like a constructor for a cursor.

Trait Implementations

impl<T: Debug> Debug for LinkedList<T>

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

Formats the value using the given formatter.

impl<T> Default for LinkedList<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> Drop for LinkedList<T>

fn drop(&mut self)

Executes the destructor for this type.