pub struct MemoryGraphStore { /* private fields */ }Implementations§
Trait Implementations§
Source§impl Clone for MemoryGraphStore
impl Clone for MemoryGraphStore
Source§fn clone(&self) -> MemoryGraphStore
fn clone(&self) -> MemoryGraphStore
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl CypherMutationExecutor for MemoryGraphStore
impl CypherMutationExecutor for MemoryGraphStore
fn execute_cypher_mutation_plan<'life0, 'life1, 'async_trait>(
&'life0 self,
plan: &'life1 GraphMutationPlan,
) -> Pin<Box<dyn Future<Output = Result<GraphMutationReport>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
Source§impl Debug for MemoryGraphStore
impl Debug for MemoryGraphStore
Source§impl Default for MemoryGraphStore
impl Default for MemoryGraphStore
Source§fn default() -> MemoryGraphStore
fn default() -> MemoryGraphStore
Returns the “default value” for a type. Read more
Source§impl GraphMutationStore for MemoryGraphStore
impl GraphMutationStore for MemoryGraphStore
Source§fn delete_node<'life0, 'life1, 'async_trait>(
&'life0 self,
id: &'life1 NodeId,
) -> Pin<Box<dyn Future<Output = Result<()>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
fn delete_node<'life0, 'life1, 'async_trait>(
&'life0 self,
id: &'life1 NodeId,
) -> Pin<Box<dyn Future<Output = Result<()>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
Deletes a node and all edges incident to it.
Source§fn delete_edge<'life0, 'life1, 'life2, 'life3, 'async_trait>(
&'life0 self,
from: &'life1 NodeId,
label: &'life2 Label,
to: &'life3 NodeId,
) -> Pin<Box<dyn Future<Output = Result<()>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
'life2: 'async_trait,
'life3: 'async_trait,
fn delete_edge<'life0, 'life1, 'life2, 'life3, 'async_trait>(
&'life0 self,
from: &'life1 NodeId,
label: &'life2 Label,
to: &'life3 NodeId,
) -> Pin<Box<dyn Future<Output = Result<()>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
'life2: 'async_trait,
'life3: 'async_trait,
Deletes the edge(s) matching
(from, label, to).fn mutation_atomicity(&self) -> GraphMutationAtomicity
Source§fn apply_mutations<'life0, 'life1, 'async_trait>(
&'life0 self,
mutations: &'life1 [GraphMutation],
) -> Pin<Box<dyn Future<Output = Result<(), GrustError>> + Send + 'async_trait>>where
'life0: 'async_trait,
'life1: 'async_trait,
Self: Sync + 'async_trait,
fn apply_mutations<'life0, 'life1, 'async_trait>(
&'life0 self,
mutations: &'life1 [GraphMutation],
) -> Pin<Box<dyn Future<Output = Result<(), GrustError>> + Send + 'async_trait>>where
'life0: 'async_trait,
'life1: 'async_trait,
Self: Sync + 'async_trait,
Applies mutations in order, stopping at the first error. Read more
Source§impl GraphStore for MemoryGraphStore
impl GraphStore for MemoryGraphStore
Source§fn apply_schema<'life0, 'life1, 'async_trait>(
&'life0 self,
schema: &'life1 GraphSchema,
) -> Pin<Box<dyn Future<Output = Result<()>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
fn apply_schema<'life0, 'life1, 'async_trait>(
&'life0 self,
schema: &'life1 GraphSchema,
) -> Pin<Box<dyn Future<Output = Result<()>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
Applies backend schema metadata. Read more
Source§fn constraint_capability(
&self,
constraint: &GraphConstraint,
) -> GraphConstraintCapability
fn constraint_capability( &self, constraint: &GraphConstraint, ) -> GraphConstraintCapability
Reports how this backend treats a portable graph constraint. Read more
Source§fn put_node<'life0, 'life1, 'async_trait>(
&'life0 self,
node: &'life1 Node,
) -> Pin<Box<dyn Future<Output = Result<PutOutcome>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
fn put_node<'life0, 'life1, 'async_trait>(
&'life0 self,
node: &'life1 Node,
) -> Pin<Box<dyn Future<Output = Result<PutOutcome>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
Writes one node. Read more
Source§fn put_edge<'life0, 'life1, 'async_trait>(
&'life0 self,
edge: &'life1 Edge,
) -> Pin<Box<dyn Future<Output = Result<PutOutcome>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
fn put_edge<'life0, 'life1, 'async_trait>(
&'life0 self,
edge: &'life1 Edge,
) -> Pin<Box<dyn Future<Output = Result<PutOutcome>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
Writes one edge. Read more
fn put_graph<'life0, 'life1, 'async_trait>(
&'life0 self,
graph: &'life1 Graph,
) -> Pin<Box<dyn Future<Output = Result<LoadReport>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
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,
Source§fn get_nodes<'life0, 'life1, 'async_trait>(
&'life0 self,
ids: &'life1 [NodeId],
) -> Pin<Box<dyn Future<Output = Result<Vec<Node>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
fn get_nodes<'life0, 'life1, 'async_trait>(
&'life0 self,
ids: &'life1 [NodeId],
) -> Pin<Box<dyn Future<Output = Result<Vec<Node>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
'life1: 'async_trait,
Reads multiple nodes by ID. Read more
fn get_edges<'life0, 'async_trait>(
&'life0 self,
query: EdgeQuery,
) -> Pin<Box<dyn Future<Output = Result<Vec<Edge>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
fn traverse<'life0, 'async_trait>(
&'life0 self,
traversal: Traversal,
) -> Pin<Box<dyn Future<Output = Result<Vec<Node>>> + Send + 'async_trait>>where
Self: 'async_trait,
'life0: 'async_trait,
Source§fn native_constraint_capability(
&self,
_constraint: &GraphConstraint,
) -> GraphNativeConstraintCapability
fn native_constraint_capability( &self, _constraint: &GraphConstraint, ) -> GraphNativeConstraintCapability
Reports whether this backend can turn a portable graph constraint into
backend-native DDL. Read more
Source§fn apply_native_constraint<'life0, 'async_trait>(
&'life0 self,
request: GraphNativeConstraintRequest,
) -> Pin<Box<dyn Future<Output = Result<GraphNativeConstraintReport, GrustError>> + Send + 'async_trait>>where
'life0: 'async_trait,
Self: 'async_trait,
fn apply_native_constraint<'life0, 'async_trait>(
&'life0 self,
request: GraphNativeConstraintRequest,
) -> Pin<Box<dyn Future<Output = Result<GraphNativeConstraintReport, GrustError>> + Send + 'async_trait>>where
'life0: 'async_trait,
Self: 'async_trait,
Applies one backend-native constraint or index request. Read more
fn put_typed_graph<'life0, 'life1, 'life2, 'async_trait>(
&'life0 self,
schema: &'life1 GraphSchema,
graph: &'life2 Graph,
) -> Pin<Box<dyn Future<Output = Result<LoadReport, GrustError>> + Send + 'async_trait>>where
'life0: 'async_trait,
'life1: 'async_trait,
'life2: 'async_trait,
Self: 'async_trait,
Auto Trait Implementations§
impl Freeze for MemoryGraphStore
impl RefUnwindSafe for MemoryGraphStore
impl Send for MemoryGraphStore
impl Sync for MemoryGraphStore
impl Unpin for MemoryGraphStore
impl UnsafeUnpin for MemoryGraphStore
impl UnwindSafe for MemoryGraphStore
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more