Struct AsyncPoolGraph 

pub struct AsyncPoolGraph { /* private fields */ }

Bounded async connection pool for the knowledge graph.

Uses a Semaphore to bound concurrency and a Mutex<Vec<Connection>> for idle connection reuse. Each method acquires a permit, takes (or creates) a connection, runs the operation via spawn_blocking, then returns the connection to the pool.

Implementations

impl AsyncPoolGraph

pub async fn open(path: impl AsRef<Path>, max_conns: usize) -> Result<Self>

Open (or create) a database and initialise the graph schema.

max_conns bounds the number of concurrent operations.

pub async fn open_in_memory(max_conns: usize) -> Result<Self>

Create an in-memory pool with schema applied. Useful for tests.

Uses SQLite shared-cache mode so all connections in the pool see the same data (plain :memory: creates an independent DB per connection).

pub async fn upsert_node(&self, node: GraphNode) -> Result<()>

Insert or replace a node.

pub async fn read_node( &self, id: impl Into<String>, ) -> Result<Option<GraphNode>>

Read a node by ID. Returns None if not found.

pub async fn read_nodes(&self) -> Result<Vec<GraphNode>>

Read all nodes (limited to 10 000).

pub async fn delete_node(&self, id: impl Into<String>) -> Result<bool>

Delete a node by ID. Returns true if a row was deleted.

pub async fn append_edge(&self, edge: GraphEdge) -> Result<()>

Append an edge (duplicates by ID are ignored).

pub async fn read_edges(&self) -> Result<Vec<GraphEdge>>

Read all edges (limited to 10 000).

pub async fn delete_edge(&self, id: impl Into<String>) -> Result<bool>

Delete an edge by ID. Returns true if a row was deleted.

pub async fn search_nodes( &self, query: impl Into<String>, limit: usize, ) -> Result<Vec<GraphNode>>

Full-text search over node titles and bodies.

pub async fn smart_recall( &self, project: Option<String>, hint: Option<String>, limit: usize, ) -> Result<Vec<ScoredNode>>

Smart recall with composite scoring.

pub async fn stats(&self) -> Result<GraphStats>

Compute graph statistics (node/edge counts, avg importance).

Trait Implementations

impl Clone for AsyncPoolGraph

fn clone(&self) -> AsyncPoolGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.