|
About:
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.
Author:
Martin Knoblauch Revuelta [contact developer]
Homepage:
http://avl-array.sourceforge.net/
Trove categories:
[change]
Dependencies:
[change]
No dependencies filed
|
|
» Rating:
(not rated)
» Vitality: 0.00% (Rank 18171)
» Popularity: 0.21% (Rank 23206)
 
(click to enlarge graphs)
Record hits: 2,075
URL hits: 369
Subscribers: 6
|
|
