Re: [Boost-users] Priority deque?

On Thu, Sep 1, 2016 at 3:34 PM, Paolo Bolzoni

wrote:

Oh, dear. I made a stupid mistake. I meant a "priority deque", a data structure where you can easily access the maximum and minimum element. In priority queue you can top and pop the maximum element, I would need both to pop and top the maximum and the minimum.

Would BMI's ranked indices work for you? --DD http://www.boost.org/doc/libs/1_61_0/libs/multi_index/doc/tutorial/indices.h...