semstore 0.1.0

Local semantic search for Rust applications — store text, search by meaning, no cloud required
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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62

//! Basic usage: in-memory index, insert documents, search by meaning.
//!
//! ```
//! cargo run --example basic
//! ```

use semstore::SemanticIndex;
use serde_json::json;

fn main() -> semstore::Result<()> {
    // In-memory index — nothing is written to disk.
    let mut idx = SemanticIndex::in_memory()?;

    idx.insert_batch([
        (
            "Rust ownership prevents data races at compile time",
            json!({ "lang": "rust" }),
        ),
        (
            "Rust borrowing: multiple readers OR one writer",
            json!({ "lang": "rust" }),
        ),
        (
            "Python uses reference counting for memory management",
            json!({ "lang": "python" }),
        ),
        (
            "Go's garbage collector runs concurrently",
            json!({ "lang": "go" }),
        ),
        (
            "async/await in Rust compiles to zero-cost state machines",
            json!({ "lang": "rust" }),
        ),
        (
            "Tokio is the most popular async runtime for Rust",
            json!({ "lang": "rust" }),
        ),
    ])?;

    let stats = idx.stats()?;
    println!("Indexed {} entries\n", stats.total);

    for query in &[
        "how does Rust handle memory safety?",
        "concurrent programming",
        "async Rust",
    ] {
        println!("Query: \"{query}\"");
        let results = idx.search(query, 2)?;
        if results.is_empty() {
            println!("  (no results above threshold)");
        } else {
            for r in &results {
                println!("  [{:.3}] {}", r.score, r.content);
            }
        }
        println!();
    }

    Ok(())
}