31 #include <mln/util/fibonacci_heap.hh>
32 #include <mln/core/alias/point2d.hh>
56 for (
unsigned i = 0; i < 5; ++i)
61 for (
unsigned i = 5; i < 10; ++i)
79 mln_assertion(heap2.is_empty());
80 mln_assertion(heap2.nelements() == 0);
101 mln_assertion(heap.is_empty());
102 mln_assertion(heap.nelements() == 0);
105 mln_assertion(heap2.front() == res_1[0]);
109 for (
unsigned i = 0; i < 3; ++i)
110 mln_assertion(heap2.pop_front() == res_1[i]);
120 while (heap2.is_valid())
122 mln_assertion(heap2.pop_front() == res_2[i++]);
123 mln_assertion(heap2.nelements() == (10 - i));
127 mln_assertion(heap2.is_empty());
128 mln_assertion(heap2.nelements() == 0);
139 mln_assertion(heap2.nelements() == 1);
140 mln_assertion(heap.nelements() == 1);
141 mln_assertion(tmp.nelements() == 0);
147 mln_assertion(tmp2.nelements() == 1);
148 mln_assertion(heap.nelements() == 0);