2 * collectd - src/tests/test_utils_avltree.c
3 * Copyright (C) 2013 Florian octo Forster
5 * Permission is hereby granted, free of charge, to any person obtaining a
6 * copy of this software and associated documentation files (the "Software"),
7 * to deal in the Software without restriction, including without limitation
8 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
9 * and/or sell copies of the Software, and to permit persons to whom the
10 * Software is furnished to do so, subject to the following conditions:
12 * The above copyright notice and this permission notice shall be included in
13 * all copies or substantial portions of the Software.
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
20 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
21 * DEALINGS IN THE SOFTWARE.
24 * Florian octo Forster <octo at collectd.org>
29 #include "utils_avltree.h"
30 #include "common.h" /* STATIC_ARRAY_SIZE */
32 static int compare_total_count = 0;
33 #define RESET_COUNTS() do { compare_total_count = 0; } while (0)
35 static int compare_callback (void const *v0, void const *v1)
40 compare_total_count++;
41 return (strcmp (v0, v1));
50 {"Eeph7chu", "vai1reiV"},
51 {"igh3Paiz", "teegh1Ee"},
52 {"caip6Uu8", "ooteQu8n"},
53 {"Aech6vah", "AijeeT0l"},
54 {"Xah0et2L", "gah8Taep"},
55 {"BocaeB8n", "oGaig8io"},
56 {"thai8AhM", "ohjeFo3f"},
57 {"ohth6ieC", "hoo8ieWo"},
58 {"aej7Woow", "phahuC2s"},
59 {"Hai8ier2", "Yie6eimi"},
60 {"phuXi3Li", "JaiF7ieb"},
61 {"Shaig5ef", "aihi5Zai"},
62 {"voh6Aith", "Oozaeto0"},
63 {"zaiP5kie", "seep5veM"},
64 {"pae7ba7D", "chie8Ojo"},
65 {"Gou2ril3", "ouVoo0ha"},
66 {"lo3Thee3", "ahDu4Zuj"},
67 {"Rah8kohv", "ieShoc7E"},
68 {"ieN5engi", "Aevou1ah"},
69 {"ooTe4OhP", "aingai5Y"},
76 CHECK_NOT_NULL (t = c_avl_create (compare_callback));
79 for (i = 0; i < STATIC_ARRAY_SIZE (cases); i++)
84 CHECK_NOT_NULL (key = strdup (cases[i].key));
85 CHECK_NOT_NULL (value = strdup (cases[i].value));
87 CHECK_ZERO (c_avl_insert (t, key, value));
88 EXPECT_EQ_INT ((int) (i + 1), c_avl_size (t));
91 /* Key already exists. */
92 for (i = 0; i < STATIC_ARRAY_SIZE (cases); i++)
93 EXPECT_EQ_INT (1, c_avl_insert (t, cases[i].key, cases[i].value));
96 for (i = 0; i < STATIC_ARRAY_SIZE (cases); i++)
98 char *value_ret = NULL;
100 CHECK_ZERO (c_avl_get (t, cases[i].key, (void *) &value_ret));
101 EXPECT_EQ_STR (cases[i].value, value_ret);
105 for (i = 0; i < STATIC_ARRAY_SIZE (cases) / 2; i++)
110 int expected_size = (int) (STATIC_ARRAY_SIZE (cases) - (i + 1));
112 CHECK_ZERO (c_avl_remove (t, cases[i].key, (void *) &key, (void *) &value));
114 EXPECT_EQ_STR (cases[i].key, key);
115 EXPECT_EQ_STR (cases[i].value, value);
120 EXPECT_EQ_INT (expected_size, c_avl_size (t));
123 /* pick the other half */
124 for (i = STATIC_ARRAY_SIZE (cases) / 2; i < STATIC_ARRAY_SIZE (cases); i++)
129 int expected_size = (int) (STATIC_ARRAY_SIZE (cases) - (i + 1));
131 EXPECT_EQ_INT (expected_size + 1, c_avl_size (t));
132 EXPECT_EQ_INT (0, c_avl_pick (t, (void *) &key, (void *) &value));
137 EXPECT_EQ_INT (expected_size, c_avl_size (t));
152 /* vim: set sw=2 sts=2 et : */