Struct CounterTable

pub struct CounterTable<T, C> {
    pub columns: BTreeMap<C, Column>,
    pub rows: RwLock<BTreeMap<T, BTreeMap<C, u32>>>,
}

Fields

columns: BTreeMap<C, Column>

rows: RwLock<BTreeMap<T, BTreeMap<C, u32>>>

Implementations

impl<T, C> CounterTable<T, C>

where C: Ord + Clone, T: Ord,

pub fn with_columns(self, columns: Vec<(C, &'static str, bool)>) -> Self

builder pattern to add columns

pub fn add_row(&self, row_id: T)

create a row and add counter columns

pub fn remove_row(&self, row_id: &T)

remove counter row

pub fn row_count(&self) -> usize

number of rows

pub fn inc_counter(&self, row_id: &T, column_id: C)

increment counter

pub fn set_counter(&self, row_id: &T, column_id: C, val: u32)

set counter

pub fn reset_counters(&self)

reset all counters

pub fn header_fmt(&self) -> String

column headers in string format (center justified, min 10 spaces)

pub fn values_fmt(&self, row_id: T) -> String

format values in string format (center justified to column header - min 10 spaces)

Trait Implementations

impl<T: Debug, C: Debug> Debug for CounterTable<T, C>

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

Formats the value using the given formatter.

impl<T, C> Default for CounterTable<T, C>

where C: Ord, T: Ord,

fn default() -> Self

Returns the “default value” for a type.

impl<T, C> PartialEq for CounterTable<T, C>

where C: PartialEq, T: PartialEq,

fn eq(&self, other: &CounterTable<T, C>) -> 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.