A dynamic list is a 1-D vector of objects of type T which resizes itself as necessary to accept the new objects. Internal storage is a 2-D graph with a fixed size of the chunks used to store the data. This way the data does not get copied every time array is resized, but only the pointers to the chunks of data. More...

Detailed Description

A dynamic list is a 1-D vector of objects of type T which resizes itself as necessary to accept the new objects. Internal storage is a 2-D graph with a fixed size of the chunks used to store the data. This way the data does not get copied every time array is resized, but only the pointers to the chunks of data.

Source files

The documentation for this class was generated from the following file:

applications/extra/cfMesh-v1.1.2/meshLibrary/utilities/containers/LongList/LongList.H