Data Structures and Memory Management

Abstract

In the context of adaptive schemes the design of data structures and an appropriate memory management have a significant influence on the performance of the computation. In the following we will discuss the design of data structures where we deduce some fundamental design criteria from algorithmic requirements, see Sect. 6.1. Here the concept of hashing turns out to be an efficient tool which fulfills these criteria. The basic ideas of hash tables, hash functions and collision strategies are summarized in Sect. 6.2, although they can be found in standard text books, see e.g. [Str97, OW96]. Nevertheless we believe it to be convenient for the reader to repeat some details, since we add some special features to the standard setting which are needed for the application at hand. Finally, in Sect. 6.3 we present the data types by which we realize the adaptive code. These are derived from the template library igpm_t_lib developed at the Institut für Geometrie und Praktische Mathematik, RWTH Aachen, see [MV00].