sqlitegraph 2.2.2

Embedded graph database with full ACID transactions, HNSW vector search, dual backend support, and comprehensive graph algorithms library
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44

//! Pattern matching methods for SqliteGraph.

use crate::errors::SqliteGraphError;

use super::SqliteGraph;

impl SqliteGraph {
    /// Match lightweight triple patterns using pattern engine.
    ///
    /// This method provides a simple interface for matching single-hop patterns
    /// like (start_label)-\[edge_type\]->(end_label) with optional property filters.
    ///
    /// # Arguments
    /// * `pattern` - The pattern triple to match
    ///
    /// # Returns
    /// A vector of triple matches in deterministic order
    pub fn match_triples(
        &self,
        pattern: &crate::pattern_engine::PatternTriple,
    ) -> Result<Vec<crate::pattern_engine::TripleMatch>, SqliteGraphError> {
        crate::pattern_engine::match_triples(self, pattern)
    }

    /// Match lightweight triple patterns using cache-enabled fast-path.
    ///
    /// This method provides an optimized version of pattern matching that:
    /// - Uses cache as a fast-path where safe
    /// - Falls back to SQL where pattern requires it
    /// - Returns IDENTICAL results to match_triples()
    /// - Maintains deterministic ordering
    ///
    /// # Arguments
    /// * `pattern` - The pattern triple to match
    ///
    /// # Returns
    /// A vector of triple matches in deterministic order
    pub fn match_triples_fast(
        &self,
        pattern: &crate::pattern_engine::PatternTriple,
    ) -> Result<Vec<crate::pattern_engine::TripleMatch>, SqliteGraphError> {
        crate::pattern_engine_cache::match_triples_fast(self, pattern)
    }
}