Struct BTreeSetDiff 

pub struct BTreeSetDiff<'daft, K: Ord + Eq> {
    pub common: BTreeSet<&'daft K>,
    pub added: BTreeSet<&'daft K>,
    pub removed: BTreeSet<&'daft K>,
}

Available on crate feature alloc only.

A diff of two BTreeSet instances.

The diff contains three elements:

• common: Entries that are present in both sets.
• added: Entries present in after, but not in before.
• removed: Entries present in before, but not in after.

Example

use daft::{BTreeSetDiff, Diffable};
use std::collections::BTreeSet;

let a: BTreeSet<usize> = [0, 1].into_iter().collect();
let b: BTreeSet<usize> = [1, 2].into_iter().collect();

let changes = a.diff(&b);
let expected = BTreeSetDiff {
    // Entries are stored by reference and matched by equality.
    common: [&1].into_iter().collect(),
    added: [&2].into_iter().collect(),
    removed: [&0].into_iter().collect(),
};

assert_eq!(changes, expected);

Fields

common: BTreeSet<&'daft K>

Entries common to both sets.

added: BTreeSet<&'daft K>

Entries present in the after set, but not in before.

removed: BTreeSet<&'daft K>

Entries present in the before set, but not in after.

Implementations

impl<'daft, K: Ord + Eq> BTreeSetDiff<'daft, K>

pub fn new() -> Self

Create a new, empty BTreeSetDiff instance.

Trait Implementations

impl<'daft, K: Debug + Ord + Eq> Debug for BTreeSetDiff<'daft, K>

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

Formats the value using the given formatter.

impl<'daft, K: Ord + Eq> Default for BTreeSetDiff<'daft, K>

fn default() -> Self

Returns the “default value” for a type.

impl<'daft, K: PartialEq + Ord + Eq> PartialEq for BTreeSetDiff<'daft, K>

fn eq(&self, other: &BTreeSetDiff<'daft, K>) -> 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<'daft, K: Eq + Ord + Eq> Eq for BTreeSetDiff<'daft, K>

impl<'daft, K: Ord + Eq> StructuralPartialEq for BTreeSetDiff<'daft, K>