assura-types 0.4.3

Type checking for the Assura contract language
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

use super::*;

// --- T067: Determinism checker tests ---

#[test]
fn determinism_hashmap_a20001() {
    let mut checker = DeterminismChecker::new();
    checker.mark_deterministic("compute".into());
    let errors = checker.check_fn_body("compute", &["HashMap".into(), "Vec".into()], &(0..1));
    assert_eq!(errors.len(), 1);
    assert_eq!(errors[0].code, "A20001");
}

#[test]
fn determinism_btreemap_ok() {
    let mut checker = DeterminismChecker::new();
    checker.mark_deterministic("compute".into());
    let errors = checker.check_fn_body("compute", &["BTreeMap".into(), "Vec".into()], &(0..1));
    assert!(errors.is_empty());
}

#[test]
fn determinism_non_det_fn_ok() {
    let checker = DeterminismChecker::new();
    // Not marked deterministic
    let errors = checker.check_fn_body("random_pick", &["random".into()], &(0..1));
    assert!(errors.is_empty(), "non-deterministic fn allows random");
}

#[test]
fn determinism_iteration_a20002() {
    let mut checker = DeterminismChecker::new();
    checker.mark_deterministic("process".into());
    let errors = checker.check_iteration("process", "HashMap<K,V>", &(0..1));
    assert_eq!(errors.len(), 1);
    assert_eq!(errors[0].code, "A20002");
}

#[test]
fn determinism_btree_iteration_ok() {
    let mut checker = DeterminismChecker::new();
    checker.mark_deterministic("process".into());
    let errors = checker.check_iteration("process", "BTreeMap<K,V>", &(0..1));
    assert!(errors.is_empty());
}

#[test]
fn determinism_random_a20001() {
    let mut checker = DeterminismChecker::new();
    checker.mark_deterministic("seed_fn".into());
    let errors = checker.check_fn_body("seed_fn", &["thread_rng".into()], &(0..1));
    assert_eq!(errors.len(), 1);
}