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!
Release Date:
Topic:
Operating System:
License:
Intended Audience:
Programming Language:
Registered:
Ratings and Reviews
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.
Project Feed
-
File released: /avl-array-C++/avl-array-C++-1.2.1/avl-array-C++-1.2.1.zip
-
File released: /avl-array-C++-1.2.1.tar.gz
-
File released: /avl-array-C++/avl-array-C++-1.2.1/avl-array-C++-1.2.1.tar.gz
-
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)
-
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)
-
File released: /avl-array-C++/avl-array-C++-1.2/avl-array-C++-1.2.zip
-
File released: /avl-array-C++/avl-array-C++-1.2/avl-array-C++-1.2.tar.gz
-
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
-
File released: /avl-array-C++/avl-array-C++-1.1/avl-array-C++-1.1.zip
-
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
Rate and Review
Be the first person to add a text review.
Related Projects
AVL Array Actions
About SourceForge
Develop Software
Copyright © 2009 Geeknet, Inc. All rights reserved. Terms of Use
