Struct EdgeDiff

pub struct EdgeDiff<Id: Hash + Eq, W = f32> { /* private fields */ }

A diff between the edges of a graph.

Implementations

impl<Id: Hash + Eq> EdgeDiff<Id>

pub fn new( new_or_updated: HashMap<Id, HashMap<Id, f32>>, deleted: HashMap<Id, HashSet<Id>>, ) -> EdgeDiff<Id>

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

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

Trait Implementations

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

fn add_assign(&mut self, edges: EdgeDiff<Id>)

Performs the += operation.

impl<Id: Clone + Hash + Eq, W: Clone> Clone for EdgeDiff<Id, W>

fn clone(&self) -> EdgeDiff<Id, W>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<Id: Debug + Hash + Eq, W: Debug> Debug for EdgeDiff<Id, W>

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

Formats the value using the given formatter.

impl<'de, Id, W> Deserialize<'de> for EdgeDiff<Id, W>

where Id: Deserialize<'de> + Hash + Eq, W: 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, W: PartialEq> PartialEq for EdgeDiff<Id, W>

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

where Id: Serialize + Hash + Eq, W: 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, W> StructuralPartialEq for EdgeDiff<Id, W>