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

The number of edges in store.

fn is_edges_empty(&self) -> bool

Whether the edge store is empty.

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

Add a single edge to this store.

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

Add multiple edges to this store at once.

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

Check an edge’s source and target reference in a node store.

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

Delete an edge from the store.

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

Get an edge from the store.

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

Get all edges in store.

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

Get all edge IDs between a given source and target node.

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

Get all edges between a given source and target node.

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

Get all edge IDs between a given set of source and target nodes.

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

Get all edges between a given set of source and target nodes.

fn aggregate_between( &self, source: &Uuid, target: &Uuid, filter: Option<&MetadataFilter> ) -> Aggregate

Get the calculated aggregate of edge metadata between a source and target node with an optional edge filter.

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

Get the calculated aggregate of edge metadata between a set of source and target nodes with an optional edge filter.

fn get_aggregate_map( &self, sources: &HashSet<Uuid>, targets: &HashSet<Uuid>, filter: Option<&MetadataFilter> ) -> HashMap<Uuid, HashMap<Uuid, Aggregate>>

Get the aggregate map from source to target to aggregate for a given set of source and target nodes and an optional edge filter.

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

Get all outgoing edge IDs originating from this source node.

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

Get all outgoing edges originating from this source node.

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

Get all incoming edge IDs towards this target node.

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

Get all incoming edges towards this target node.

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

Get all source node IDs that are connected to this target node by an incoming edge.

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

Get all source node IDs that are connected to this target node by an incoming edge.

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

Check whether a node is connected to a set of other nodes. Optionally specify a limited set of edge IDs that are allowed for connections.

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

Calculate an aggregate value between a source and target node, optional edge filter and optional field filter.

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

Calculate the adjacency matrix given a set of source and target nodes, aggregator, optional edge filter and optional field filter.

fn edge_aggregate(&self) -> &Aggregate

Get the aggregate.

impl HasEdgeStore for EdgeStoreData

fn edge_store(&self) -> &EdgeStoreData

Edge store reference.

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

Mutable edge store reference.

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