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
|
/* Copyright (C) 2014-2017 CZ.NIC, z.s.p.o. <knot-dns@labs.nic.cz>
* SPDX-License-Identifier: GPL-3.0-or-later
*/
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "tests/unit/test.h"
#include "lib/generic/map.h"
/*
* Sample dictionary
*/
static const char *dict[] = {
"catagmatic", "prevaricator", "statoscope", "workhand", "benzamide",
"alluvia", "fanciful", "bladish", "Tarsius", "unfast", "appropriative",
"seraphically", "monkeypod", "deflectometer", "tanglesome", "zodiacal",
"physiologically", "economizer", "forcepslike", "betrumpet",
"Danization", "broadthroat", "randir", "usherette", "nephropyosis",
"hematocyanin", "chrysohermidin", "uncave", "mirksome", "podophyllum",
"siphonognathous", "indoor", "featheriness", "forwardation",
"archruler", "soricoid", "Dailamite", "carmoisin", "controllability",
"unpragmatical", "childless", "transumpt", "productive",
"thyreotoxicosis", "oversorrow", "disshadow", "osse", "roar",
"pantomnesia", "talcer", "hydrorrhoea", "Satyridae", "undetesting",
"smoothbored", "widower", "sivathere", "pendle", "saltation",
"autopelagic", "campfight", "unexplained", "Macrorhamphosus",
"absconsa", "counterflory", "interdependent", "triact", "reconcentration",
"oversharpness", "sarcoenchondroma", "superstimulate", "assessory",
"pseudepiscopacy", "telescopically", "ventriloque", "politicaster",
"Caesalpiniaceae", "inopportunity", "Helion", "uncompatible",
"cephaloclasia", "oversearch", "Mahayanistic", "quarterspace",
"bacillogenic", "hamartite", "polytheistical", "unescapableness",
"Pterophorus", "cradlemaking", "Hippoboscidae", "overindustrialize",
"perishless", "cupidity", "semilichen", "gadge", "detrimental",
"misencourage", "toparchia", "lurchingly", "apocatastasis"
};
/* Insertions */
static void test_insert(void **state)
{
map_t *tree = *state;
int dict_size = sizeof(dict) / sizeof(const char *);
int i;
for (i = 0; i < dict_size; i++) {
assert_int_equal(map_set(tree, dict[i], (void *)dict[i]), 0);
}
}
/* Searching */
static void test_get(void **state)
{
map_t *tree = *state;
char *in;
const char *notin = "not in tree";
in = malloc(strlen(dict[23])+1);
strcpy(in, dict[23]);
assert_true(map_get(tree, in) == dict[23]);
assert_true(map_get(tree, notin) == NULL);
assert_true(map_get(tree, "") == NULL);
in[strlen(in)/2] = '\0';
assert_true(map_get(tree, in) == NULL);
free(in);
}
/* Deletion */
static void test_delete(void **state)
{
map_t *tree = *state;
assert_int_equal(map_del(tree, dict[91]), 0);
assert_false(map_contains(tree, dict[91]));
assert_int_equal(map_del(tree, "most likely not in tree"), 1);
}
/* Test null value existence */
static void test_null_value(void **state)
{
map_t *tree = *state;
char *key = "foo";
assert_int_equal(map_set(tree, key, (void *)0), 0);
assert_true(map_contains(tree, key));
assert_int_equal(map_del(tree, key), 0);
}
static void test_init(void **state)
{
static map_t tree;
tree = map_make(NULL);
*state = &tree;
assert_non_null(*state);
}
static void test_deinit(void **state)
{
map_t *tree = *state;
map_clear(tree);
}
/* Program entry point */
int main(int argc, char **argv)
{
const UnitTest tests[] = {
group_test_setup(test_init),
unit_test(test_insert),
unit_test(test_get),
unit_test(test_delete),
unit_test(test_null_value),
group_test_teardown(test_deinit)
};
return run_group_tests(tests);
}
|
