Struct LinkedList 

pub struct LinkedList<Data, Container, Ix> {
    pub start: Option<Ix>,
    marker: PhantomData<(Data, Container)>,
}

Fields

start: Option<Ix>

marker: PhantomData<(Data, Container)>

Implementations

impl<Data, Container, Ix> LinkedList<Data, Container, Ix>

where Container: IndexMut<Ix, Output = LinkedListEntry<Data, Ix>>, Ix: PartialEq + Copy,

pub fn new() -> Self

pub fn push_front(&mut self, push_ix: Ix, container: &mut Container)

pub fn pop(&mut self, container: &mut Container) -> Option<Ix>

pub fn remove(&mut self, remove_ix: Ix, container: &mut Container)

remove_ix must be a member of the list headed by self

fn to_vec(&self, container: &mut Container) -> Vec<Ix>

For debug purposes

Trait Implementations

impl<Data: Debug, Container: Debug, Ix: Debug> Debug for LinkedList<Data, Container, Ix>

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

Formats the value using the given formatter.

impl<Data: PartialEq, Container: PartialEq, Ix: PartialEq> PartialEq for LinkedList<Data, Container, Ix>

fn eq(&self, other: &LinkedList<Data, Container, Ix>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<Data, Container, Ix> StructuralPartialEq for LinkedList<Data, Container, Ix>