pub struct LibsqlGraphStore { /* private fields */ }Implementations§
Trait Implementations§
Source§impl GraphStore for LibsqlGraphStore
impl GraphStore for LibsqlGraphStore
fn upsert_node(&self, node: &GraphNode) -> Result<()>
fn upsert_edge(&self, edge: &GraphEdge) -> Result<()>
fn delete_node(&self, id: &str) -> Result<usize>
fn delete_edge(&self, from_id: &str, to_id: &str, kind: &str) -> Result<usize>
fn node(&self, id: &str) -> Result<Option<GraphNode>>
fn all_nodes(&self) -> Result<Vec<GraphNode>>
fn all_edges(&self) -> Result<Vec<GraphEdge>>
fn nodes_by_kind(&self, kind: &str) -> Result<Vec<GraphNode>>
fn outgoing_edges( &self, from_id: &str, kind: Option<&str>, ) -> Result<Vec<GraphEdge>>
fn shortest_path( &self, from_id: &str, to_id: &str, kind: Option<&str>, ) -> Result<Option<GraphPath>>
fn shortest_path_with_max_hops( &self, from_id: &str, to_id: &str, kind: Option<&str>, max_hops: Option<usize>, ) -> Result<Option<GraphPath>>
fn edge(&self, edge_id: &str) -> Result<Option<GraphEdge>, Error>
fn graph_counts(&self) -> Result<(usize, usize), Error>
fn sample_edge(&self, kind: Option<&str>) -> Result<Option<GraphEdge>, Error>
fn sample_edge_with_property( &self, ) -> Result<Option<(GraphEdge, GraphPropertyFilter)>, Error>
fn incident_edges( &self, node_id: &str, kind: Option<&str>, ) -> Result<Vec<GraphEdge>, Error>
fn paged_edges( &self, kind: Option<&str>, options: GraphQueryOptions, ) -> Result<GraphPagedSubgraph, Error>
fn paged_incident_edges( &self, node_id: &str, kind: Option<&str>, options: GraphQueryOptions, ) -> Result<GraphPagedSubgraph, Error>
fn edges_between_nodes( &self, node_ids: &BTreeSet<String>, ) -> Result<Vec<GraphEdge>, Error>
fn neighborhood( &self, center_id: &str, depth: usize, kind: Option<&str>, ) -> Result<Option<GraphSubgraph>, Error>
fn paged_nodes_by_kind( &self, kind: &str, options: GraphQueryOptions, ) -> Result<GraphPagedSubgraph, Error>
fn paged_neighborhood( &self, center_id: &str, depth: usize, kind: Option<&str>, options: GraphQueryOptions, ) -> Result<Option<GraphPagedSubgraph>, Error>
fn reachable_nodes_by_kind( &self, from_id: &str, kind: &str, depth: usize, limit: usize, ) -> Result<Vec<(GraphNode, GraphPath)>, Error>
fn reachable_nodes_by_kinds( &self, from_id: &str, kinds: &[&str], depth: usize, limit: usize, ) -> Result<BTreeMap<String, Vec<(GraphNode, GraphPath)>>, Error>
fn resolve_evidence_target( &self, target: &str, kinds: &[&str], ) -> Result<Option<GraphNode>, Error>
Auto Trait Implementations§
impl !Freeze for LibsqlGraphStore
impl !RefUnwindSafe for LibsqlGraphStore
impl Send for LibsqlGraphStore
impl Sync for LibsqlGraphStore
impl Unpin for LibsqlGraphStore
impl UnsafeUnpin for LibsqlGraphStore
impl !UnwindSafe for LibsqlGraphStore
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
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
Source§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
Wrap the input message
T in a tonic::Request