data_structure/interval_heap.hpp

• View this file on GitHub
• Last update: 2025-04-05 12:46:42+09:00
• Include: #include "data_structure/interval_heap.hpp"

Code

#ifndef KK2_DATA_STRUCTURE_INTERVAL_HEAP_HPP
#define KK2_DATA_STRUCTURE_INTERVAL_HEAP_HPP 1

#include <algorithm>
#include <cassert>
#include <functional>
#include <vector>

namespace kk2 {

template <class T, class Compare = std::less<T>> struct IntervalHeap {
    std::vector<T> v;

    IntervalHeap() = default;
    IntervalHeap(const std::vector<T> &a) : v(a) { make_heap(); }

    void make_heap() {}

  private:
    static bool op(T x, T y) { return Compare{}(x, y); }
};

} // namespace kk2

#endif // KK2_DATA_STRUCTURE_INTERVAL_HEAP_HPP

#line 1 "data_structure/interval_heap.hpp"



#include <algorithm>
#include <cassert>
#include <functional>
#include <vector>

namespace kk2 {

template <class T, class Compare = std::less<T>> struct IntervalHeap {
    std::vector<T> v;

    IntervalHeap() = default;
    IntervalHeap(const std::vector<T> &a) : v(a) { make_heap(); }

    void make_heap() {}

  private:
    static bool op(T x, T y) { return Compare{}(x, y); }
};

} // namespace kk2

Back to top page