Struct TreeNodeData 

pub struct TreeNodeData {
    pub id: String,
    pub label: String,
    pub icon: Option<String>,
    pub children: Vec<TreeNodeData>,
    pub disabled: bool,
}

Tree node data structure for recursive tree representation

Fields

id: String

Unique identifier for the node

label: String

Display label for the node

icon: Option<String>

Optional icon name for the node

children: Vec<TreeNodeData>

Child nodes (empty if leaf node)

disabled: bool

Whether the node is disabled

Implementations

impl TreeNodeData

pub fn new(id: impl Into<String>, label: impl Into<String>) -> Self

Create a new tree node

pub fn with_icon(self, icon: impl Into<String>) -> Self

Set the icon for the node

pub fn with_child(self, child: TreeNodeData) -> Self

Add a child node

pub fn with_children(self, children: Vec<TreeNodeData>) -> Self

Set multiple children at once

pub fn disabled(self, disabled: bool) -> Self

Set disabled state

pub fn is_leaf(&self) -> bool

Check if this is a leaf node (no children)

Trait Implementations

impl Clone for TreeNodeData

fn clone(&self) -> TreeNodeData

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl PartialEq for TreeNodeData

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