Subject: Re: [boost] Countertree
From: Francisco José Tapia (fjtapia_at_[hidden])
Date: 2012-11-17 12:44:47
About the compatibility with the boost Statistical Accumulators Library, I
didn't thought about it, but it would be useful. I will try to implement,
but I need to examine in deep for to provide you a well founded opinion.
About the Policy-Based Data Structures of GCC, I didn't know, but I had
learned many things reading the code and the documentation of GCC, and I
hope to learn more with them. I say you the same, I will examine in order
to provide you a founded opinion.
About the question of sample code.
If you see the online documentation. (
https://dl.dropbox.com/u/8437476/works/countertree/index.html). The last
point is the Download. It's a zip file. If you examine this file, you have
a example folder with examples of all the data structures, and a benchmark
folder with the benchmarks used for the documentation.
Don't worry, it's easy. For to use this library only need to know the basic
of the STL. You will understand all at first look. It is easy to learn and
use. And if you have any question, please ask me
Thanks by your interest and your suggestions.
2012/11/16 Vadim Stadnik <vadimstdk_at_[hidden]>
> On Sat, Nov 17, 2012 at 4:25 AM, Leo Goodstadt <leo.goodstadt_at_[hidden]
> > > Subject: Re: [boost] Review Wizard Report for November 2012
> > > Hi all,
> > > I would like to request a formal review of the library ?Countertree +
> > > Suballocator? [countertree]
> > >
> > > Project location ( zip file with code and documentation) :
> > > https://dl.dropbox.com/u/8437476/works/countertree_code_doc.zip
> > >
> > > Quick view of documentation with code download :
> > > https://dl.dropbox.com/u/8437476/works/countertree/index.html
> > >
> > > For the people who don't know this project, this is a description :
> > >
> > > *COUNTERTREE*
> > >
> > > This library is an implementation of a binary red-black counter tree.
> > This
> > > tree have an additional counter in each leaf. This permit the access to
> > the
> > > elements by the position, like in a vector. It is a random access
> > container
> > > with random access iterators
> > Among other things, countertree would allow the boost Statistical
> > Accumulators Library to support rolling median and rolling quantiles
> > efficiently. This would be very useful.
> > I had previously had to hack the tree class in the Policy-Based Data
> > Structures part of the gnu c++ library.
> > (see
> > )
> As far as I know, this support is not yet available in countertree project,
> although this is possible in principle.
> Do you have a document with descriptions of your work and/or sample code?
> Vadim Stadnik
> Unsubscribe & other changes:
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk