Struct LinkedList

pub struct LinkedList {
    pub head: *mut usize,
}

An intrusive linked list

A clean room implementation of the one used in CS140e 2018 Winter

Thanks Sergio Benitez for his excellent work, See CS140e for more information

Fields

head: *mut usize

Implementations

impl LinkedList

pub const fn new() -> LinkedList

Creates a new LinkedList.

pub fn empty(&self) -> bool

Return true if the list is empty.

pub unsafe fn push(&mut self, item: *mut usize)

Push item to the front of the list.

Arguments

• item - A *mut usize item list.

Safety

Unsafe because we are working with raw pointers.

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

Try to remove the first item from the list.

pub fn iterator(&self) -> Iter<'_>

Get an iterator over the items in the list.

pub fn iterator_mut(&mut self) -> IterMut<'_>

Get a mutable iterator over the items in the list.

Trait Implementations

impl Clone for LinkedList

fn clone(&self) -> LinkedList

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for LinkedList

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

Formats the value using the given formatter.

impl Copy for LinkedList

impl Send for LinkedList