Struct TreeNode

pub struct TreeNode {
    pub name: String,
    pub path: String,
    pub nodes: Option<Vec<TreeNode>>,
}

Fields

name: String

path: String

nodes: Option<Vec<TreeNode>>

Implementations

impl TreeNode

pub fn new(name: String, path: String, nodes: Option<Vec<TreeNode>>) -> Self

pub fn find_node(&mut self, name: &str) -> Option<&mut TreeNode>

pub fn print_children(&self, level: u32)

pub fn add_node(&mut self, node: TreeNode)

pub fn add_nodes(&mut self, nodes: Vec<TreeNode>)

pub fn sort_nodes_alphabetically(head: &mut TreeNode)

pub fn generate_summary(&self, level: usize) -> Vec<String>

pub fn generate_summary_string(&self) -> String

Trait Implementations

impl PartialEq for TreeNode

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