Crate whistlinoak

Whistlin’Oak

Annotated even-arity trees backed by arbitrary memories.

Usage

whistlinoak = "0.2"

Example

use whistlinoak::{Annotation, Tree};

struct Cardinality(usize);

impl<T> Annotation<T> for Cardinality {
    fn compute(leaf: &T) -> Self {
        Cardinality(1)
    }

    fn combine<'a>(annotations: impl Iterator<Item=&'a Self>) -> Self
    where
        Self: 'a
    {
        Self(annotations.fold(0, |curr, c| curr + c.0))
    }
}

let mut tree = Tree::<usize, Cardinality>::new();

let n_leaves = 1000;

for i in 0..n_leaves {
    tree.push(i).unwrap();
}

assert_eq!(tree.len(), n_leaves);
assert_eq!(tree.root().0, n_leaves);

Modules

backend

Pluggable memory backends for a Tree.

Structs

Tree

An annotated tree structure with an arity of 2N, backed by an arbitrary memory.

Traits

Annotation

Annotation over a leaf.