rsmarisa 0.4.0

Pure Rust port of marisa-trie: a static and space-efficient trie data structure
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
63
64
65
66
67
68
69

/// Basic test to verify all inserted words can be found

#[test]
fn test_all_words_can_be_found() {
    use rsmarisa::{Agent, Keyset, Trie};

    let words = vec![
        "a",
        "app",
        "apple",
        "application",
        "apply",
        "banana",
        "band",
        "bank",
        "can",
        "cat",
        "dog",
        "door",
        "test",
        "testing",
        "trie",
    ];

    // Build trie
    let mut keyset = Keyset::new();
    for word in &words {
        keyset.push_back_str(word).unwrap();
    }

    let mut trie = Trie::new();
    trie.build(&mut keyset, 0);

    println!("Trie built successfully:");
    println!("  num_keys: {}", trie.num_keys());
    println!("  num_nodes: {}", trie.num_nodes());
    println!();

    // Try to lookup each word
    let mut found = Vec::new();
    let mut not_found = Vec::new();

    for word in &words {
        let mut agent = Agent::new();
        agent.set_query_str(word);

        if trie.lookup(&mut agent) {
            found.push(*word);
            println!("✓ Found: {}", word);
        } else {
            not_found.push(*word);
            println!("✗ NOT FOUND: {}", word);
        }
    }

    println!();
    println!("Summary:");
    println!("  Found: {} / {}", found.len(), words.len());
    println!("  Not found: {}", not_found.len());

    if !not_found.is_empty() {
        println!();
        println!("Missing words:");
        for word in &not_found {
            println!("  - {}", word);
        }
        panic!("{} words are missing from the trie", not_found.len());
    }
}