| 16 | protected: |
| 17 | template<typename T> |
| 18 | void check_order(IndexHeap<T>& heap, bool desc_order) { |
| 19 | ASSERT_FALSE(heap.empty()); |
| 20 | |
| 21 | T prev = heap.top_value(); |
| 22 | while(!heap.empty()) { |
| 23 | T curr = heap.top_value(); |
| 24 | if (desc_order) { |
| 25 | ASSERT_GE(prev, curr); |
| 26 | } else { |
| 27 | ASSERT_LE(prev, curr); |
| 28 | } |
| 29 | prev = curr; |
| 30 | heap.pop(); |
| 31 | } |
| 32 | } |
| 33 | |
| 34 | protected: |
| 35 | size_t N; |