Re: [boost] [Container] Priority Deque - Refinement

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

24.11.2013 13:22, tim:
>>> [...] 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 (
>> http://www.boost.org/doc/libs/1_55_0/doc/html/heap.html ).
>
> i'd welcome this as contribution to boost.heap, if you want to integrate
> it there. however it provides two features for its priority_queue
> implementation, which are currently missing in the priority deque:
>
> * mutability

Could you please clarify, does boost::heap::priority_queue support 
mutable interface?
(I know that other heaps support it, like fibonacci_heap)

-- 
Evgeny Panasyuk