Struct NodeDiff

pub struct NodeDiff<Id: Hash + Eq, T> { /* private fields */ }

A diff between the nodes of a graph.

Implementations

impl<Id: Hash + Eq, T> NodeDiff<Id, T>

pub fn new( new_or_updated: HashMap<Id, T>, deleted: HashSet<Id>, ) -> NodeDiff<Id, T>

pub fn get_new_or_updated(&self) -> &HashMap<Id, T>

pub fn get_deleted(&self) -> &HashSet<Id>

Trait Implementations

impl<Id: Hash + Eq + Copy, T: Default + AddAssign> AddAssign<NodeDiff<Id, T>> for GraphDiff<Id, T>

fn add_assign(&mut self, nodes: NodeDiff<Id, T>)

Performs the += operation.

impl<Id: Clone + Hash + Eq, T: Clone> Clone for NodeDiff<Id, T>

fn clone(&self) -> NodeDiff<Id, T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<Id: Debug + Hash + Eq, T: Debug> Debug for NodeDiff<Id, T>

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

Formats the value using the given formatter.

impl<'de, Id, T> Deserialize<'de> for NodeDiff<Id, T>

where Id: Deserialize<'de> + Hash + Eq, T: Deserialize<'de>,

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<Id: PartialEq + Hash + Eq, T: PartialEq> PartialEq for NodeDiff<Id, T>

fn eq(&self, other: &NodeDiff<Id, T>) -> 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<Id, T> Serialize for NodeDiff<Id, T>

where Id: Serialize + Hash + Eq, T: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<Id: Hash + Eq, T> StructuralPartialEq for NodeDiff<Id, T>