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.
What's New in This Release:
· source reorganized for readability
· compliance with higher standards
· performance improvements