

Go to the source code of this file.
Classes | |
| class | DLPermutation< LabelList > |
| A permutation stored in the same manner as a doubly-linked list in order to facilitate reordering in constant time. More... | |
| class | DLPermutation< LabelList >::const_iterator |
| A bi-directional constant iterator. More... | |
Namespaces | |
| Foam | |
| Namespace for OpenFOAM. | |
Macros | |
| #define | forAllConstIterReverse(Container, container, iter) |
Typedefs | |
| typedef DLPermutation< List< label > > | dLPermutation |
| Define the type of a permutation based on a list. More... | |
| typedef DLPermutation< DynamicList< label > > | dynamicDLPermutation |
| Define the type of a permutation based on a dynamic list. More... | |
Original source file DLPermutation.H
Definition in file DLPermutation.H.
| #define forAllConstIterReverse | ( | Container, | |
| container, | |||
| iter | |||
| ) |
Definition at line 200 of file DLPermutation.H.