| 1 |
/** |
| 2 |
* collectd - src/tests/test_utils_heap.c |
| 3 |
* Copyright (C) 2013 Florian octo Forster |
| 4 |
* |
| 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: |
| 11 |
* |
| 12 |
* The above copyright notice and this permission notice shall be included in |
| 13 |
* all copies or substantial portions of the Software. |
| 14 |
* |
| 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. |
| 22 |
* |
| 23 |
* Authors: |
| 24 |
* Florian octo Forster <octo at collectd.org> |
| 25 |
*/ |
| 26 |
|
| 27 |
#include "collectd.h" |
| 28 |
|
| 29 |
#include "testing.h" |
| 30 |
#include "utils/heap/heap.h" |
| 31 |
|
| 32 |
static int compare(void const *v0, void const *v1) { |
| 33 |
int const *i0 = v0; |
| 34 |
int const *i1 = v1; |
| 35 |
|
| 36 |
if ((*i0) < (*i1)) |
| 37 |
return -1; |
| 38 |
else if ((*i0) > (*i1)) |
| 39 |
return 1; |
| 40 |
else |
| 41 |
return 0; |
| 42 |
} |
| 43 |
|
| 44 |
DEF_TEST(simple) { |
| 45 |
int values[] = {9, 5, 6, 1, 3, 4, 0, 8, 2, 7}; |
| 46 |
c_heap_t *h; |
| 47 |
|
| 48 |
CHECK_NOT_NULL(h = c_heap_create(compare)); |
| 49 |
for (int i = 0; i < 10; i++) |
| 50 |
CHECK_ZERO(c_heap_insert(h, &values[i])); |
| 51 |
|
| 52 |
for (int i = 0; i < 5; i++) { |
| 53 |
int *ret = NULL; |
| 54 |
CHECK_NOT_NULL(ret = c_heap_get_root(h)); |
| 55 |
OK(*ret == i); |
| 56 |
} |
| 57 |
|
| 58 |
CHECK_ZERO(c_heap_insert(h, &values[6] /* = 0 */)); |
| 59 |
CHECK_ZERO(c_heap_insert(h, &values[3] /* = 1 */)); |
| 60 |
CHECK_ZERO(c_heap_insert(h, &values[8] /* = 2 */)); |
| 61 |
CHECK_ZERO(c_heap_insert(h, &values[4] /* = 3 */)); |
| 62 |
CHECK_ZERO(c_heap_insert(h, &values[5] /* = 4 */)); |
| 63 |
|
| 64 |
for (int i = 0; i < 10; i++) { |
| 65 |
int *ret = NULL; |
| 66 |
CHECK_NOT_NULL(ret = c_heap_get_root(h)); |
| 67 |
OK(*ret == i); |
| 68 |
} |
| 69 |
|
| 70 |
c_heap_destroy(h); |
| 71 |
return 0; |
| 72 |
} |
| 73 |
|
| 74 |
int main(void) { |
| 75 |
RUN_TEST(simple); |
| 76 |
|
| 77 |
END_TEST; |
| 78 |
} |