[proposal] Rank List (old name: AVL Array) in the Sandbox Vault
- Hi again, I have uploaded Rank List (presented here as "AVL Array" in the message "[proposal] Sequence container with O(log n) random access _and_ O(log n) insertion/removal (wherever)") to the Sandbox Vault. I've made a lot of changes, but the main one is the documentation: http://boost.cvs.sourceforge.net/*checkout*/boost-sandbox/boost-sandbox/libs... You will notice that I've kept all the features of the first proposal. I still believe that they are useful and they sould be maintained (the rationale explains why). As I said, I will remove them if this is the general desire in Boost. Please, could you first take a look to the docs (overview, rationale and/or FAQ) and then answer the next questions? A) Would you add Rank List to Boost? B) Do you suggest removing anything? I'd like to discuss the problem of tagging iterators as random access or just bidirectional. Thanks in advance, Martin
Martin Knoblauch Revuelta wrote:
- Hi again,
I have uploaded Rank List (presented here as "AVL Array" in the message "[proposal] Sequence container with O(log n) random access _and_ O(log n) insertion/removal (wherever)") to the Sandbox Vault.
I've made a lot of changes, but the main one is the documentation:
http://boost.cvs.sourceforge.net/*checkout*/boost-sandbox/boost-sandbox/libs...
You will notice that I've kept all the features of the first proposal. I still believe that they are useful and they sould be maintained (the rationale explains why). As I said, I will remove them if this is the general desire in Boost.
Please, could you first take a look to the docs (overview, rationale and/or FAQ) and then answer the next questions?
A) Would you add Rank List to Boost?
Looks nice to me -- seems like it would be useful.
B) Do you suggest removing anything?
Can't see anything obvious. How about C) add anything? 1) Should there be specializations of standard algorithms that use the internal functions? 2) Docs really need a tutorial section that shows how to use the container. I realize it's pretty much like using a vector, but still it's much easier to see that in a 10 line code snippet than reading thru long and boring docs. Jeff
On 12/1/06, Jeff Garland <jeff@crystalclearsoftware.com> wrote:
Martin Knoblauch Revuelta wrote:
[..] A) Would you add Rank List to Boost?
Looks nice to me -- seems like it would be useful.
Great :)
How about
C) add anything?
1) Should there be specializations of standard algorithms that use the internal functions?
Here comes the iterators tag issue: I have to take a look to some implementations for list and vector. Depending on their implementation we should: a) stick to the implementations for list b) implement specializations for rank_list (this might require a new iterators tag, I guess) c) tag iterators as random access and use the algorithms of vector (bad idea, see rationale)
2) Docs really need a tutorial section that shows how to use the container. I realize it's pretty much like using a vector, but still it's much easier to see that in a 10 line code snippet than reading thru long and boring docs.
That's a great idea. I knew I had to write more examples, but I think that they will be much more useful if I explain them in the docs in tutorial form. Thanks a lot. Regards, Martin
participants (2)
-
Jeff Garland -
Martin Knoblauch Revuelta