Struct BTreeMapDiff

pub struct BTreeMapDiff<K: Ord + Eq, V: Diff> {
    pub altered: BTreeMap<K, <V as Diff>::Repr>,
    pub removed: BTreeSet<K>,
}

The diff struct used to compare two BTreeMap’s

Fields

altered: BTreeMap<K, <V as Diff>::Repr>

Values that are changed or added

removed: BTreeSet<K>

Values that are removed

Trait Implementations

impl<K, V: Diff> Clone for BTreeMapDiff<K, V>

where K: Clone + Ord, V::Repr: Clone,

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K, V: Diff> Debug for BTreeMapDiff<K, V>

where K: Debug + Ord, V::Repr: Debug,

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

Formats the value using the given formatter.

impl<'de, K, V: Diff> Deserialize<'de> for BTreeMapDiff<K, V>

where V::Repr: Deserialize<'de>, K: Deserialize<'de> + Ord + Eq,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<K: Ord, V: Diff> PartialEq for BTreeMapDiff<K, V>

where V::Repr: PartialEq,

fn eq(&self, other: &Self) -> 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<K, V: Diff> Serialize for BTreeMapDiff<K, V>

where V::Repr: Serialize, K: Serialize + Ord + Eq,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.