Struct LabelDiff 

pub struct LabelDiff {
    pub added: SmallVec<[DbString; 2]>,
    pub removed: SmallVec<[DbString; 2]>,
}

Label set difference.

Fields

added: SmallVec<[DbString; 2]>

Labels added by the mutation.

removed: SmallVec<[DbString; 2]>

Labels removed by the mutation.

Implementations

impl LabelDiff

pub fn new( added: impl IntoIterator<Item = DbString>, removed: impl IntoIterator<Item = DbString>, ) -> CoreResult<Self>

Construct a sorted, deduplicated label diff.

Errors

Returns CoreError::OverlappingDiff when a label appears in both added and removed. Contradictory diffs would make WAL replay order-dependent, so the constructor refuses to build them.

pub fn is_empty(&self) -> bool

Return true if no labels changed.

Trait Implementations

impl Clone for LabelDiff

fn clone(&self) -> LabelDiff

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LabelDiff

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for LabelDiff

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

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for LabelDiff

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

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 LabelDiff