Struct DynamicLabelSet 

pub struct DynamicLabelSet { /* private fields */ }

Canonicalized runtime label set.

Labels are deduplicated by key (last value wins) and sorted by key to ensure stable identity regardless of input order.

Implementations

impl DynamicLabelSet

pub fn from_pairs(labels: &[(&str, &str)]) -> Self

Build a canonical label set from borrowed key/value pairs.

pub fn pairs(&self) -> &[(String, String)]

Returns labels as ordered (key, value) pairs.

Trait Implementations

impl Clone for DynamicLabelSet

fn clone(&self) -> DynamicLabelSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DynamicLabelSet

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

Formats the value using the given formatter.

impl Hash for DynamicLabelSet

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for DynamicLabelSet

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

impl StructuralPartialEq for DynamicLabelSet