Boost logo

Boost :

Subject: Re: [boost] [Container] Priority Deque - Refinement
From: Evgeny Panasyuk (evgeny.panasyuk_at_[hidden])
Date: 2013-11-23 22:24:21

23.11.2013 22:20, Nathaniel McClatchey:
> [...] I wish to make it part of Boost.Container [...]
> [...] * The underlying data structure is an interval heap [...]

I think it is worth to consider to make it part of Boost.Heap library ( ).

In particular there is boost::heap::priority_queue (
) which is wrapper around STL heap functions (make_heap, etc) but with
interface similar to other Boost.Heap containers.
If your implementation would have std::make_heap/etc functions (which
are desirable on their own, as Steven mentioned) then it is even
possible to have two interfaces: Boost.Heap-like and

Evgeny Panasyuk

Boost list run by bdawes at, gregod at, cpdaniel at, john at