Trait adapton::catalog::collections::Level

pub trait Level: Debug + Hash + PartialEq + Eq + Clone + 'static {
    fn new<X: Hash>(_: &X) -> Self;
    fn bits() -> Self;
    fn zero() -> Self;
    fn inc(_: &Self) -> Self;
    fn add(_: &Self, _: &Self) -> Self;
    fn lte(_: &Self, _: &Self) -> bool;
    fn max_val() -> Self;

    fn max(a: &Self, b: &Self) -> Self { ... }
}

Levels for a probabilistically-balanced trees. For more details see Pugh and Teiltelbaum's POPL 1989 paper, and its "Chunky List" representation (Incremental Computation via Function Caching).

Required Methods

fn new<X: Hash>(_: &X) -> Self

fn bits() -> Self

fn zero() -> Self

fn inc(_: &Self) -> Self

fn add(_: &Self, _: &Self) -> Self

fn lte(_: &Self, _: &Self) -> bool

fn max_val() -> Self

Provided Methods

fn max(a: &Self, b: &Self) -> Self

Implementations on Foreign Types

impl Level for usize

fn new<X: Hash>(x: &X) -> Self

fn bits() -> Self

fn zero() -> Self

fn max_val() -> Self

fn add(x: &Self, y: &Self) -> Self

fn inc(x: &Self) -> Self

fn lte(x: &Self, y: &Self) -> bool

fn max(a: &Self, b: &Self) -> Self

Implementors