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
113
114
|
discard """
output: "SUCCESS"
"""
# A test to ensure that the order in which a variant
# object is constructed doesn't matter.
type
NodeKind = enum
Literal, Operator
Node = ref object
case kind: NodeKind
of Literal:
value: int
of Operator:
left, right: Node
operator: char
# The trees used through out this test should
# be the same after construction, the only difference
# being the way we specify their construction.
# This will test that all the values are what we expect.
proc assertTree(root: Node) =
# check root of tree
doAssert root.kind == Operator
doAssert root.operator == '*'
# check left subtree
doAssert root.left.value == 5
doAssert root.left.kind == Literal
# check right subtree
doAssert root.right.kind == Operator
doAssert root.right.operator == '+'
doAssert root.right.left.value == 5
doAssert root.right.left.kind == Literal
doAssert root.right.right.value == 10
doAssert root.right.right.kind == Literal
proc newLiteralNode(value: int): Node =
result = Node(
kind: Literal,
value: value
)
var rootOrder1 = Node(
kind: Operator,
operator: '*',
left: newLiteralNode(5),
right: Node(
left: newLiteralNode(5),
right: newLiteralNode(10),
kind: Operator,
operator: '+'
)
)
assertTree(rootOrder1)
var rootOrder2 = Node(
operator: '*',
kind: Operator,
left: newLiteralNode(5),
right: Node(
left: newLiteralNode(5),
right: newLiteralNode(10),
kind: Operator,
operator: '+'
)
)
assertTree(rootOrder2)
var rootOrder3 = Node(
left: newLiteralNode(5),
operator: '*',
kind: Operator,
right: Node(
left: newLiteralNode(5),
right: newLiteralNode(10),
kind: Operator,
operator: '+'
)
)
assertTree(rootOrder3)
var rootOrder4 = Node(
left: newLiteralNode(5),
operator: '*',
kind: Operator,
right: Node(
left: newLiteralNode(5),
kind: Operator,
operator: '+',
right: newLiteralNode(10)
)
)
assertTree(rootOrder4)
var rootOrder5 = Node(
left: newLiteralNode(5),
operator: '*',
kind: Operator,
right: Node(
left: newLiteralNode(5),
operator: '+',
right: newLiteralNode(10),
kind: Operator
)
)
assertTree(rootOrder5)
echo "SUCCESS"
|
