tokitai-operator 0.1.0

Verified DL kernel compiler: formally-checked GEMM, p-adic, sheaf, contract-carrying ops. Paper-artifact grade.
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

use std::collections::BTreeMap;
use tokitai_operator::object::sheaf::{OpenId, SectionTable};

fn open(id: &str) -> OpenId {
    OpenId(id.to_string())
}

#[test]
fn new_table_is_empty() {
    let t: SectionTable<i64> = SectionTable::new();
    assert_eq!(t.len(), 0);
    assert!(t.is_empty());
}

#[test]
fn len_grows_with_inserts() {
    let mut t: SectionTable<i64> = SectionTable::new();
    t.insert(open("u0"), 1);
    assert_eq!(t.len(), 1);
    assert!(!t.is_empty());
    t.insert(open("u1"), 2);
    assert_eq!(t.len(), 2);
    t.insert(open("u01"), 3);
    assert_eq!(t.len(), 3);
}

#[test]
fn inserting_same_open_twice_does_not_grow() {
    let mut t: SectionTable<i64> = SectionTable::new();
    t.insert(open("u0"), 1);
    t.insert(open("u0"), 99);
    assert_eq!(t.len(), 1);
    // The latest value wins.
    assert_eq!(t.get(&open("u0")).copied(), Some(99));
}

#[test]
fn contains_agrees_with_get() {
    let mut t: SectionTable<i64> = SectionTable::new();
    t.insert(open("u0"), 1);
    t.insert(open("u1"), 2);
    assert!(t.contains(&open("u0")));
    assert!(t.contains(&open("u1")));
    assert!(!t.contains(&open("u01")));
    assert!(!t.contains(&open("missing")));
}

#[test]
fn len_matches_with_default_precision() {
    let mut map: BTreeMap<OpenId, i64> = BTreeMap::new();
    map.insert(open("a"), 1);
    map.insert(open("b"), 2);
    let t: SectionTable<i64> = SectionTable::with_default_precision(map);
    assert_eq!(t.len(), 2);
    assert!(!t.is_empty());
}

#[test]
fn empty_default_precision_table_is_empty() {
    let t: SectionTable<i64> = SectionTable::with_default_precision(BTreeMap::new());
    assert_eq!(t.len(), 0);
    assert!(t.is_empty());
}