chiark / gitweb /
libtest now generates coverage report for lib/ not itself!
[disorder] / libtests / t-heap.c
CommitLineData
b90f122b
RK
1/*
2 * This file is part of DisOrder.
3 * Copyright (C) 2005, 2007, 2008 Richard Kettlewell
4 *
e7eb3a27 5 * This program is free software: you can redistribute it and/or modify
b90f122b 6 * it under the terms of the GNU General Public License as published by
e7eb3a27 7 * the Free Software Foundation, either version 3 of the License, or
b90f122b 8 * (at your option) any later version.
e7eb3a27
RK
9 *
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
14 *
b90f122b 15 * You should have received a copy of the GNU General Public License
e7eb3a27 16 * along with this program. If not, see <http://www.gnu.org/licenses/>.
b90f122b
RK
17 */
18#include "test.h"
19
20/** @brief Less-than comparison function for integer heap */
21static inline int int_lt(int a, int b) { return a < b; }
22
23/** @struct iheap
24 * @brief A heap with @c int elements */
25HEAP_TYPE(iheap, int, int_lt);
26HEAP_DEFINE(iheap, int, int_lt);
27
28/** @brief Tests for @ref heap.h */
c68d8eba 29static void test_heap(void) {
b90f122b
RK
30 struct iheap h[1];
31 int n;
32 int last = -1;
33
b90f122b
RK
34 iheap_init(h);
35 for(n = 0; n < 1000; ++n)
36 iheap_insert(h, random() % 100);
37 for(n = 0; n < 1000; ++n) {
38 const int latest = iheap_remove(h);
39 if(last > latest)
40 fprintf(stderr, "should have %d <= %d\n", last, latest);
41 insist(last <= latest);
42 last = latest;
43 }
b90f122b
RK
44}
45
c68d8eba
RK
46TEST(heap);
47
b90f122b
RK
48/*
49Local Variables:
50c-basic-offset:2
51comment-column:40
52fill-column:79
53indent-tabs-mode:nil
54End:
55*/