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
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
|
(*
This file is part of licht.
licht is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
licht is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with licht. If not, see <http://www.gnu.org/licenses/>.
*)
open OUnit2
(** Module for the keys *)
module K = struct
type 'a t = Int : int -> int t [@@unboxed]
let comp:type a b. a t -> b t -> (a, b) Tools.cmp = fun a b -> begin
match a, b with Int a, Int b ->
if a < b then
Tools.Lt
else if a > b then
Tools.Gt
else
Tools.Eq
end
let repr: type a. Format.formatter -> a t -> unit = fun formatter (Int a) ->
Format.fprintf formatter "%d" a
end
module SplayTest = Splay.Make(K)
let test_add ctx = begin
let tree =
SplayTest.empty
|> SplayTest.add (K.Int 1) (-1)
|> SplayTest.add (K.Int 3) 2
|> SplayTest.add (K.Int 5) 2
|> SplayTest.add (K.Int 4) 1 in
let formatter = Format.str_formatter in
SplayTest.repr formatter tree;
let str = Format.flush_str_formatter () in
let expected = "digraph G {\n\
\"4\" -> \"3\"\n\
\"3\" -> \"1\"\n\
\"4\" -> \"5\"\n\
}" in
let result = str in
let msg = Printf.sprintf "Expected %s, but got %s." expected result in
assert_equal
~msg
expected
result
end
let test_removeLeaf ctx = begin
let tree =
SplayTest.empty
|> SplayTest.remove (K.Int 4)
in
let formatter = Format.str_formatter in
SplayTest.repr formatter tree;
let str = Format.flush_str_formatter () in
let expected = "digraph G {}" in
let result = str in
let msg = Printf.sprintf "Expected %s, but got %s." expected result in
assert_equal
~msg
expected
result
end
let test_removeTop ctx = begin
let tree =
SplayTest.empty
|> SplayTest.add (K.Int 1) (-1)
|> SplayTest.add (K.Int 3) 2
|> SplayTest.add (K.Int 5) 2
|> SplayTest.add (K.Int 4) 1
|> SplayTest.remove (K.Int 4)
in
let formatter = Format.str_formatter in
SplayTest.repr formatter tree;
let str = Format.flush_str_formatter () in
let expected = "digraph G {\n\
\"3\" -> \"1\"\n\
\"3\" -> \"5\"\n\
}" in
let result = str in
let msg = Printf.sprintf "Expected %s, but got %s." expected result in
assert_equal
~msg
expected
result
end
let test_removeLeft ctx = begin
let tree =
SplayTest.empty
|> SplayTest.add (K.Int 1) (-1)
|> SplayTest.add (K.Int 3) 2
|> SplayTest.add (K.Int 5) 2
|> SplayTest.add (K.Int 4) 1
|> SplayTest.remove (K.Int 3)
in
let formatter = Format.str_formatter in
SplayTest.repr formatter tree;
let str = Format.flush_str_formatter () in
let expected = "digraph G {\n\
\"1\" -> \"4\"\n\
\"4\" -> \"5\"\n\
}" in
let result = str in
let msg = Printf.sprintf "Expected %s, but got %s." expected result in
assert_equal
~msg
expected
result
end
(** Remove a value not present in the tree.
The tree shall be rebalanced. *)
let test_removeOutMax ctx = begin
let tree =
SplayTest.empty
|> SplayTest.add (K.Int 1) (-1)
|> SplayTest.add (K.Int 3) 2
|> SplayTest.add (K.Int 5) 2
|> SplayTest.add (K.Int 4) 1
|> SplayTest.remove (K.Int 6)
in
let formatter = Format.str_formatter in
SplayTest.repr formatter tree;
let str = Format.flush_str_formatter () in
let expected = "digraph G {\n\
\"5\" -> \"4\"\n\
\"4\" -> \"3\"\n\
\"3\" -> \"1\"\n\
}" in
let result = str in
let msg = Printf.sprintf "Expected %s, but got %s." expected result in
assert_equal
~msg
expected
result
end
(** Remove the maximum value in the tree *)
let test_removeMax ctx = begin
let tree =
SplayTest.empty
|> SplayTest.add (K.Int 1) (-1)
|> SplayTest.add (K.Int 3) 2
|> SplayTest.add (K.Int 5) 2
|> SplayTest.add (K.Int 4) 1
|> SplayTest.remove (K.Int 5)
in
let formatter = Format.str_formatter in
SplayTest.repr formatter tree;
let str = Format.flush_str_formatter () in
let expected = "digraph G {\n\
\"4\" -> \"3\"\n\
\"3\" -> \"1\"\n\
}" in
let result = str in
let msg = Printf.sprintf "Expected %s, but got %s." expected result in
assert_equal
~msg
expected
result
end
let tests = "splay_test">::: [
"add" >:: test_add;
"removeLeaf" >:: test_removeLeaf;
"removeTop" >:: test_removeTop;
"removeLeft" >:: test_removeLeft;
"removeMax" >:: test_removeMax;
"removeOutMax" >:: test_removeOutMax;
]
|
