Struct Frontier 

pub struct Frontier { /* private fields */ }

The growing edge of a log: for each level, the hashes of its partial tile. Pushing a leaf fills level 0; a level that reaches 256 hashes becomes a full tile and contributes one hash to the level above.

Implementations

impl Frontier

pub fn empty() -> Self

The frontier of the empty tree.

pub fn load(store: &impl TileStore, size: u64) -> Result<Self>

The frontier of a tree of size leaves, read from the partial tiles the store holds for that size. Refused when a partial tile is missing or has another width.

pub fn size(&self) -> u64

Leaves the frontier covers.

pub fn root(&self) -> Hash

The tree root at this size.

pub fn push(&mut self, leaf: Hash, completed: &mut Vec<(Tile, Vec<Hash>)>)

Appends one leaf hash. Every full tile the append completes is pushed to completed, level 0 first, with its hashes.

pub fn partial_tiles(&self) -> Vec<(Tile, &[Hash])>

The partial tiles at this size, with their hashes, level 0 first.

Trait Implementations

impl Clone for Frontier

fn clone(&self) -> Frontier

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Frontier

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

Formats the value using the given formatter.

impl Default for Frontier

fn default() -> Self

Returns the “default value” for a type.

impl PartialEq for Frontier

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

impl StructuralPartialEq for Frontier