Boost logo

Boost :

Subject: Re: [boost] new proposal: order statistics tree
From: Szymon Wojciechowski (sw10_at_[hidden])
Date: 2013-01-04 16:37:30


If one has order_statistics_tree<string, less<string> > with string values and less comparator, and the container has been inserted: cat, dog, bird, fish, dinosaur then the elements can by accessed by ranks of the keys in that container. In example
tree[0] returns bird while bird is the least element, tree[1] = cat, tree[2] = dinosaur, tree[3] = dog, tree[4] = fish, which is the greatest.

Best regards,
Szymon Wojciechowski

"Klaim - Joël Lamotte" <mjklaim_at_[hidden]> pisze:
> Hi,
> On Wed, Jan 2, 2013 at 10:46 PM, Szymon Wojciechowski wrote:
> > Briefly, it is container which allows logarithmic inserting, searching and
> > erasing as in set, but additionally it permits to access elements via
> > numerical value - key order.
> Can you clarify what you call key order? Maybe some examples?
> Joel Lamotte
> _______________________________________________
> Unsubscribe & other changes:

Boost list run by bdawes at, gregod at, cpdaniel at, john at