Struct Tree 

pub struct Tree {
    pub label: Option<Box<dyn Content>>,
    pub content: Box<dyn Content>,
    pub subtrees: Vec<Tree>,
}

A tree node containing content and child subtrees.

Trees are built from a root node with zero or more child nodes, each of which can have their own children. Nodes can optionally have labels that appear alongside their content.

Example

use tree_display::{Tree, format::Member};

let tree = Tree::leaf("root")
    .labeled(Member::new("label"));

Fields

label: Option<Box<dyn Content>>

Optional label displayed next to the content

content: Box<dyn Content>

The main content of this node

subtrees: Vec<Tree>

Child subtrees

Implementations

impl Tree

pub fn new(content: impl Content, subtrees: Vec<Tree>) -> Tree

Creates a new tree node with content and children.

pub fn leaf(content: impl Content) -> Tree

Creates a leaf node (a node with no children).

pub fn labeled(self, label: impl Content) -> Self

Adds a label to the node.

Labels appear before the content, typically as a key or name.

pub fn is_leaf(&self) -> bool

Returns whether this node is a leaf (has no children).