Struct rustrees::Tree

pub struct Tree { /* private fields */ }

An arena-based tree implementation. Each node is stored in a vector and the children are accessed by index.

Having all the nodes in a vector allows for a more cache-friendly implementation. And accessing them by index allows to avoid borrow checker issues related to having recursive data structures.

Trait Implementations

impl Debug for Tree

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

Formats the value using the given formatter.

impl PartialEq for Tree

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

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.