Class PriorityQueue

src/fl/stl/priority_queue.h:74–147

template <typename T, typename Compare = fl::less<T>,
          typename VectorT = vector<T>>
class PriorityQueue {
  public:
    using value_type = T;
    using size_type = fl::size;
    using compare_type = Compare;

    PriorityQueue() FL_NOEXCEPT = default;
    explicit PriorityQueue(memory_resource* resource) : _data(resource) {}
    explicit PriorityQueue(const Compare &comp) : _comp(comp) {}
    PriorityQueue(const Compare &comp, memory_resource* resource) : _data(resource), _comp(comp) {}

    void push(const T &value) {
        _data.push_back(value);
        push_heap(_data.begin(), _data.end(), _comp);
    }

    void push(T &&value) {
        _data.push_back(fl::move(value));
        push_heap(_data.begin(), _data.end(), _comp);
    }

    template<typename... Args>
    void emplace(Args&&... args) {
        _data.emplace_back(fl::forward<Args>(args)...);
        push_heap(_data.begin(), _data.end(), _comp);
    }

    void pop() {
        pop_heap(_data.begin(), _data.end(), _comp);
        _data.pop_back();
    }

    const T &top() const { return _data.front(); }

    bool empty() const { return _data.size() == 0; }
    fl::size size() const { return _data.size(); }

    const Compare &compare() const { return _comp; }
    memory_resource* get_memory_resource() const { return _data.get_resource(); }

    /// Equality comparison
    bool operator==(const PriorityQueue& other) const {
        return _data == other._data;
    }

    /// Inequality comparison
    bool operator!=(const PriorityQueue& other) const {
        return _data != other._data;
    }

    /// Lexicographic comparison
    bool operator<(const PriorityQueue& other) const {
        return _data < other._data;
    }

    /// Less-than-or-equal comparison
    bool operator<=(const PriorityQueue& other) const {
        return _data <= other._data;