Enum IdTree

pub enum IdTree {
    Zero,
    One,
    SubTree(Box<IdTree>, Box<IdTree>),
}

A near one-to-one replication of the original paper.

Variants

Zero

One

SubTree(Box<IdTree>, Box<IdTree>)

Implementations

impl IdTree

pub fn new() -> Self

Initial tree is the full interval (1)

pub fn fork(self) -> (Self, Self)

Consumes to create id_left and id_right

pub fn join(self, other: Self) -> Self

Consumes to merge two ids

Trait Implementations

impl Clone for IdTree

fn clone(&self) -> IdTree

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for IdTree

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

Formats the value using the given formatter.

impl Default for IdTree

fn default() -> IdTree

Returns the “default value” for a type.

impl Display for IdTree

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

Formats the value using the given formatter.

impl Hash for IdTree

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for IdTree

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

impl StructuralPartialEq for IdTree