ENH: replace reverse iterators for UList
- use std::reverse_iterator adaptors, avoid the array-bounds warning - use pointer arithmetic instead of dereferencing the internal array - adjust logic to use 'operator<' instead of 'operator>' in sorting. This creates less work when making other classes sortable.
Showing
- src/OpenFOAM/containers/Lists/DynamicList/DynamicListI.H 1 addition, 5 deletionssrc/OpenFOAM/containers/Lists/DynamicList/DynamicListI.H
- src/OpenFOAM/containers/Lists/UList/UList.C 36 additions, 34 deletionssrc/OpenFOAM/containers/Lists/UList/UList.C
- src/OpenFOAM/containers/Lists/UList/UList.H 48 additions, 124 deletionssrc/OpenFOAM/containers/Lists/UList/UList.H
- src/OpenFOAM/containers/Lists/UList/UListI.H 14 additions, 16 deletionssrc/OpenFOAM/containers/Lists/UList/UListI.H
- src/OpenFOAM/dimensionedTypes/dimensionedType/dimensionedType.C 4 additions, 4 deletions...enFOAM/dimensionedTypes/dimensionedType/dimensionedType.C
- src/OpenFOAM/dimensionedTypes/dimensionedType/dimensionedType.H 2 additions, 2 deletions...enFOAM/dimensionedTypes/dimensionedType/dimensionedType.H
Please register or sign in to comment