Struct arborist::Tree

pub struct Tree { /* fields omitted */ }

Methods

impl Tree

pub fn new() -> Self

pub fn to_subtree(self, root: K) -> Self

pub fn get(&self, key: &K) -> Option<&V>

pub fn insert(&mut self, key: K, val: V) -> Option<V>

pub fn keys(&self) -> BTreeSet<K>

pub fn fill_subtree(&mut self, root: K, depth: u32, default: &V)

pub fn trim(self) -> Self

pub fn raw_insert_bytes(&mut self, rooted_at: K, bytes: Vec<u8>)

pub fn insert_bytes(&mut self, rooted_at: K, bytes: Vec<u8>)

pub fn insert_subtree(&mut self, rooted_at: K, tree: Tree)

Trait Implementations

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 From<BTreeMap<u128, [u8; 32]>> for Tree

fn from(map: BTreeMap<K, V>) -> Tree

Performs the conversion.

impl From<Tree> for BTreeMap<K, V>

fn from(tree: Tree) -> BTreeMap<K, V>

Performs the conversion.

impl PartialEq<Tree> for Tree

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

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

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

This method tests for !=.

impl StructuralPartialEq for Tree