Struct Tile 

pub struct Tile {
    pub level: u8,
    pub index: u64,
    pub width: u16,
}

One tile: its level, its index within the level and how many hashes it holds. width is 256 for a full tile and 1 to 255 for a partial one.

Fields

level: u8

0 for leaf hashes; each level up covers 256 times as many leaves.

index: u64

Position within the level.

width: u16

Hashes in the tile, 1 to 256.

Implementations

impl Tile

pub fn new(level: u8, index: u64, width: u16) -> Result<Self>

A tile; width outside 1 to 256 is refused.

pub fn is_full(&self) -> bool

Whether the tile holds 256 hashes.

pub fn path(&self) -> String

tile/<L>/<N> for a full tile, tile/<L>/<N>.p/<W> for a partial.

pub fn parse(path: &str) -> Option<Self>

The tile a store path names, or nothing when the path is not a hash tile path. tile/entries/... and tile/index/... are not hash tiles.

Trait Implementations

impl Clone for Tile

fn clone(&self) -> Tile

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Tile

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

Formats the value using the given formatter.

impl Hash for Tile

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 Tile

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

impl Eq for Tile

impl StructuralPartialEq for Tile