|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Lazy and scalable dynamic array implementation. More...
#include <cmath>#include <string>#include <vector>#include <aleph.H>#include <ahIterator.H>#include <array_utils.H>#include <ahDry.H>#include <tpl_dynDlist.H>#include <ah-args-ctor.H>#include <htlist.H>#include <ah-dry.H>#include <ah-errors.H>Go to the source code of this file.
Classes | |
| class | Aleph::DynArray< T > |
| class | Aleph::DynArray< T >::Proxy |
| class | Aleph::DynArray< T >::Iterator |
| Iterator on the items of array. More... | |
Namespaces | |
| namespace | Aleph |
| Main namespace for Aleph-w library functions. | |
Lazy and scalable dynamic array implementation.
This file provides DynArray, a versatile dynamic array with lazy allocation. Memory is allocated on-demand using a three-level indexing scheme (directory, segments, blocks) that provides O(1) access time while minimizing memory waste for sparse arrays.
Definition in file tpl_dynArray.H.