28 #include "hb-priority-queue.hh"
33   hb_priority_queue_t queue;  in test_insert()  local
34   assert (queue.is_empty ());  in test_insert()
36   queue.insert (10, 0);  in test_insert()
37   assert (!queue.is_empty ());  in test_insert()
38   assert (queue.minimum () == hb_pair (10, 0));  in test_insert()
40   queue.insert (20, 1);  in test_insert()
41   assert (queue.minimum () == hb_pair (10, 0));  in test_insert()
43   queue.insert (5, 2);  in test_insert()
44   assert (queue.minimum () == hb_pair (5, 2));  in test_insert()
46   queue.insert (15, 3);  in test_insert()
47   assert (queue.minimum () == hb_pair (5, 2));  in test_insert()
49   queue.insert (1, 4);  in test_insert()
50   assert (queue.minimum () == hb_pair (1, 4));  in test_insert()
56   hb_priority_queue_t queue;  in test_extract()  local
57   queue.insert (0, 0);  in test_extract()
58   queue.insert (60, 6);  in test_extract()
59   queue.insert (30, 3);  in test_extract()
60   queue.insert (40 ,4);  in test_extract()
61   queue.insert (20, 2);  in test_extract()
62   queue.insert (50, 5);  in test_extract()
63   queue.insert (70, 7);  in test_extract()
64   queue.insert (10, 1);  in test_extract()
68     assert (!queue.is_empty ());  in test_extract()
69     assert (queue.minimum () == hb_pair (i * 10, i));  in test_extract()
70     assert (queue.pop_minimum () == hb_pair (i * 10, i));  in test_extract()
73   assert (queue.is_empty ());  in test_extract()
79   hb_priority_queue_t queue;  in test_extract_empty()  local
80   assert (queue.pop_minimum () == hb_pair (0, 0));  in test_extract_empty()