Struct DoublyLinkedListNode 

#[repr(C)]
pub struct DoublyLinkedListNode<T> {
    pub next: UnsafeCell<*mut T>,
    pub prev: UnsafeCell<*mut T>,
}

A node in a doubly linked list.

Fields

next: UnsafeCell<*mut T>

The next element in the list.

prev: UnsafeCell<*mut T>

The previous element in the list.

Implementations

impl<T> DoublyLinkedListNode<T>

pub const fn new() -> Self

Creates a new, unlinked node.

pub fn in_container(&self) -> bool

Returns true if the node is currently in a list.

Trait Implementations

impl<T> Debug for DoublyLinkedListNode<T>

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

Formats the value using the given formatter.

impl<T> Default for DoublyLinkedListNode<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> Drop for DoublyLinkedListNode<T>

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.