by comocomocomo
Do you need a container for (A) random access? Then you need a vector, but don't abuse insert/erase; (B) insert/erase (wherever you want)? Then you need a list, but don't even try random access; (C) both? Choose avl_array! O(log n) for both!
* documentation * source reorganized for readability * compliance with higher standards * performance improvements (See README.TXT for details)
* documentation * source reorganized for readability * compliance with higher standards * performance improvements (See README.TXT for details)
* improved portability * no macros * namespaces * allocators * new experimental feature "Non-Proportional Sequence View" allows indexing with something different from natural numbers, but with the same working principle: insertion, deletion, or ...
Initial version for C++ with: * random access of O(log n) complexity * insert/erase (wherever you want) of O(log n) complexity * O(1) for ++ and -- on iterators, begin() and end() * swap, reverse, sort and stable sort * merge, unique and binary search ...
Initial version for C++ with: * random access of O(log n) complexity * insert/erase (wherever you want) of O(log n) complexity * O(1) for ++ and -- on iterators, begin() and end() * swap, reverse, sort and stable sort * merge, unique and binary search ...
Anonymous committed patchset 1 of module CVSROOT to the AVL Array CVS repository, changing 11 files
comocomocomo registered the AVL Array project
Anonymous created the Welcome to Developers forum thread
Anonymous created the Welcome to Help forum thread
Anonymous created the Welcome to Open Discussion forum thread
Copyright © 2009 SourceForge, Inc. All rights reserved. Terms of Use
