Struct LinkedList

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

The ❤️ of the module

Implementations

impl<T: Clone> LinkedList<T>

pub fn new() -> LinkedList<T>

Creates a new list

pub fn push(&mut self, data: T)

Adds a node to the head of the list/stack

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

Removes/returns the head of the list/stack (if Some) in O(1) time

pub fn enqueue(&mut self, data: T)

Adds a node to the tail of the list/queue in O(n) time;

TODO: Safely implement a way to store a reference to the last node in the list for O(1) enqueue operations

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

Removes/returns the head of the list (if Some) in O(1) time

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

Returns a reference to the head of the list (if Some) in O(1) time

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

Returns an iterator of references to data in the list’s nodes

Trait Implementations

impl<T: Clone> Default for LinkedList<T>

fn default() -> Self

Returns the “default value” for a type.