Struct rc_dlist_deque::dlist::Node1

pub struct Node1<T> { /* fields omitted */ }

Node on a simple list.

For when each node is only on one list.

T is your own data. You will often want T to be a Cell or a RefCell, since you won't generally have mutable access to it.

Normally you will refer to nodes via Pointer1, which contains an Rc<Node1>, or via Cursor1, which is Option<Pointer1<_>>

struct Node1<T>

Methods

impl<T> Node1<T>

pub fn new(data: T) -> Self

Wraps up data into a node struct.

You'll normally want pointer instead.

pub fn pointer(data: T) -> Pointer1<T>

Wraps up data into a node and an Rc, giving a pointer (a reference) ready to be put onto a list.

Trait Implementations

impl<T> Default for Node1<T> where
    T: Default, 

fn default() -> Node1<T>

Returns the "default value" for a type.

impl<T> Deref for Node1<T>

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &T

Dereferences the value.

impl<T> DerefMut for Node1<T>

fn deref_mut(&mut self) -> &mut T

Mutably dereferences the value.