Struct Node

pub struct Node<A, B: NextNode> {
    pub data: A,
    pub next: B,
}

Represents a collection of one or more objects.

Fields

data: A

The object held in this node

next: B

Next is any type implementing the NextNode trait. Typically this will be a node whose next field also implements NextNode (representing a collection of one or more nested node) or the unit type (representing an empty composite).

Implementations

impl<A, B: NextNode> Node<A, B>

pub fn new(data: A, next: B) -> Self

Build a new node

Arguments

• data - The object held in this node in the composite
• next - The next node in the data structure.

impl<A> Node<A, ()>

pub fn base(data: A) -> Self

Build a new Node where the next field is the unit type.

Trait Implementations

impl<A: Debug, B: Debug + NextNode> Debug for Node<A, B>

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

Formats the value using the given formatter.

impl<A: PartialEq, B: PartialEq + NextNode> PartialEq for Node<A, B>

fn eq(&self, other: &Node<A, B>) -> 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<A, B: NextNode> NextNode for Node<A, B>

impl<A, B: NextNode> StructuralPartialEq for Node<A, B>