gen-rs 0.2.3

a experimental library for probabilistic programming in Rust.
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

use gen_rs::Trie;


#[test]
fn test_trie() {
    let mut trie = Trie::<i64>::new();
    trie.insert_leaf_node("1 => 2", 1);
    trie.insert_leaf_node("1", 2);
    trie.insert_leaf_node("1 => 3", 3);
    trie.insert_leaf_node("1 => 3 => 4", 4);
    assert_eq!(trie.get_internal_node("1").unwrap().get_leaf_node("2"), trie.get_leaf_node("1 => 2"));
    assert_eq!(
        trie.get_internal_node("1").unwrap()
            .get_internal_node("3").unwrap()
            .get_leaf_node("4"),
        trie.get_leaf_node("1 => 3 => 4")
    );

    let mut subtrie = Trie::<i64>::new();
    subtrie.insert_leaf_node("2", 1);
    subtrie.insert_leaf_node("3", 3);
    subtrie.insert_leaf_node("3 => 4", 4);

    let mut root = Trie::<i64>::new();
    root.insert_internal_node("1", subtrie);
    root.insert_leaf_node("1", 2);

    assert_eq!(root, trie);
}