Struct ratio_graph::edge::EdgeStoreData

pub struct EdgeStoreData { /* private fields */ }

Trait Implementations

impl Clone for EdgeStoreData

fn clone(&self) -> EdgeStoreData

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for EdgeStoreData

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

Formats the value using the given formatter.

impl Default for EdgeStoreData

fn default() -> EdgeStoreData

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for EdgeStoreData

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl EdgeStore for EdgeStoreData

fn edges_len(&self) -> usize

fn is_edges_empty(&self) -> bool

fn add_edge<N: NodeStore>( &mut self, edge: Edge, safe: bool, nodes: Option<&N> ) -> Result<Option<Edge>, Error>

fn extend_edges<N: NodeStore>( &mut self, edges: Vec<Edge>, safe: bool, nodes: Option<&N> ) -> Result<Vec<Edge>, Error>

fn check<N: NodeStore>(&self, edge: &Edge, nodes: &N) -> Result<(), Error>

fn del(&mut self, id: &Uuid) -> Option<Edge>

fn get_edge(&self, id: &Uuid) -> Option<&Edge>

fn all_edges(&self) -> Vec<&Edge>

fn edge_ids_between(&self, source: &Uuid, target: &Uuid) -> HashSet<Uuid>

fn edges_between(&self, source: &Uuid, target: &Uuid) -> Vec<&Edge>

fn edge_ids_between_all( &self, sources: &HashSet<Uuid>, targets: &HashSet<Uuid> ) -> HashSet<Uuid>

fn edges_between_all( &self, sources: &HashSet<Uuid>, targets: &HashSet<Uuid> ) -> Vec<&Edge>

fn aggregate_between(&self, source: &Uuid, target: &Uuid) -> Aggregate

fn aggregate_between_all( &self, sources: HashSet<Uuid>, targets: HashSet<Uuid> ) -> Aggregate

fn outgoing_ids_from(&self, source: &Uuid) -> HashSet<Uuid>

fn outgoing_edges_from(&self, source: &Uuid) -> Vec<&Edge>

fn incoming_ids_to(&self, target: &Uuid) -> HashSet<Uuid>

fn incoming_edges_to(&self, target: &Uuid) -> Vec<&Edge>

fn targets_of(&self, source: &Uuid) -> HashSet<Uuid>

fn sources_to(&self, target: &Uuid) -> HashSet<Uuid>

fn is_connected_to( &self, node: &Uuid, others: &HashSet<Uuid>, edge_ids: Option<&HashSet<Uuid>> ) -> bool

fn get_aggregate_value( &self, source: &Uuid, target: &Uuid, aggregator: &Aggregator, fields: Option<&HashSet<String>> ) -> f64

fn get_adjacency_matrix( &self, sources: &Vec<&Uuid>, targets: &Vec<&Uuid>, aggregator: &Aggregator, fields: Option<&HashSet<String>> ) -> DMatrix<f64>

impl HasEdgeStore for EdgeStoreData

fn edge_store(&self) -> &EdgeStoreData

fn edge_store_mut(&mut self) -> &mut EdgeStoreData

impl PartialEq<EdgeStoreData> for EdgeStoreData

fn eq(&self, other: &EdgeStoreData) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for EdgeStoreData

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 EdgeStoreData