Struct rc_dlist_deque::dlist::List

pub struct List<N, S> where
    S: Selector<Node = N>,  { /* fields omitted */ }

The general list type.

Use List1 if each node only needs to be on one list a time.

struct List<N, S> where S : Selector<Node=N>

Methods

impl<N, S: Selector<Node = N>> List<N, S>

pub fn new() -> Self

pub fn is_empty(&self) -> bool

pub fn first_last(&self, tail: bool) -> Cursor<N, S>

Get Some pointer to the first or last element, or None if the list is empty.

pub fn first(&self) -> Cursor<N, S>

pub fn last(&self) -> Cursor<N, S>

Important traits for ListIterator<N, S>

impl<N, S: Selector<Node = N>> Iterator for ListIterator<N, S> type Item = Pointer<N, S>;

pub fn iter(&self) -> ListIterator<N, S>

pub fn insert(
    &mut self,
    new_entry: &Pointer<N, S>,
    location: &Pointer<N, S>,
    after: bool
)

Inserts new_entry into self before or after locaation.

Panics, or tangles the list(s):

new_entry must not be on any list.

location must be on self (and not on some other list).

pub fn push_at(&mut self, new_entry: &Pointer<N, S>, tail: bool)

Inserts new_entry at the start or end of the list.

Panics, or tangles the list(s):

new_entry must not be on any list.

pub fn push_front(&mut self, n: &Pointer<N, S>)

pub fn push_back(&mut self, n: &Pointer<N, S>)

pub fn pop_at(&mut self, tail: bool) -> Cursor<N, S>

Removes the entry at the start or end of the list, returning None if the list is empty.

pub fn pop_front(&mut self) -> Cursor<N, S>

pub fn pop_back(&mut self) -> Cursor<N, S>

pub fn remove(&mut self, item: &Pointer<N, S>)

Removes item.

Panics, or tangles the list:

item must be on self.

pub fn clear(&mut self)

Trait Implementations

impl<N, S: Selector<Node = N>> Default for List<N, S>

fn default() -> Self

Returns the "default value" for a type.

impl<N, S: Selector<Node = N>> Drop for List<N, S>

fn drop(&mut self)

Executes the destructor for this type.

impl<'l, N, S: Selector<Node = N>> IntoIterator for &'l List<N, S>

type Item = Pointer<N, S>

The type of the elements being iterated over.

type IntoIter = ListIterator<N, S>

Which kind of iterator are we turning this into?

Important traits for ListIterator<N, S>

impl<N, S: Selector<Node = N>> Iterator for ListIterator<N, S> type Item = Pointer<N, S>;

fn into_iter(self) -> ListIterator<N, S>

Creates an iterator from a value.