On the Computational Efficiency of Data Types for Sequences in Storage and Processing Irregular Grids
Abstract:
The main properties of data structures for sequences, such as arrays, stacks, queues, and linked lists, are outlined. New types for collections in C++ have been developed using a curious recursive template to avoid code duplication between classes. A performance comparison has been conducted among the data structures from the C++ standard library, the MARPLE code, and proprietary developments.
