Be the first to post a text review of AVL Array. Rate and review a project by clicking thumbs up or thumbs down in the right column.

• avl-array-C++ avl-array-C++-1.2 file released: avl-array-C++-1.2.tar.gz

  * documentation * source reorganized for readability * compliance with higher standards * performance improvements (See README.TXT for details)

  posted 1085 days ago

• avl-array-C++ avl-array-C++-1.2 file released: avl-array-C++-1.2.zip

  * documentation * source reorganized for readability * compliance with higher standards * performance improvements (See README.TXT for details)

  posted 1085 days ago

• File released: /avl-array-C++/avl-array-C++-1.2/avl-array-C++-1.2.zip

  posted 1085 days ago

• File released: /avl-array-C++/avl-array-C++-1.2/avl-array-C++-1.2.tar.gz

  posted 1085 days ago

• avl-array-C++ avl-array-C++-1.1 file released: avl-array-C++-1.1.zip

  * 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 width-change (that's new) of an element automatically changes the position of others

  posted 1113 days ago

• File released: /avl-array-C++/avl-array-C++-1.1/avl-array-C++-1.1.zip

  posted 1113 days ago

• avl-array-C++ avl-array-C++-1.0 file released: stlavlarray.h

  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 for data in order * iterators remain valid until referenced element is erased (reverse iterators too) * O(n) copy constructor, operator= * additional specialized operations like insert_anywhere

  posted 1119 days ago

• avl-array-C++ avl-array-C++-1.0 file released: simpletest.cpp

  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 for data in order * iterators remain valid until referenced element is erased (reverse iterators too) * O(n) copy constructor, operator= * additional specialized operations like insert_anywhere

  posted 1119 days ago

• File released: /avl-array-C++/avl-array-C++-1.0/simpletest.cpp

  posted 1119 days ago

• File released: /avl-array-C++/avl-array-C++-1.0/stlavlarray.h

  posted 1119 days ago