Subject: Re: [boost] new proposal: order statistics tree
From: Klaim - JoÃ«l Lamotte (mjklaim_at_[hidden])
Date: 2013-01-03 10:21:18
On Wed, Jan 2, 2013 at 10:46 PM, Szymon Wojciechowski <sw10_at_[hidden]>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?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk