Struct Node

pub struct Node {
    pub kind: NodeKind,
    pub key: Option<Key>,
    pub children: Vec<Node>,
}

Minimal recursive node used by compatibility integrations.

This type stores no widget behavior, layout, or state. key is optional and scoped to reconciliation among siblings; children retain insertion order.

Examples

use ailloli_ui_runtime::component::{Node, NodeKind};
let node = Node::leaf(NodeKind::Primitive);
assert!(node.key.is_none());
assert!(node.children.is_empty());

Fields

kind: NodeKind

Coarse semantic category.

key: Option<Key>

Optional stable sibling identity.

children: Vec<Node>

Ordered recursive children.

Implementations

impl Node

Provides the operations defined for Node.

pub fn leaf(kind: NodeKind) -> Self

Creates an unkeyed node with no children.

Examples

use ailloli_ui_runtime::component::{Node, NodeKind};
let node = Node::leaf(NodeKind::Control);
assert_eq!(node.kind, NodeKind::Control);
assert_eq!(node.children.len(), 0);

Trait Implementations

impl Clone for Node

fn clone(&self) -> Node

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Node

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

Formats the value using the given formatter.

impl PartialEq for Node

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