Struct ConvexGraphStore 

pub struct ConvexGraphStore<C> { /* private fields */ }

Implementations

impl<C> ConvexGraphStore<C>

pub fn new(client: C) -> Self

pub fn client(&self) -> &C

pub fn into_inner(self) -> C

Trait Implementations

impl<C: ConvexGraphClient> GraphStore for ConvexGraphStore<C>

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 graph_counts(&self) -> Result<(usize, usize)>

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 nodes_by_ids(&self, ids: &[String]) -> Result<Vec<GraphNode>>

fn edge(&self, edge_id: &str) -> Result<Option<GraphEdge>>

fn sample_edge(&self, kind: Option<&str>) -> Result<Option<GraphEdge>>

fn sample_edge_with_property( &self, ) -> Result<Option<(GraphEdge, GraphPropertyFilter)>>

fn incident_edges( &self, node_id: &str, kind: Option<&str>, ) -> Result<Vec<GraphEdge>>

fn semantic_seeded_expansion_edges( &self, current_id: &str, options: &SemanticSeededNeighborhoodOptions, ) -> Result<SemanticSeededNeighborhoodExpansion>

fn paged_edges( &self, kind: Option<&str>, options: GraphQueryOptions, ) -> Result<GraphPagedSubgraph>

fn paged_incident_edges( &self, node_id: &str, kind: Option<&str>, options: GraphQueryOptions, ) -> Result<GraphPagedSubgraph>

fn edges_between_nodes( &self, node_ids: &BTreeSet<String>, ) -> Result<Vec<GraphEdge>>

fn shortest_path_with_max_hops( &self, from_id: &str, to_id: &str, kind: Option<&str>, max_hops: Option<usize>, ) -> Result<Option<GraphPath>>

fn neighborhood( &self, center_id: &str, depth: usize, kind: Option<&str>, ) -> Result<Option<GraphSubgraph>>

fn paged_nodes_by_kind( &self, kind: &str, options: GraphQueryOptions, ) -> Result<GraphPagedSubgraph>

fn paged_neighborhood( &self, center_id: &str, depth: usize, kind: Option<&str>, options: GraphQueryOptions, ) -> Result<Option<GraphPagedSubgraph>>

fn semantic_seeded_neighborhood( &self, seed_ids: &[String], options: &SemanticSeededNeighborhoodOptions, ) -> Result<SemanticSeededNeighborhoodResult>

fn ranked_neighborhood( &self, center_id: &str, options: &RankedNeighborhoodOptions, ) -> Result<Option<RankedNeighborhoodResult>>

fn reachable_nodes_by_kind( &self, from_id: &str, kind: &str, depth: usize, limit: usize, ) -> Result<Vec<(GraphNode, GraphPath)>>

fn reachable_nodes_by_kinds( &self, from_id: &str, kinds: &[&str], depth: usize, limit: usize, ) -> Result<BTreeMap<String, Vec<(GraphNode, GraphPath)>>>

fn semantic_top_candidates( &self, query_vector: &[f64], kinds: &[&str], limit: usize, ) -> Result<Vec<GraphSemanticCandidate>>

fn resolve_evidence_target( &self, target: &str, kinds: &[&str], ) -> Result<Option<GraphNode>>