AVL Array is an STL-like container for C++ that fills the gap between vector (or deque) and list, providing both fast random access and fast insertion/removal, all O(log n). This is not a map; in an avl_array, the "keys" always range from 0 to size-1, and they automatically change on insertion or removal. As a sequence container, like vector and list, it respects the order of elements.
|Tags||Software Development Text Editors|
|Operating Systems||OS Independent|
Release Notes: This release has HTML documentation, cleaner source code for readability and compliance with higher standards, performance improvements, and minor bugfixes.
Release Notes: This release has namespaces, allocators, improved portability, and no macros. A new experimental feature "Non-Proportional Sequence View" allows indexing with something different from natural numbers, but with the same working principle: insertion, deletion, or (newly added) width change of an element automatically changes the position of others.
No changes have been submitted for this release.