Boost logo

Boost Users :

Subject: [Boost-users] Container using an item's ordinal position in a sorted list
From: Hans Joseph Solbrig (joesolbrig_at_[hidden])
Date: 2009-12-21 18:37:52


First, could you confirm my belief that there is no STL or Boost container that can sort a list of values such that one can insert arbitrary values in O(log n) and also find the nth highest value in O(log n) time (see for some discussion)?

Second, I'm implementing such a container on top of a simple b-tree template. Would there be any interest in my cleaning it up and contributing it to boost?

(I'd mostly have to add smart pointers for copy-on-write compatibility).


Boost-users list run by williamkempf at, kalb at, bjorn.karlsson at, gregod at, wekempf at