Struct Tree 

pub struct Tree(pub BTreeMap<String, Box<Tree>>);

Tuple Fields

0: BTreeMap<String, Box<Tree>>

Trait Implementations

impl Clone for Tree

fn clone(&self) -> Tree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Tree

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

Formats the value using the given formatter.

impl Default for Tree

fn default() -> Tree

Returns the “default value” for a type.

impl Drop for Tree

Drops the tree without recursion.

The derived drop of Box<Tree> recurses once per level, so a deep tree would overflow the stack when it goes out of scope, even if it was built and printed iteratively. The maps are taken out one by one instead; every child is dropped with an empty map.

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.

impl PartialEq for Tree

fn eq(&self, other: &Tree) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Tree