Struct Satori 

pub struct Satori { /* private fields */ }

Implementations

impl Satori

pub async fn connect( username: String, password: String, url: String, ) -> Result<Self>

pub async fn send(&self, payload: Map<String, Value>) -> Result<Value>

pub async fn command(&self, command: &str, args: Value) -> Result<Value>

pub async fn set_notify<F>(&self, key: &str, callback: F) -> Result<()>

where F: Fn(Value) + Send + Sync + 'static,

pub async fn set(&self, args: Value) -> Result<Value>

pub async fn query(&self, args: Value) -> Result<Value>

pub async fn ann(&self, args: Value) -> Result<Value>

pub async fn set_middleware(&self, args: Value) -> Result<Value>

pub async fn get_access_frequency(&self, args: Value) -> Result<Value>

pub async fn get_operations(&self) -> Result<Value>

pub async fn ask(&self, args: Value) -> Result<Value>

pub async fn get(&self, args: Value) -> Result<Value>

pub async fn put(&self, args: Value) -> Result<Value>

pub async fn delete(&self, args: Value) -> Result<Value>

pub async fn encrypt(&self, args: Value) -> Result<Value>

pub async fn decrypt(&self, args: Value) -> Result<Value>

pub async fn push(&self, args: Value) -> Result<Value>

pub async fn pop(&self, args: Value) -> Result<Value>

pub async fn splice(&self, args: Value) -> Result<Value>

pub async fn remove(&self, args: Value) -> Result<Value>

pub async fn dfs(&self, args: Value) -> Result<Value>

pub async fn set_vertex(&self, args: Value) -> Result<Value>

pub async fn get_vertex(&self, args: Value) -> Result<Value>

pub async fn delete_vertex(&self, args: Value) -> Result<Value>

pub async fn graph_bfs(&self, args: Value) -> Result<Value>

Performs breadth-first search on the graph. Returns all nodes reachable from a starting node.

pub async fn graph_dfs(&self, args: Value) -> Result<Value>

Performs depth-first search on the graph. Returns all nodes reachable from a starting node.

pub async fn graph_shortest_path(&self, args: Value) -> Result<Value>

Finds the shortest path between a start node and end node using Dijkstra’s algorithm.

pub async fn graph_connected_components(&self, args: Value) -> Result<Value>

Identifies all connected components in the graph.

pub async fn graph_scc(&self, args: Value) -> Result<Value>

Finds strongly connected components using Tarjan’s algorithm.

pub async fn graph_degree_centrality(&self, args: Value) -> Result<Value>

Calculates degree centrality (number of connections) for each node in the graph.

pub async fn graph_closeness_centrality(&self, args: Value) -> Result<Value>

Calculates closeness centrality for each node.

pub async fn graph_centroid(&self, args: Value) -> Result<Value>

Finds the centroid node (node with highest closeness centrality).

pub async fn get_similar(&self, args: Value) -> Result<Value>

Alias for ANN - performs approximate nearest neighbor search.

pub async fn set_mindspace(&self, args: Value) -> Result<Value>

Creates a new mindspace (cognitive context) for AI-powered conversations.

pub async fn create_mindspace(&self, args: Value) -> Result<Value>

Alias for SET_MINDSPACE.

pub async fn delete_mindspace(&self, args: Value) -> Result<Value>

Deletes a mindspace and all its associated context.

pub async fn chat_mindspace(&self, args: Value) -> Result<Value>

Sends a message to a mindspace and receives an AI-generated response.

pub async fn lecture_mindspace(&self, args: Value) -> Result<Value>

Imports text corpus into a mindspace for semantic search and context retrieval.

Trait Implementations

impl Clone for Satori

fn clone(&self) -> Satori

Returns a duplicate of the value.

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

Performs copy-assignment from source.