Re: [boost] New library ( countertree: Binary trees with access by position like the vectors)

Subject: Re: [boost] New library ( countertree: Binary trees with access by position like the vectors)
From: Rene Rivera (grafikrobot_at_[hidden])
Date: 2010-09-28 08:26:19

On 9/27/2010 4:09 PM, Francisco José Tapia wrote:
> Is there any interest in a library implementing counter trees, which permit
> us to access to the elements by the position, as in the same way than a
> vector.The insertion, deletion and access to elements are operations O(log
> N).

You might want to search this list for "ranktree" as there was 
discussions related to that a few years ago. There's also work in 
progress on a comprehensive tree library in the sandbox 
<https://svn.boost.org/svn/boost/sandbox/SOC/2006/tree/>.

-- 
-- Grafik - Don't Assume Anything
-- Redshift Software, Inc. - http://redshift-software.com
-- rrivera/acm.org (msn) - grafik/redshift-software.com
-- 102708583/icq - grafikrobot/aim,yahoo,skype,efnet,gmail