Struct LabelSet 

pub struct LabelSet(/* private fields */);

Sorted set of graph labels.

Implementations

impl LabelSet

pub fn new() -> Self

Construct an empty label set.

pub fn from_iter(labels: impl IntoIterator<Item = DbString>) -> Self

Construct a label set from an iterator, sorting and deduplicating.

pub fn single(label: DbString) -> Self

Construct a single-label set.

pub fn edge(label: DbString) -> Self

Construct the one-label view used by edge APIs.

pub fn insert(&mut self, label: DbString) -> bool

Insert a label, returning true when it was not already present.

pub fn remove(&mut self, label: &DbString) -> bool

Remove a label, returning true when it was present.

pub fn contains(&self, label: &DbString) -> bool

Return true if label is present.

pub fn len(&self) -> usize

Number of labels.

pub fn is_empty(&self) -> bool

Return true if no labels are present.

pub fn iter(&self) -> impl Iterator<Item = &DbString>

Iterate labels in sorted DbString order.

Trait Implementations

impl Archive for LabelSet

type Archived = ArchivedVec<<DbString as Archive>::Archived>

The archived representation of this type.

type Resolver = VecResolver

The resolver for this type. It must contain all the additional information from serializing needed to make the archived type from the normal type.

fn resolve(&self, resolver: Self::Resolver, out: Place<Self::Archived>)

Creates the archived version of this value at the given position and writes it to the given output.

const COPY_OPTIMIZATION: CopyOptimization<Self> = _

An optimization flag that allows the bytes of this type to be copied directly to a writer instead of calling serialize.

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() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for LabelSet

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

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<D> Deserialize<LabelSet, D> for ArchivedVec<Archived<DbString>>

where D: Fallible + ?Sized, D::Error: Source, Archived<DbString>: RkyvDeserialize<DbString, D>,

fn deserialize(&self, deserializer: &mut D) -> Result<LabelSet, D::Error>

Deserializes using the given deserializer

impl Eq for LabelSet

impl FromIterator<DbString> for LabelSet

fn from_iter<T: IntoIterator<Item = DbString>>(iter: T) -> Self

Creates a value from an iterator.

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

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

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<S> Serialize<S> for LabelSet

where S: Fallible + Allocator + Writer + ?Sized, DbString: RkyvSerialize<S>,

fn serialize(&self, serializer: &mut S) -> Result<Self::Resolver, S::Error>

Writes the dependencies for the object and returns a resolver that can create the archived type.

impl StructuralPartialEq for LabelSet