essential-constraint-vm 0.6.0

The Essential constraint checking VM
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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112

use crate::error::DecodeError;

use super::*;

#[test]
fn test_eq_range_true() {
    let mut stack = Stack::default();
    stack.extend([1, 2, 3]).unwrap();
    stack.extend([1, 2, 3]).unwrap();
    stack.push(3).unwrap();
    eq_range(&mut stack).unwrap();
    assert_eq!(stack.pop().unwrap(), 1);
}

#[test]
fn test_eq_range_false() {
    let mut stack = Stack::default();
    stack.extend([1, 4, 3]).unwrap();
    stack.extend([1, 2, 3]).unwrap();
    stack.push(3).unwrap();
    eq_range(&mut stack).unwrap();
    assert_eq!(stack.pop().unwrap(), 0);
}

#[test]
fn test_eq_empty_range() {
    let mut stack = Stack::default();
    stack.push(0).unwrap();
    eq_range(&mut stack).unwrap();
    assert_eq!(stack.pop().unwrap(), 1);
}

#[test]
fn test_eq_set() {
    let set_a = [0, 1, 2, 3, 3, 4, 5, 3, 6, 1, 10];
    let set_b = set_a;
    let mut stack = Stack::default();

    // Equal sets.
    stack.extend(set_a).unwrap();
    stack.extend(set_b).unwrap();
    eq_set(&mut stack).unwrap();
    assert_eq!(stack.pop().unwrap(), 1);
    assert!(stack.is_empty());

    // Unequal sets of the same length.
    let set_c = [1, 1, 2, 3, 3, 4, 5, 3, 6, 1, 10];
    stack.extend(set_a).unwrap();
    stack.extend(set_c).unwrap();
    eq_set(&mut stack).unwrap();
    assert_eq!(stack.pop().unwrap(), 0);
    assert!(stack.is_empty());

    // Order doesn't matter.
    stack.extend(set_c).unwrap();
    stack.extend(set_a).unwrap();
    eq_set(&mut stack).unwrap();
    assert_eq!(stack.pop().unwrap(), 0);
    assert!(stack.is_empty());

    let set_d = [1, 1, 2, 3, 4];

    // Unequal sets of different lengths.
    stack.extend(set_c).unwrap();
    stack.extend(set_d).unwrap();
    eq_set(&mut stack).unwrap();
    assert_eq!(stack.pop().unwrap(), 0);
    assert!(stack.is_empty());

    // Empty set.
    let empty_set = [0];
    stack.extend(empty_set).unwrap();
    stack.extend(empty_set).unwrap();
    eq_set(&mut stack).unwrap();
    assert_eq!(stack.pop().unwrap(), 1);
    assert!(stack.is_empty());

    // Empty set and non-empty set.
    stack.extend(empty_set).unwrap();
    stack.extend(set_a).unwrap();
    eq_set(&mut stack).unwrap();
    assert_eq!(stack.pop().unwrap(), 0);
    assert!(stack.is_empty());

    // Order doesn't matter.
    stack.extend(set_a).unwrap();
    stack.extend(empty_set).unwrap();
    eq_set(&mut stack).unwrap();
    assert_eq!(stack.pop().unwrap(), 0);
    assert!(stack.is_empty());

    // Decode error lhs.
    let set_err = [0, 1, 2, 3, 3, 4, 5, 9, 6, 1, 10];
    stack.extend(set_err).unwrap();
    stack.extend(set_a).unwrap();
    let e = eq_set(&mut stack).unwrap_err();
    assert!(matches!(e, OpError::Decode(DecodeError::Set(s)) if s == set_err[..10]));

    // Decode error rhs.
    let set_err = [0, 1, 2, 3, 3, 4, 5, 9, 6, 1, 10];
    stack.extend(set_a).unwrap();
    stack.extend(set_err).unwrap();
    let e = eq_set(&mut stack).unwrap_err();
    assert!(matches!(e, OpError::Decode(DecodeError::Set(s)) if s == set_err[..10]));

    // Decode error both.
    let set_err = [0, 1, 2, 3, 3, 4, 5, 9, 6, 1, 10];
    stack.extend(set_err).unwrap();
    stack.extend(set_err).unwrap();
    let e = eq_set(&mut stack).unwrap_err();
    assert!(matches!(e, OpError::Decode(DecodeError::Set(s)) if s == set_err[..10]));
}