Subject: [boost] Interest in double-ended priority queue? (priority_deque)
From: Nathaniel McClatchey (njmcclatchey1990_at_[hidden])
Date: 2012-05-28 22:14:58
Details: Template-based container adapter. Mimics std::priority_queue
interface and requirements. O(1) read and O(log n) delete of either
end of queue. O(n) create and merge. Functions for unordered access
and mutating of elements.
Remaining development: Further optimization.
Note: Implementation is similar to but independent from
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk