Hi Vadim I didn't know that works. It looks very interesting. About you question if it is possible to implement similar augmenting trees over the counter_tree ? I think yes. It is not very difficult. I suppose it can be done using inheritance of the nodes in the tree. With this, you can add additional information to the nodes, and with the functions you can do all the work of the counter_tree and additional work. I think it is a nice idea Sincerely yours Francisco Tapia El 13 de abril de 2012 12:16, Vadim Stadnik <vadimstdk@gmail.com> escribió:
On Thu, Apr 12, 2012 at 8:18 PM, Francisco José Tapia <fjtapia@gmail.com
wrote:
Hi
this message is to announce the new version of the [countertree + suballocator] library.
...
This library is an implementation of a binary red-black counter tree.
tree have an additional counter in each leaf. This permit the access to
This the
elements by the position, like in a vector. It is a random access container with random access iterators . ...
Hi all,
The trees developed in this project are from class of augmented data structures. Boost library does not have yet such data structures.
Some time ago I submitted for discussion of interest three variants of augmented B+ trees. Your project was mentioned in this discussion too. This is why I think the following links might be interesting for you:
start of thread, it includes links to documentation and code of augmented B+ trees: http://lists.boost.org/Archives/boost/2011/11/188472.php
analysis and comments by Joaquín M López Muñoz: http://lists.boost.org/Archives/boost/2011/12/188591.php
my reply: http://lists.boost.org/Archives/boost/2011/12/188746.php
One variant of B+ trees with double augmenting supports very efficient summation and calculation of statistical parameters of a data set with logarithmic cost in the worst case.
Is it possible to implement similar second augmenting in your RB-trees? This extension will increase the value of your data structures and containers.
Regards, Vadim Stadnik
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost