Struct Node

#[repr(C)]
pub struct Node<T>
where
    T: Zeroable,
{ /* private fields */ }

A node in the singly linked list.

This structure holds an optional pointer to the value (item) and the next node (next) in the list. The pointers are managed through TESBox, which allocates memory from the custom memory manager.

Safety

The item and next are raw pointers that must be safely dropped using TESBox to avoid memory leaks. If not dropped correctly, memory leakage can occur.

Note

This list assumes that nodes with zero-initialized values (item) are considered “empty” nodes. You should not use such nodes directly as they might be unsafe unless they are properly initialized. This pattern is a consequence of handling raw pointers and being FFI-compatible.

Implementations

impl<T> Node<T>

where T: Zeroable,

pub const fn new(item: T, next: Option<NonNull<Self>>) -> Self

Creates a new node containing the given item and pointing to the given next node.

Example

let node = Node::new(10, None);

pub const fn new_empty() -> Self

Creates an empty node with no value and no next pointer.

Example

let empty_node = Node::<i32>::new_empty();

Trait Implementations

impl<T> Default for Node<T>

where T: Zeroable,

fn default() -> Self

Returns the “default value” for a type.

impl<T> PartialEq for Node<T>

where T: Zeroable + PartialEq,

fn eq(&self, other: &Node<T>) -> 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<T> StructuralPartialEq for Node<T>

where T: Zeroable,