[Boost-users] Priority deque?

Subject: [Boost-users] Priority deque?
From: Paolo Bolzoni (paolo.bolzoni.brown_at_[hidden])
Date: 2016-09-01 04:55:38

Dear list,

I was wondering if there some kind of "priority queue", that is a data
structure akin the priority queue, but where you can top and pop from
both sides.
My use case is that I need to quickly access the maximum, but also not
push new elements if they are smaller than the minimum.

I am aware I can use a std::set, but in the current implementation
where I always push new elements even if they are bad, using a
std::set the performance is significantly worse.

Yours faithfully,
Paolo