Struct Node 

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

Implementations

impl<T> Node<T>

pub const fn new(val: T) -> Self

pub fn next<'b>(&mut self) -> Option<&'b mut Node<T>>

pub fn take_next<'b>(&mut self) -> Option<&'b mut Node<T>>

pub fn last(&mut self) -> &mut Node<T>

pub unsafe fn push(&mut self, node: &mut Node<T>)

Adds a node to the LinkedList.

Safety

This function is only safe as long as node is guaranteed to get removed from the list before it gets moved or dropped.

pub unsafe fn push_list(&mut self, node: &mut Node<T>)

Adds a list to the LinkedList.

Safety

This function is only safe as long as node is guaranteed to get removed from the list before it gets moved or dropped.

pub fn remove_node(&mut self, node: &mut Node<T>) -> bool

remove child which eq node.

Notice: can’t remove head node.

pub fn into_iter(&mut self) -> NodeIter<'_, T>

Trait Implementations

impl<T> Deref for Node<T>

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T> DerefMut for Node<T>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.