Struct re_int_histogram::tree::SparseLeaf

struct SparseLeaf {
    addrs: SmallVec<[u64; 3]>,
    counts: SmallVec<[u32; 3]>,
}

Fields

addrs: SmallVec<[u64; 3]>

Two vectors of equal lengths, making up (addr, count) pairs, sorted by addr.

counts: SmallVec<[u32; 3]>

The count may never be zero.

Implementations

impl SparseLeaf

fn increment(self, level: u64, abs_addr: u64, inc: u32) -> Node

fn into_branch_node(self, level: u64) -> BranchNode

Called on overflow

fn decrement(&mut self, abs_addr: u64, dec: u32) -> u32

Returns how much the total count decreased by.

fn remove(&mut self, range: RangeU64) -> u64

Returns how much the total count decreased by.

fn is_empty(&self) -> bool

fn total_count(&self) -> u64

fn min_key(&self) -> Option<u64>

fn max_key(&self) -> Option<u64>

fn range_count(&self, range: RangeU64) -> u64

Trait Implementations

impl Clone for SparseLeaf

fn clone(&self) -> SparseLeaf

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for SparseLeaf

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

Formats the value using the given formatter.

impl Default for SparseLeaf

fn default() -> SparseLeaf

Returns the “default value” for a type.