Struct Counters 

pub struct Counters<T> {
    pub list: BTreeMap<T, Counter>,
}

Fields

list: BTreeMap<T, Counter>

Implementations

impl<T> Counters<T>

where T: Ord,

pub fn new(items: Vec<(T, &'static str, bool)>) -> Self

build counter from array of tuples

pub fn inc_counter(&mut self, id: T)

increment counter

pub fn set_counter(&mut self, id: T, val: u32)

increment counter

pub fn reset(&mut self)

reset counters

pub fn header_fmt(&self) -> String

counter heders in string format (center justified, min 10 spaces)

pub fn values_fmt(&self) -> String

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

Trait Implementations

impl<T: Debug> Debug for Counters<T>

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

Formats the value using the given formatter.

impl<T> Default for Counters<T>

where T: Ord,

fn default() -> Self

Returns the “default value” for a type.

impl<T: PartialEq> PartialEq for Counters<T>

fn eq(&self, other: &Counters<T>) -> 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<T> StructuralPartialEq for Counters<T>