Struct LabelSet 

pub struct LabelSet { /* private fields */ }

A canonical representation for sets of labels. You should only use the impl functions to modify this.

Implementations

impl LabelSet

pub fn is_empty(&self) -> bool

pub fn iter(&self) -> Iter<'_, LabelId>

pub fn labels(&self) -> &[LabelId]

pub fn len(&self) -> usize

pub fn new(labels: Box<[LabelId]>) -> Self

Trait Implementations

impl Clone for LabelSet

fn clone(&self) -> LabelSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LabelSet

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

Formats the value using the given formatter.

impl Default for LabelSet

fn default() -> LabelSet

Returns the “default value” for a type.

impl Hash for LabelSet

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 Item for LabelSet

type Id = LabelSetId

The Id associated with this Item, e.g. Function -> FunctionId.

impl PartialEq for LabelSet

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

impl StructuralPartialEq for LabelSet