Struct InMemoryGraph 

pub struct InMemoryGraph { /* private fields */ }

In-process knowledge graph. Cheap to clone (wraps Arc<RwLock<…>>).

Implementations

impl InMemoryGraph

pub fn new() -> Self

Build an empty graph.

Trait Implementations

impl Clone for InMemoryGraph

fn clone(&self) -> InMemoryGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Default for InMemoryGraph

fn default() -> Self

Returns the “default value” for a type.

impl GraphStore for InMemoryGraph

fn upsert_node<'life0, 'async_trait>( &'life0 self, node: Node, ) -> Pin<Box<dyn Future<Output = Result<()>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Insert / replace a node by id.

fn add_edge<'life0, 'async_trait>( &'life0 self, edge: Edge, ) -> Pin<Box<dyn Future<Output = Result<EdgeId>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Insert an edge.

fn get_node<'life0, 'life1, 'async_trait>( &'life0 self, id: &'life1 NodeId, ) -> Pin<Box<dyn Future<Output = Result<Option<Node>>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Look up a node by id.

fn get_edge<'life0, 'life1, 'async_trait>( &'life0 self, id: &'life1 EdgeId, ) -> Pin<Box<dyn Future<Output = Result<Option<Edge>>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Look up an edge by id.

fn nodes_by_label<'life0, 'life1, 'async_trait>( &'life0 self, label: &'life1 str, ) -> Pin<Box<dyn Future<Output = Result<Vec<Node>>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

All nodes carrying any of labels.

fn edges_from<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, from: &'life1 NodeId, label: Option<&'life2 str>, ) -> Pin<Box<dyn Future<Output = Result<Vec<Edge>>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

All edges leaving from (optionally filtered by label).

fn edges_to<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, to: &'life1 NodeId, label: Option<&'life2 str>, ) -> Pin<Box<dyn Future<Output = Result<Vec<Edge>>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

All edges entering to (optionally filtered by label).

fn stats<'life0, 'async_trait>( &'life0 self, ) -> Pin<Box<dyn Future<Output = Result<(usize, usize)>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Counts.