-
Notifications
You must be signed in to change notification settings - Fork 0
/
facts_test.go
71 lines (66 loc) · 1.32 KB
/
facts_test.go
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
package main
import (
"testing"
)
func TestAddRule(t *testing.T) {
trees := []TreeNode{
// A + B => D
// F + G => D
&BinaryGate{GateAnd,
&Value{'A'},
&Value{'B'}},
&BinaryGate{GateAnd,
&Value{'F'},
&Value{'G'}},
}
f := GetFacts()
f.HardReset()
// =A
f.UserSet([]byte{'A'})
for ii := range trees {
f.AddRule('D', trees[ii])
}
// Z => G
f.AddRule('G', &Value{'Z'})
res := f.UserQuery([]byte{'D'})
expected := []bool{false}
for ii := range expected {
if expected[ii] != res[ii] {
t.Error("ERR")
}
}
// A => B
f.AddRule('B', &Value{'A'})
res = f.UserQuery([]byte{'D', 'A', 'B', 'G'})
expected = []bool{true, true, true, false}
for ii := range expected {
if expected[ii] != res[ii] {
t.Error("ERR")
}
}
}
func TestLongDefinitions(t *testing.T) {
f := GetFacts()
f.HardReset()
f.AddRule('A', &Value{'B'})
f.AddRule('B', &Value{'C'})
f.AddRule('C', &Value{'D'})
// verbose = true
// fmt.Println("START")
res := f.UserQuery([]byte{'A'})
if res[0] != false || len(res) != 1 {
panic("SHOULD BE FALSE")
}
// fmt.Println("END")
f.UserSet([]byte{'D'})
res = f.UserQuery([]byte{'A'})
if res[0] != true || len(res) != 1 {
panic("SHOULD BE TRUE")
}
// fmt.Println("A")
res = f.UserQuery([]byte{'D'})
if res[0] != true || len(res) != 1 {
panic("SHOULD BE TRUE")
}
// verbose = false
}