Struct BBTree

pub struct BBTree {
    pub nodes: HashMap<i32, BBNode>,
    /* private fields */
}

Main data scructure for parsed BBCode, usually a root node and child nodes

Fields

nodes: HashMap<i32, BBNode>

Nodes stored in the tree

Implementations

impl BBTree

pub fn get_node(&self, i: i32) -> &BBNode

Get a node by ID

pub fn get_node_mut(&mut self, i: i32) -> &mut BBNode

Get a node as mutable by ID

pub fn add_node(&mut self, node: BBNode) -> i32

Add a new node and return the new node ID

pub fn get_depth(&self, i: i32) -> usize

Recursive (I know…) function to get the depth of a given node ID in the tree

Trait Implementations

impl Clone for BBTree

fn clone(&self) -> BBTree

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for BBTree

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

Formats the value using the given formatter.

impl Default for BBTree

fn default() -> Self

Returns the “default value” for a type.

impl Display for BBTree

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

Formats the value using the given formatter.

impl PartialEq for BBTree

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

impl StructuralPartialEq for BBTree