blob: 23c52cec2f0a3fdea0b36e558366123dabc0b5e1 (
plain)
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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
|
open OUnit2
open Vytree
(* Destructuting a freshly made node gives us what
we made it from *)
let test_make_node test_ctxt =
let node = make () "root" in
assert_equal (name_of_node node) "root";
assert_equal (data_of_node node) ();
assert_equal (children_of_node node) []
(* XXX: these comparisons are awkward, but this is
probably the only way to track the problem
down to insert if insert breaks *)
(* Inserting at single-item path adds a child to
children list *)
let test_insert_immediate_child test_ctxt =
let node = make () "root" in
let node' = insert node ["foo"] () in
assert_equal (children_of_node node')
[make () "foo"]
(* Inserting one child after another works.
The default behaviour is to insert new items at the beginning. *)
let test_insert_multiple_children test_ctxt =
let node = make () "root" in
let node' = insert node ["foo"] () in
let node'' = insert node' ["bar"] () in
assert_equal (children_of_node node'')
[make () "bar"; make () "foo"]
(* Inserting a child at a two-item path creates a tree
two levels deep *)
let test_insert_multi_level test_ctxt =
let node = make () "root" in
let node = insert node ["foo"] () in
let node = insert node ["foo"; "bar"] () in
let bar = make () "bar" in
let foo = make_full () "foo" [bar] in
let root = make_full () "root" [foo] in
assert_equal root node
(* Inserting duplicate child fails *)
let test_insert_duplicate_child test_ctxt =
let node = make () "root" in
let node = insert node ["foo"] () in
assert_raises Duplicate_child (fun () -> insert node ["foo"] ())
(* Inserting a child at the end works *)
let test_insert_multiple_children_end test_ctxt =
let node = make () "root" in
let node = insert node ["foo"] () in
let node = insert ~position:End node ["bar"] () in
assert_equal (children_of_node node)
[make () "foo"; make () "bar"]
(* list_children correctly returns a list of children names *)
let test_list_children test_ctxt =
let node = make () "root" in
let node = insert node ["foo"] () in
let node = insert node ["bar"] () in
assert_equal (list_children node) ["bar"; "foo"]
(* Deleting a child, well, deletes it *)
let test_delete_immediate_child test_ctxt =
let node = make () "root" in
let node' = insert node ["foo"] () in
let node' = delete node' ["foo"] in
assert_equal node node'
(* Deleting a child at multi-level path works *)
let test_delete_multi_level test_ctxt =
let node = make () "root" in
let node' = insert node ["foo"] () in
let node' = insert node' ["foo"; "bar"] () in
let foo_node = insert node ["foo"] () in
let node' = delete node' ["foo"; "bar"] in
assert_equal node' foo_node
(* Attempt to delete a node at non-existent path raises an exception *)
let test_delete_nonexistent test_ctxt =
let node = make () "root" in
assert_raises Nonexistent_path (fun () -> delete node ["foo"; "bar"])
(* get_child works with immediate children *)
let test_get_immediate_child test_ctxt =
let node = make () "root" in
let node' = insert node ["foo"] () in
assert_equal (name_of_node (get node' ["foo"])) "foo"
(* get_child works with multi-level paths *)
let test_get_child_multilevel test_ctxt =
let node = make () "root" in
let node = insert node ["foo"] () in
let node = insert node ["foo"; "bar"] () in
assert_equal (name_of_node (get node ["foo"; "bar"])) "bar"
(* get_child raises Nonexistent_path for non-existent paths *)
let test_get_child_nonexistent test_ctxt =
let node = make () "root" in
assert_raises Nonexistent_path (fun () -> get node ["foo"; "bar"])
(* update works *)
let test_update test_ctxt =
let node = make 0 "root" in
let node = insert node ["foo"] 1 in
assert_equal (data_of_node (get (update node ["foo"] 9) ["foo"])) 9
(* rename works *)
let test_rename test_ctxt =
let node = make 0 "root" in
let node = insert node ["foo"] 1 in
let node = insert node ["bar"] 2 in
let node' = rename node ["bar"] "quux" in
let child_quux = get node' ["quux"] in
assert_equal (data_of_node child_quux) 2
(* get_existent_path works *)
let test_get_existent_path test_ctxt =
let node = make () "root" in
let node = insert node ["foo"] () in
let node = insert node ["foo"; "bar"] () in
assert_equal (get_existent_path node ["foo"; "bar"; "baz"]) ["foo"; "bar"]
let test_exists_existent test_ctxt =
let node = make () "root" in
let node = insert node ["foo"] () in
let node = insert node ["foo"; "bar"] () in
assert_equal (exists node ["foo"; "bar"]) true
let test_exists_nonexistent test_ctxt =
let node = make () "root" in
let node = insert node ["foo"] () in
let node = insert node ["foo"; "bar"] () in
assert_equal (exists node ["foo"; "bar"; "baz"]) false
let test_get_data test_ctxt =
let node = make 0 "root" in
let node = insert node ["foo"] 1 in
let node = insert node ["foo"; "bar"] 42 in
assert_equal (get_data node ["foo"; "bar"]) 42
(* merge_children should have no effect if there are
no children with duplicate names *)
let test_merge_children_no_duplicates test_ctxt =
let node = make_full () "root"
[make_full () "foo" [make () "bar"];
make () "bar";
make_full () "baz" [make () "quuz"]] in
let node' = merge_children (fun x y -> x) node in
assert_equal (list_children node') ["foo"; "bar"; "baz"]
(* If node has children with duplicate names, then
1. Only the first should be left
2. Children of all other nodes should be appended to its own *)
let test_merge_children_has_duplicates test_ctxt =
let node = make_full () "root"
[make_full () "foo" [make () "bar"];
make () "quux";
make_full () "foo" [make () "baz"]] in
let node' = merge_children (fun x y -> x) node in
assert_equal (list_children node') ["foo"; "quux"];
assert_equal (get node' ["foo"] |> list_children) ["bar"; "baz"]
let suite =
"VyConf tree tests" >::: [
"test_make_node" >:: test_make_node;
"test_insert_immediate_child" >:: test_insert_immediate_child;
"test_insert_multiple_children" >:: test_insert_multiple_children;
"test_insert_multi_level" >:: test_insert_multi_level;
"test_insert_duplicate_child" >:: test_insert_duplicate_child;
"test_insert_multiple_children_end" >:: test_insert_multiple_children_end;
"test_list_children" >:: test_list_children;
"test_delete_immediate_child" >:: test_delete_immediate_child;
"test_delete_multi_level" >:: test_delete_multi_level;
"test_delete_nonexistent" >:: test_delete_nonexistent;
"test_get_immediate_child" >:: test_get_immediate_child;
"test_get_child_multilevel" >:: test_get_child_multilevel;
"test_get_child_nonexistent" >:: test_get_child_nonexistent;
"test_update" >:: test_update;
"test_rename" >:: test_rename;
"test_get_existent_path" >:: test_get_existent_path;
"test_exists_existent" >:: test_exists_existent;
"test_exists_nonexistent" >:: test_exists_nonexistent;
"test_get_data" >:: test_get_data;
"test_merge_children_has_duplicates" >:: test_merge_children_has_duplicates;
"test_merge_children_no_duplicates" >:: test_merge_children_no_duplicates;
]
let () =
run_test_tt_main suite
|
