triblespace 0.23.1

The Triblespace: A lightweight knowledge base for 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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44

use rand::rngs::StdRng;
use rand::rngs::ThreadRng;
use rand::RngCore;
use rand::SeedableRng;
use std::collections::HashSet;
use triblespace::core::patch::Entry;
use triblespace::core::patch::IdentitySchema;
use triblespace::core::patch::PATCH;
use triblespace::core::trible::EAVOrder;

#[test]
fn iter_ordered_returns_sorted_keys_eav() {
    let mut patch: PATCH<64, EAVOrder, ()> = PATCH::new();
    let mut rng = StdRng::seed_from_u64(0);
    let mut keys = HashSet::new();
    while keys.len() < 1000 {
        let mut key = [0u8; 64];
        rng.fill_bytes(&mut key);
        if keys.insert(key) {
            patch.insert(&Entry::with_value(&key, ()));
        }
    }
    let mut sorted_keys: Vec<[u8; 64]> = keys.iter().cloned().collect();
    sorted_keys.sort();
    let collected: Vec<[u8; 64]> = patch.iter_ordered().cloned().collect();
    assert_eq!(collected, sorted_keys);
}

#[test]
fn iter_ordered_returns_sorted_keys_identity() {
    const N: usize = 128;
    let mut rng = ThreadRng::default();
    let mut patch: PATCH<64, IdentitySchema, ()> = PATCH::new();
    let mut keys: Vec<[u8; 64]> = Vec::with_capacity(N);
    for _ in 0..N {
        let mut key = [0u8; 64];
        rng.fill_bytes(&mut key);
        patch.insert(&Entry::new(&key));
        keys.push(key);
    }
    keys.sort();
    let iter_keys: Vec<[u8; 64]> = patch.iter_ordered().copied().collect();
    assert_eq!(keys, iter_keys);
}