DUNE-FEM (unstable)
arraylist.hh File Reference
Implements a random-access container that can efficiently change size (similar to std::deque) More...
#include <array>
#include <cassert>
#include <memory>
#include <vector>
#include "iteratorfacades.hh"
Go to the source code of this file.
Classes | |
class | Dune::ArrayList< T, N, A > |
A dynamically growing random access list. More... | |
class | Dune::ArrayListIterator< T, N, A > |
A random access iterator for the Dune::ArrayList class. More... | |
class | Dune::ConstArrayListIterator< T, N, A > |
A constant random access iterator for the Dune::ArrayList class. More... | |
Namespaces | |
namespace | Dune |
Dune namespace. | |
Detailed Description
Implements a random-access container that can efficiently change size (similar to std::deque)
This file implements the class ArrayList which behaves like dynamically growing array together with the class ArrayListIterator which is random access iterator as needed by the stl for sorting and other algorithms.
|
Legal Statements / Impressum |
Hosted by TU Dresden |
generated with Hugo v0.111.3
(Nov 12, 23:30, 2024)