Struct SizeBucket 

pub struct SizeBucket { /* private fields */ }

A .dig store size quantised to a power-of-2 bucket: exponent k ∈ 0..=10 ↔ 2^k MiB (1 MB..1 GB). See the module docs for the full ladder and the canonical unit (1 MB = 1 MiB).

A SizeBucket is always valid by construction — the only ways to make one (from_exponent, for_byte_len) reject an out-of-range value — so exponent() is guaranteed to be in 0..=10.

Implementations

impl SizeBucket

pub fn from_exponent(k: u8) -> Result<SizeBucket, MerkleError>

Builds a bucket from its exponent k, rejecting k > 10 (the ladder ceiling).

Errors

Returns MerkleError::InvalidSize if k > 10 — there is no bucket larger than 1 GB.

pub fn exponent(&self) -> u8

The validated bucket exponent, always in 0..=10.

pub fn megabytes(&self) -> u32

The bucket size in megabytes (2^k, with 1 MB = 1 MiB): 1, 2, 4, … 1024.

pub fn byte_len(&self) -> u64

The bucket size in bytes (2^(k+20)): the exact byte capacity of this bucket.

pub fn for_byte_len(bytes: u64) -> Result<SizeBucket, MerkleError>

The CANONICAL byte length → bucket mapping: the SMALLEST k whose bucket (2^(k+20) bytes) is at least bytes. A store of 0 or 1 byte → k = 0; exactly 1 MiB → k = 0; 1 MiB + 1 → k = 1; exactly 1 GiB → k = 10.

This is the ergonomics dig-store’s SIZE PROOF consumes so the ladder lives in ONE place.

Errors

Returns MerkleError::InvalidSize if bytes > 2^30 (1 GiB) — beyond the ladder ceiling.

Trait Implementations

impl Clone for SizeBucket

fn clone(&self) -> SizeBucket

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for SizeBucket

impl Debug for SizeBucket

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

Formats the value using the given formatter.

impl Eq for SizeBucket

impl PartialEq for SizeBucket

fn eq(&self, other: &SizeBucket) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for SizeBucket