1 // -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
2 // vim: ts=8 sw=2 smarttab
5 * Copyright (C) 2016 Red Hat Inc.
12 #include "intrusive_heap.h"
24 crimson::IntruHeapData heap_data;
27 Test1(int _data) : data(_data) {}
29 friend std::ostream& operator<<(std::ostream& out, const Test1& d) {
30 out << d.data << " (" << d.heap_data << ")";
34 int& the_data() { return data; }
39 bool operator()(const Test1& d1, const Test1& d2) {
40 return d1.data < d2.data;
45 struct TestIntruData {
46 crimson::IntruHeapData& operator()(Test1& d) {
52 int main(int argc, char** argv) {
58 crimson::IntruHeap<Test1, TestIntruData, TestCompare> my_heap;
64 my_heap.push(Test1(-9));
65 my_heap.push(Test1(99));
66 my_heap.push(Test1(0));
68 std::cout << my_heap << std::endl;
70 auto& t = my_heap.top();
72 my_heap.adjust_down(t);
74 std::cout << my_heap << std::endl;
76 my_heap.display_sorted(std::cout);
78 while (!my_heap.empty()) {
79 auto& top = my_heap.top();
80 std::cout << top << std::endl;
82 std::cout << my_heap << std::endl;