Struct CounterSet

pub struct CounterSet {
    pub counters: BTreeMap<String, Counter>,
    pub name: String,
}

CounterSet defines a named set of counters that are available to be used by devices defined in the ResourceSlice.

The counters are not allocatable by themselves, but can be referenced by devices. When a device is allocated, the portion of counters it uses will no longer be available for use by other devices.

Fields

counters: BTreeMap<String, Counter>

Counters defines the set of counters for this CounterSet The name of each counter must be unique in that set and must be a DNS label.

The maximum number of counters is 32.

name: String

Name defines the name of the counter set. It must be a DNS label.

Trait Implementations

impl Clone for CounterSet

fn clone(&self) -> CounterSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CounterSet

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

Formats the value using the given formatter.

impl DeepMerge for CounterSet

fn merge_from(&mut self, other: Self)

Merge other into self.

impl Default for CounterSet

fn default() -> CounterSet

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for CounterSet

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for CounterSet

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

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for CounterSet