c++ - Boost: Priority Queue which supports finding an element in O(log n) time -

c++ - Boost: Priority Queue which supports finding an element in O(log n) time -

i curious whether boost offers priority queue implementation supports finding element in time o(log n)?

i accomplish functionality using boost fibonacci heap, , store handles in std::map index , update info upon heap insert, hoping heap version offers functionality.

note: deleted previous version of question because ambiguous.

if don't mind having (considerable?) overhead in space , insertion time, can utilize multi-index container here.

for idea, here's illustration employs boost multi-index priority-queue implementing active object pattern on top of boost asio:

boost::asio , active object

it should noted multi-index let's specify number of secondary/auxiliary indices on same container

c++ boost