Skip to main content

InMemoryGraphStore

Struct InMemoryGraphStore 

Source
pub struct InMemoryGraphStore { /* private fields */ }
Expand description

In-memory graph store for similarity edges.

This implementation uses adjacency lists for efficient edge traversal and supports bidirectional lookups.

Implementations§

Source§

impl InMemoryGraphStore

Source

pub fn new() -> Self

Create a new empty graph store.

Source

pub fn len(&self) -> usize

Get the number of edges.

Source

pub fn is_empty(&self) -> bool

Check if the store is empty.

Source

pub fn node_ids(&self) -> Vec<EmbeddingId>

Get all unique node IDs in the graph.

Source

pub fn degree(&self, id: &EmbeddingId) -> usize

Get the degree (number of connections) for a node.

Source

pub fn export(&self) -> GraphExport

Export the graph for serialization.

Source

pub fn import(&self, data: GraphExport) -> RepoResult<()>

Import a graph from serialized data.

Trait Implementations§

Source§

impl Debug for InMemoryGraphStore

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl Default for InMemoryGraphStore

Source§

fn default() -> Self

Returns the “default value” for a type. Read more
Source§

impl GraphEdgeRepository for InMemoryGraphStore

Source§

fn add_edge<'life0, 'async_trait>( &'life0 self, edge: SimilarityEdge, ) -> Pin<Box<dyn Future<Output = RepoResult<()>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait,

Add an edge between two embeddings.
Source§

fn add_edges<'life0, 'life1, 'async_trait>( &'life0 self, edges: &'life1 [SimilarityEdge], ) -> Pin<Box<dyn Future<Output = RepoResult<()>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Add multiple edges in a batch.
Source§

fn remove_edge<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, from: &'life1 EmbeddingId, to: &'life2 EmbeddingId, ) -> Pin<Box<dyn Future<Output = RepoResult<()>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Remove an edge between two embeddings.
Source§

fn get_edges_from<'life0, 'life1, 'async_trait>( &'life0 self, id: &'life1 EmbeddingId, ) -> Pin<Box<dyn Future<Output = RepoResult<Vec<SimilarityEdge>>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Get all edges from a given embedding.
Source§

fn get_edges_to<'life0, 'life1, 'async_trait>( &'life0 self, id: &'life1 EmbeddingId, ) -> Pin<Box<dyn Future<Output = RepoResult<Vec<SimilarityEdge>>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Get all edges to a given embedding.
Source§

fn get_edges_by_type<'life0, 'life1, 'async_trait>( &'life0 self, id: &'life1 EmbeddingId, edge_type: EdgeType, ) -> Pin<Box<dyn Future<Output = RepoResult<Vec<SimilarityEdge>>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Get edges of a specific type from an embedding.
Source§

fn get_strong_edges<'life0, 'life1, 'async_trait>( &'life0 self, id: &'life1 EmbeddingId, min_similarity: f32, ) -> Pin<Box<dyn Future<Output = RepoResult<Vec<SimilarityEdge>>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Find edges with similarity above a threshold.
Source§

fn edge_count<'life0, 'async_trait>( &'life0 self, ) -> Pin<Box<dyn Future<Output = RepoResult<usize>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait,

Get the number of edges in the graph.
Source§

fn clear<'life0, 'async_trait>( &'life0 self, ) -> Pin<Box<dyn Future<Output = RepoResult<()>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait,

Clear all edges.
Source§

fn remove_edges_for<'life0, 'life1, 'async_trait>( &'life0 self, id: &'life1 EmbeddingId, ) -> Pin<Box<dyn Future<Output = RepoResult<()>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Remove all edges connected to an embedding.
Source§

impl GraphTraversal for InMemoryGraphStore

Source§

fn shortest_path<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, from: &'life1 EmbeddingId, to: &'life2 EmbeddingId, max_depth: usize, ) -> Pin<Box<dyn Future<Output = RepoResult<Option<Vec<EmbeddingId>>>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Find the shortest path between two embeddings.
Source§

fn neighbors_within_hops<'life0, 'life1, 'async_trait>( &'life0 self, id: &'life1 EmbeddingId, hops: usize, ) -> Pin<Box<dyn Future<Output = RepoResult<Vec<(EmbeddingId, usize)>>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Find all embeddings within n hops of a given embedding.
Source§

fn connected_components<'life0, 'async_trait>( &'life0 self, ) -> Pin<Box<dyn Future<Output = RepoResult<Vec<Vec<EmbeddingId>>>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait,

Find connected components in the graph.
Source§

fn centrality_scores<'life0, 'async_trait>( &'life0 self, ) -> Pin<Box<dyn Future<Output = RepoResult<Vec<(EmbeddingId, f32)>>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait,

Calculate PageRank-style centrality for embeddings.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self> ⓘ

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self> ⓘ

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = !

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> ⓘ
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self> ⓘ

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more