| 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 3 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, |
| 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 | * |
| 15 | * You should have received a copy of the GNU General Public License |
| 16 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
| 17 | */ |
| 18 | #include "test.h" |
| 19 | |
| 20 | /** @brief Less-than comparison function for integer heap */ |
| 21 | static inline int int_lt(int a, int b) { return a < b; } |
| 22 | |
| 23 | /** @struct iheap |
| 24 | * @brief A heap with @c int elements */ |
| 25 | HEAP_TYPE(iheap, int, int_lt); |
| 26 | HEAP_DEFINE(iheap, int, int_lt); |
| 27 | |
| 28 | /** @brief Tests for @ref heap.h */ |
| 29 | static void test_heap(void) { |
| 30 | struct iheap h[1]; |
| 31 | int n; |
| 32 | int last = -1; |
| 33 | |
| 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 | } |
| 44 | } |
| 45 | |
| 46 | TEST(heap); |
| 47 | |
| 48 | /* |
| 49 | Local Variables: |
| 50 | c-basic-offset:2 |
| 51 | comment-column:40 |
| 52 | fill-column:79 |
| 53 | indent-tabs-mode:nil |
| 54 | End: |
| 55 | */ |