FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
plibsys/tests/ptree_test.cpp at master · case2111/plibsys · GitHub
case2111
/
plibsys
Public
forked from
saprykin/plibsys
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
plibsys
/
tests
/
ptree_test.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
625 lines (474 loc) · 16.6 KB
Breadcrumbs
plibsys
/
tests
/
ptree_test.cpp
Copy path
File metadata and controls
625 lines (474 loc) · 16.6 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
/*
* Copyright (C) 2015-2017 Alexander Saprykin <xelfium@gmail.com>
*
* This library is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this library; if not, see <http://www.gnu.org/licenses/>.
*/
#
include
"
plibsys.h
"
#
include
"
ptestmacros.h
"
#
include
<
stdlib.h
>
#
include
<
string.h
>
#
include
<
time.h
>
#
include
<
math.h
>
P_TEST_MODULE_INIT
();
#
define
PTREE_STRESS_ITERATIONS
20
#
define
PTREE_STRESS_NODES
10000
#
define
PTREE_STRESS_ROOT_MIN
10000
#
define
PTREE_STRESS_TRAVS
30
typedef
struct
_TreeData
{
pint cmp_counter;
pint key_destroy_counter;
pint value_destroy_counter;
pint traverse_counter;
pint traverse_thres;
pint key_sum;
pint value_sum;
pint last_key;
pint key_order_errors;
} TreeData;
static
TreeData tree_data = {
0
,
0
,
0
,
0
,
0
,
0
,
0
,
0
,
0
};
extern
"
C
"
ppointer
pmem_alloc
(psize nbytes)
{
P_UNUSED
(nbytes);
return
(ppointer)
NULL
;
}
extern
"
C
"
ppointer
pmem_realloc
(ppointer block, psize nbytes)
{
P_UNUSED
(block);
P_UNUSED
(nbytes);
return
(ppointer)
NULL
;
}
extern
"
C
"
void
pmem_free
(ppointer block)
{
P_UNUSED
(block);
}
static
pint
tree_complexity
(PTree *tree)
{
if
(tree ==
NULL
||
p_tree_get_nnodes
(tree) ==
0
)
return
0
;
switch
(
p_tree_get_type
(tree)) {
case
P_TREE_TYPE_BINARY
:
return
p_tree_get_nnodes
(tree);
case
P_TREE_TYPE_RB
:
return
2
* ((pint) (
log
((
double
)
p_tree_get_nnodes
(tree) +
1
) /
log
(
2.0
)));
case
P_TREE_TYPE_AVL
:
{
double
phi = (
1
+
sqrt
(
5.0
)) /
2.0
;
return
(pint) (
log
(
sqrt
(
5.0
) * (
p_tree_get_nnodes
(tree) +
2
)) /
log
(phi) -
2
);
}
default
:
return
p_tree_get_nnodes
(tree);
}
}
static
pint
compare_keys
(pconstpointer a, pconstpointer b)
{
int
p1 =
PPOINTER_TO_INT
(a);
int
p2 =
PPOINTER_TO_INT
(b);
if
(p1 < p2)
return
-
1
;
else
if
(p1 > p2)
return
1
;
else
return
0
;
}
static
pint
compare_keys_data
(pconstpointer a, pconstpointer b, ppointer data)
{
int
p1 =
PPOINTER_TO_INT
(a);
int
p2 =
PPOINTER_TO_INT
(b);
if
(data !=
NULL
)
((TreeData *) data)->
cmp_counter
++;
if
(p1 < p2)
return
-
1
;
else
if
(p1 > p2)
return
1
;
else
return
0
;
}
static
void
key_destroy_notify
(ppointer data)
{
tree_data.
key_destroy_counter
++;
tree_data.
key_sum
+=
PPOINTER_TO_INT
(data);
}
static
void
value_destroy_notify
(ppointer data)
{
tree_data.
value_destroy_counter
++;
tree_data.
value_sum
+=
PPOINTER_TO_INT
(data);
}
static
pboolean
tree_traverse
(ppointer key, ppointer value, ppointer data)
{
TreeData* tdata = ((TreeData *) data);
tdata->
key_sum
+=
PPOINTER_TO_INT
(key);
tdata->
value_sum
+=
PPOINTER_TO_INT
(value);
tdata->
traverse_counter
++;
if
(tdata->
last_key
>=
PPOINTER_TO_INT
(key))
tdata->
key_order_errors
++;
tdata->
last_key
=
PPOINTER_TO_INT
(key);
return
FALSE
;
}
static
pboolean
tree_traverse_thres
(ppointer key, ppointer value, ppointer data)
{
TreeData* tdata = ((TreeData *) data);
tree_traverse
(key, value, data);
return
tdata->
traverse_counter
>= tdata->
traverse_thres
?
TRUE
:
FALSE
;
}
static
bool
check_tree_data_is_zero
()
{
return
tree_data.
cmp_counter
==
0
&&
tree_data.
key_destroy_counter
==
0
&&
tree_data.
value_destroy_counter
==
0
&&
tree_data.
traverse_counter
==
0
&&
tree_data.
traverse_thres
==
0
&&
tree_data.
key_sum
==
0
&&
tree_data.
value_sum
==
0
&&
tree_data.
last_key
==
0
&&
tree_data.
key_order_errors
==
0
;
}
static
bool
general_tree_test
(PTree *tree, PTreeType type,
bool
check_cmp,
bool
check_notify)
{
memset
(&tree_data,
0
,
sizeof
(tree_data));
P_TEST_REQUIRE
(tree !=
NULL
);
P_TEST_CHECK
(
p_tree_get_nnodes
(tree) ==
0
);
P_TEST_CHECK
(
p_tree_get_type
(tree) == type);
P_TEST_CHECK
(
p_tree_lookup
(tree,
NULL
) ==
NULL
);
P_TEST_CHECK
(
p_tree_remove
(tree,
NULL
) ==
FALSE
);
p_tree_insert
(tree,
NULL
,
PINT_TO_POINTER
(
10
));
P_TEST_CHECK
(
p_tree_get_nnodes
(tree) ==
1
);
P_TEST_CHECK
(
p_tree_lookup
(tree,
NULL
) ==
PINT_TO_POINTER
(
10
));
P_TEST_CHECK
(
p_tree_lookup
(tree,
PINT_TO_POINTER
(
2
)) ==
NULL
);
P_TEST_CHECK
(
p_tree_remove
(tree,
NULL
) ==
TRUE
);
P_TEST_CHECK
(
p_tree_get_nnodes
(tree) ==
0
);
p_tree_foreach
(tree, (PTraverseFunc) tree_traverse, &tree_data);
P_TEST_CHECK
(tree_data.
traverse_counter
==
0
);
P_TEST_CHECK
(tree_data.
key_order_errors
==
0
);
/*
Because we have NULL-key node
*/
P_TEST_CHECK
(tree_data.
key_sum
==
0
);
if
(check_notify)
P_TEST_CHECK
(tree_data.
value_sum
==
10
);
else
P_TEST_CHECK
(tree_data.
value_sum
==
0
);
memset
(&tree_data,
0
,
sizeof
(tree_data));
p_tree_insert
(tree,
PINT_TO_POINTER
(
4
),
PINT_TO_POINTER
(
40
));
p_tree_insert
(tree,
PINT_TO_POINTER
(
1
),
PINT_TO_POINTER
(
10
));
p_tree_insert
(tree,
PINT_TO_POINTER
(
5
),
PINT_TO_POINTER
(
50
));
p_tree_insert
(tree,
PINT_TO_POINTER
(
2
),
PINT_TO_POINTER
(
20
));
p_tree_insert
(tree,
PINT_TO_POINTER
(
6
),
PINT_TO_POINTER
(
60
));
p_tree_insert
(tree,
PINT_TO_POINTER
(
3
),
PINT_TO_POINTER
(
30
));
P_TEST_CHECK
(
p_tree_get_nnodes
(tree) ==
6
);
p_tree_insert
(tree,
PINT_TO_POINTER
(
1
),
PINT_TO_POINTER
(
100
));
p_tree_insert
(tree,
PINT_TO_POINTER
(
5
),
PINT_TO_POINTER
(
500
));
P_TEST_CHECK
(
p_tree_get_nnodes
(tree) ==
6
);
p_tree_insert
(tree,
PINT_TO_POINTER
(
1
),
PINT_TO_POINTER
(
10
));
p_tree_insert
(tree,
PINT_TO_POINTER
(
5
),
PINT_TO_POINTER
(
50
));
P_TEST_CHECK
(
p_tree_get_nnodes
(tree) ==
6
);
if
(check_cmp)
P_TEST_CHECK
(tree_data.
cmp_counter
>
0
);
else
P_TEST_CHECK
(tree_data.
cmp_counter
==
0
);
if
(check_notify) {
P_TEST_CHECK
(tree_data.
key_sum
==
12
);
P_TEST_CHECK
(tree_data.
value_sum
==
660
);
}
else
{
P_TEST_CHECK
(tree_data.
key_sum
==
0
);
P_TEST_CHECK
(tree_data.
value_sum
==
0
);
}
P_TEST_CHECK
(tree_data.
traverse_counter
==
0
);
P_TEST_CHECK
(tree_data.
key_order_errors
==
0
);
memset
(&tree_data,
0
,
sizeof
(tree_data));
p_tree_foreach
(tree, (PTraverseFunc) tree_traverse, &tree_data);
P_TEST_CHECK
(
p_tree_get_nnodes
(tree) ==
6
);
P_TEST_CHECK
(tree_data.
cmp_counter
==
0
);
P_TEST_CHECK
(tree_data.
key_sum
==
21
);
P_TEST_CHECK
(tree_data.
value_sum
==
210
);
P_TEST_CHECK
(tree_data.
traverse_counter
==
6
);
P_TEST_CHECK
(tree_data.
key_order_errors
==
0
);
memset
(&tree_data,
0
,
sizeof
(tree_data));
for
(
int
i =
0
; i <
7
; ++i)
P_TEST_CHECK
(
p_tree_lookup
(tree,
PINT_TO_POINTER
(i)) ==
PINT_TO_POINTER
(i *
10
));
if
(check_cmp)
P_TEST_CHECK
(tree_data.
cmp_counter
>
0
);
else
P_TEST_CHECK
(tree_data.
cmp_counter
==
0
);
P_TEST_CHECK
(tree_data.
key_sum
==
0
);
P_TEST_CHECK
(tree_data.
value_sum
==
0
);
P_TEST_CHECK
(tree_data.
key_order_errors
==
0
);
tree_data.
cmp_counter
=
0
;
P_TEST_CHECK
(
p_tree_remove
(tree,
PINT_TO_POINTER
(
7
)) ==
FALSE
);
if
(check_cmp)
P_TEST_CHECK
(tree_data.
cmp_counter
>
0
&&
tree_data.
cmp_counter
<=
tree_complexity
(tree));
else
P_TEST_CHECK
(tree_data.
cmp_counter
==
0
);
if
(check_notify) {
P_TEST_CHECK
(tree_data.
key_sum
==
0
);
P_TEST_CHECK
(tree_data.
value_sum
==
0
);
}
tree_data.
cmp_counter
=
0
;
for
(
int
i =
0
; i <
7
; ++i)
P_TEST_CHECK
(
p_tree_lookup
(tree,
PINT_TO_POINTER
(i)) ==
PINT_TO_POINTER
(i *
10
));
if
(check_cmp)
P_TEST_CHECK
(tree_data.
cmp_counter
>
0
);
else
P_TEST_CHECK
(tree_data.
cmp_counter
==
0
);
P_TEST_CHECK
(tree_data.
key_sum
==
0
);
P_TEST_CHECK
(tree_data.
value_sum
==
0
);
P_TEST_CHECK
(tree_data.
key_order_errors
==
0
);
memset
(&tree_data,
0
,
sizeof
(tree_data));
tree_data.
traverse_thres
=
5
;
p_tree_foreach
(tree, (PTraverseFunc) tree_traverse_thres, &tree_data);
P_TEST_CHECK
(
p_tree_get_nnodes
(tree) ==
6
);
P_TEST_CHECK
(tree_data.
cmp_counter
==
0
);
P_TEST_CHECK
(tree_data.
key_sum
==
15
);
P_TEST_CHECK
(tree_data.
value_sum
==
150
);
P_TEST_CHECK
(tree_data.
traverse_counter
==
5
);
P_TEST_CHECK
(tree_data.
key_order_errors
==
0
);
memset
(&tree_data,
0
,
sizeof
(tree_data));
tree_data.
traverse_thres
=
3
;
p_tree_foreach
(tree, (PTraverseFunc) tree_traverse_thres, &tree_data);
P_TEST_CHECK
(
p_tree_get_nnodes
(tree) ==
6
);
P_TEST_CHECK
(tree_data.
cmp_counter
==
0
);
P_TEST_CHECK
(tree_data.
key_sum
==
6
);
P_TEST_CHECK
(tree_data.
value_sum
==
60
);
P_TEST_CHECK
(tree_data.
traverse_counter
==
3
);
P_TEST_CHECK
(tree_data.
key_order_errors
==
0
);
memset
(&tree_data,
0
,
sizeof
(tree_data));
P_TEST_CHECK
(
p_tree_remove
(tree,
PINT_TO_POINTER
(
1
)) ==
TRUE
);
P_TEST_CHECK
(
p_tree_remove
(tree,
PINT_TO_POINTER
(
6
)) ==
TRUE
);
P_TEST_CHECK
(
p_tree_lookup
(tree,
PINT_TO_POINTER
(
1
)) ==
NULL
);
P_TEST_CHECK
(
p_tree_lookup
(tree,
PINT_TO_POINTER
(
6
)) ==
NULL
);
if
(check_cmp)
P_TEST_CHECK
(tree_data.
cmp_counter
>
0
);
else
P_TEST_CHECK
(tree_data.
cmp_counter
==
0
);
if
(check_notify) {
P_TEST_CHECK
(tree_data.
key_sum
==
7
);
P_TEST_CHECK
(tree_data.
value_sum
==
70
);
}
else
{
P_TEST_CHECK
(tree_data.
key_sum
==
0
);
P_TEST_CHECK
(tree_data.
value_sum
==
0
);
}
tree_data.
cmp_counter
=
0
;
for
(
int
i =
2
; i <
6
; ++i)
P_TEST_CHECK
(
p_tree_lookup
(tree,
PINT_TO_POINTER
(i)) ==
PINT_TO_POINTER
(i *
10
));
if
(check_cmp)
P_TEST_CHECK
(tree_data.
cmp_counter
>
0
);
else
P_TEST_CHECK
(tree_data.
cmp_counter
==
0
);
if
(check_notify) {
P_TEST_CHECK
(tree_data.
key_sum
==
7
);
P_TEST_CHECK
(tree_data.
value_sum
==
70
);
}
else
{
P_TEST_CHECK
(tree_data.
key_sum
==
0
);
P_TEST_CHECK
(tree_data.
value_sum
==
0
);
}
P_TEST_CHECK
(tree_data.
key_order_errors
==
0
);
tree_data.
cmp_counter
=
0
;
p_tree_foreach
(tree,
NULL
,
NULL
);
P_TEST_CHECK
(tree_data.
cmp_counter
==
0
);
P_TEST_CHECK
(tree_data.
key_order_errors
==
0
);
p_tree_clear
(tree);
P_TEST_CHECK
(tree_data.
cmp_counter
==
0
);
P_TEST_CHECK
(tree_data.
key_order_errors
==
0
);
if
(check_notify) {
P_TEST_CHECK
(tree_data.
key_sum
==
21
);
P_TEST_CHECK
(tree_data.
value_sum
==
210
);
}
else
{
P_TEST_CHECK
(tree_data.
key_sum
==
0
);
P_TEST_CHECK
(tree_data.
value_sum
==
0
);
}
P_TEST_CHECK
(
p_tree_get_nnodes
(tree) ==
0
);
return
true
;
}
static
bool
stress_tree_test
(PTree *tree,
int
node_count)
{
P_TEST_REQUIRE
(tree !=
NULL
);
P_TEST_REQUIRE
(node_count >
0
);
P_TEST_CHECK
(
p_tree_get_nnodes
(tree) ==
0
);
srand
((
unsigned
int
)
time
(
NULL
));
int
counter =
0
;
memset
(&tree_data,
0
,
sizeof
(tree_data));
pint *keys = (pint *)
p_malloc0
((psize) node_count *
sizeof
(pint));
pint *values = (pint *)
p_malloc0
((psize) node_count *
sizeof
(pint));
P_TEST_REQUIRE
(keys !=
NULL
);
P_TEST_REQUIRE
(values !=
NULL
);
while
(counter != node_count) {
pint rand_number =
rand
();
if
(counter ==
0
&& rand_number <
PTREE_STRESS_ROOT_MIN
)
continue
;
memset
(&tree_data,
0
,
sizeof
(tree_data));
if
(
p_tree_lookup
(tree,
PINT_TO_POINTER
(rand_number)) !=
NULL
)
continue
;
if
(counter >
0
)
P_TEST_CHECK
(tree_data.
cmp_counter
>
0
&&
tree_data.
cmp_counter
<=
tree_complexity
(tree));
memset
(&tree_data,
0
,
sizeof
(tree_data));
keys[counter] = rand_number;
values[counter] =
rand
() +
1
;
p_tree_insert
(tree,
PINT_TO_POINTER
(keys[counter]),
PINT_TO_POINTER
(values[counter]));
if
(counter >
0
)
P_TEST_CHECK
(tree_data.
cmp_counter
>
0
&&
tree_data.
cmp_counter
<=
tree_complexity
(tree));
++counter;
}
for
(
int
i =
0
; i <
PTREE_STRESS_TRAVS
; ++i) {
memset
(&tree_data,
0
,
sizeof
(tree_data));
tree_data.
traverse_thres
= i +
1
;
tree_data.
last_key
= -
1
;
p_tree_foreach
(tree, (PTraverseFunc) tree_traverse_thres, &tree_data);
P_TEST_CHECK
(tree_data.
traverse_counter
== i +
1
);
P_TEST_CHECK
(tree_data.
key_order_errors
==
0
);
}
for
(
int
i =
0
; i < node_count; ++i) {
memset
(&tree_data,
0
,
sizeof
(tree_data));
P_TEST_CHECK
(
p_tree_lookup
(tree,
PINT_TO_POINTER
(keys[i])) ==
PINT_TO_POINTER
(values[i]));
P_TEST_CHECK
(tree_data.
cmp_counter
>
0
&&
tree_data.
cmp_counter
<=
tree_complexity
(tree));
P_TEST_CHECK
(
p_tree_remove
(tree,
PINT_TO_POINTER
(keys[i])) ==
TRUE
);
P_TEST_CHECK
(
p_tree_lookup
(tree,
PINT_TO_POINTER
(keys[i])) ==
NULL
);
}
P_TEST_CHECK
(
p_tree_get_nnodes
(tree) ==
0
);
for
(
int
i =
0
; i < node_count; ++i)
p_tree_insert
(tree,
PINT_TO_POINTER
(keys[i]),
PINT_TO_POINTER
(values[i]));
P_TEST_CHECK
(
p_tree_get_nnodes
(tree) == node_count);
p_tree_clear
(tree);
P_TEST_CHECK
(
p_tree_get_nnodes
(tree) ==
0
);
p_free
(keys);
p_free
(values);
return
true
;
}
P_TEST_CASE_BEGIN
(ptree_nomem_test)
{
p_libsys_init
();
PMemVTable vtable;
for
(
int
i = (
int
)
P_TREE_TYPE_BINARY
; i <= (
int
)
P_TREE_TYPE_AVL
; ++i) {
PTree *tree =
p_tree_new
((PTreeType) i, (PCompareFunc) compare_keys);
P_TEST_CHECK
(tree !=
NULL
);
vtable.
free
= pmem_free;
vtable.
malloc
= pmem_alloc;
vtable.
realloc
= pmem_realloc;
P_TEST_CHECK
(
p_mem_set_vtable
(&vtable) ==
TRUE
);
P_TEST_CHECK
(
p_tree_new
((PTreeType) i, (PCompareFunc) compare_keys) ==
NULL
);
p_tree_insert
(tree,
PINT_TO_POINTER
(
1
),
PINT_TO_POINTER
(
10
));
P_TEST_CHECK
(
p_tree_get_nnodes
(tree) ==
0
);
p_mem_restore_vtable
();
p_tree_free
(tree);
}
p_libsys_shutdown
();
}
P_TEST_CASE_END
()
P_TEST_CASE_BEGIN
(ptree_invalid_test)
{
p_libsys_init
();
for
(
int
i = (
int
)
P_TREE_TYPE_BINARY
; i <= (
int
)
P_TREE_TYPE_AVL
; ++i) {
/*
Invalid usage
*/
P_TEST_CHECK
(
p_tree_new
((PTreeType) i,
NULL
) ==
NULL
);
P_TEST_CHECK
(
p_tree_new
((PTreeType) -
1
, (PCompareFunc) compare_keys) ==
NULL
);
P_TEST_CHECK
(
p_tree_new
((PTreeType) -
1
,
NULL
) ==
NULL
);
P_TEST_CHECK
(
p_tree_new_with_data
((PTreeType) i,
NULL
,
NULL
) ==
NULL
);
P_TEST_CHECK
(
p_tree_new_with_data
((PTreeType) -
1
, (PCompareDataFunc) compare_keys,
NULL
) ==
NULL
);
P_TEST_CHECK
(
p_tree_new_with_data
((PTreeType) -
1
,
NULL
,
NULL
) ==
NULL
);
P_TEST_CHECK
(
p_tree_new_full
((PTreeType) i,
NULL
,
NULL
,
NULL
,
NULL
) ==
NULL
);
P_TEST_CHECK
(
p_tree_new_full
((PTreeType) -
1
,
(PCompareDataFunc) compare_keys,
NULL
,
NULL
,
NULL
) ==
NULL
);
P_TEST_CHECK
(
p_tree_new_full
((PTreeType) -
1
,
NULL
,
NULL
,
NULL
,
NULL
) ==
NULL
);
P_TEST_CHECK
(
p_tree_remove
(
NULL
,
NULL
) ==
FALSE
);
P_TEST_CHECK
(
p_tree_lookup
(
NULL
,
NULL
) ==
NULL
);
P_TEST_CHECK
(
p_tree_get_type
(
NULL
) == (PTreeType) -
1
);
P_TEST_CHECK
(
p_tree_get_nnodes
(
NULL
) ==
0
);
p_tree_insert
(
NULL
,
NULL
,
NULL
);
p_tree_foreach
(
NULL
,
NULL
,
NULL
);
p_tree_clear
(
NULL
);
p_tree_free
(
NULL
);
}
p_libsys_shutdown
();
}
P_TEST_CASE_END
()
P_TEST_CASE_BEGIN
(ptree_general_test)
{
PTree *tree;
p_libsys_init
();
for
(
int
i = (
int
)
P_TREE_TYPE_BINARY
; i <= (
int
)
P_TREE_TYPE_AVL
; ++i) {
/*
Test 1
*/
tree =
p_tree_new
((PTreeType) i, (PCompareFunc) compare_keys);
P_TEST_CHECK
(
general_tree_test
(tree, (PTreeType) i,
false
,
false
) ==
true
);
memset
(&tree_data,
0
,
sizeof
(tree_data));
p_tree_free
(tree);
P_TEST_CHECK
(
check_tree_data_is_zero
() ==
true
);
/*
Test 2
*/
tree =
p_tree_new_with_data
((PTreeType) i,
(PCompareDataFunc) compare_keys_data,
&tree_data);
P_TEST_CHECK
(
general_tree_test
(tree, (PTreeType) i,
true
,
false
) ==
true
);
memset
(&tree_data,
0
,
sizeof
(tree_data));
p_tree_free
(tree);
P_TEST_CHECK
(
check_tree_data_is_zero
() ==
true
);
/*
Test 3
*/
tree =
p_tree_new_full
((PTreeType) i,
(PCompareDataFunc) compare_keys_data,
&tree_data,
(PDestroyFunc) key_destroy_notify,
(PDestroyFunc) value_destroy_notify);
P_TEST_CHECK
(
general_tree_test
(tree, (PTreeType) i,
true
,
true
) ==
true
);
memset
(&tree_data,
0
,
sizeof
(tree_data));
p_tree_free
(tree);
P_TEST_CHECK
(
check_tree_data_is_zero
() ==
true
);
}
p_libsys_shutdown
();
}
P_TEST_CASE_END
()
P_TEST_CASE_BEGIN
(ptree_stress_test)
{
PTree *tree;
p_libsys_init
();
for
(
int
i = (
int
)
P_TREE_TYPE_BINARY
; i <= (
int
)
P_TREE_TYPE_AVL
; ++i) {
tree =
p_tree_new_full
((PTreeType) i,
(PCompareDataFunc) compare_keys_data,
&tree_data,
(PDestroyFunc) key_destroy_notify,
(PDestroyFunc) value_destroy_notify);
for
(
int
j =
0
; j <
PTREE_STRESS_ITERATIONS
; ++j)
P_TEST_CHECK
(
stress_tree_test
(tree,
PTREE_STRESS_NODES
) ==
true
);
p_tree_free
(tree);
}
p_libsys_shutdown
();
}
P_TEST_CASE_END
()
P_TEST_SUITE_BEGIN
()
{
P_TEST_SUITE_RUN_CASE
(ptree_nomem_test);
P_TEST_SUITE_RUN_CASE
(ptree_invalid_test);
P_TEST_SUITE_RUN_CASE
(ptree_general_test);
P_TEST_SUITE_RUN_CASE
(ptree_stress_test);
}
P_TEST_SUITE_END
()
Back
|
FazBrowse Home
|
New Git URL