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