Re: [Boost-users] Priority deque?

Subject: Re: [Boost-users] Priority deque?
From: Paolo Bolzoni (paolo.bolzoni.brown_at_[hidden])
Date: 2016-09-01 10:24:06

It seems this is exactly what I am looking for:

https://github.com/nmcclatchey/Priority-Deque

It even mention it's a "Boost candidate."

Still, those ranked indeces may also work. Thanks for the link.

On Thu, Sep 1, 2016 at 4:17 PM, Dominique Devienne <ddevienne_at_[hidden]> wrote:
> On Thu, Sep 1, 2016 at 3:34 PM, Paolo Bolzoni
> <paolo.bolzoni.brown_at_[hidden]> 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.html#rnk_indices
>
> _______________________________________________
> Boost-users mailing list
> Boost-users_at_[hidden]
> http://lists.boost.org/mailman/listinfo.cgi/boost-users