summaryrefslogtreecommitdiffstats
path: root/Modules/FindosgDB.cmake
diff options
context:
space:
mode:
authorAlex Turbov <i.zaufi@gmail.com>2021-07-27 19:47:06 (GMT)
committerBrad King <brad.king@kitware.com>2021-08-03 14:55:47 (GMT)
commit866b0595f6f3e26542148984e22f508fb1b3eb1e (patch)
treeb20322d97975991d4be792a0edfc1bf29b343b4d /Modules/FindosgDB.cmake
parent51d9194a96df4cb8cd144afce4edc6e2122fab2d (diff)
downloadCMake-866b0595f6f3e26542148984e22f508fb1b3eb1e.zip
CMake-866b0595f6f3e26542148984e22f508fb1b3eb1e.tar.gz
CMake-866b0595f6f3e26542148984e22f508fb1b3eb1e.tar.bz2
Refactor: Introduce `cmArgumentList` container class
The `cmArgumentList` has been turned into a class (forward declared in the header). It inherits from the `std::list` (yeah, but we don't intend to store polymorphic classes in it). In addition to the standard methods, now it's possible to move `HandlePredicate` (renamed to `ReduceOneArg`) and `HandleBinaryOp` (renamed to `ReduceTwoArgs`) as its members. Additionally, iterators managements (`IncrementArguments`) have been refactored into two separate classes mimicking iterators. This also allows having a uniform `for` loop and concentrates the logic of iterators advancing in it instead of the loop's body. The arguments processing algorithms operate with "windows" over a collection of arguments. Hence there are two kinds of "iteration windows" -- allowing to observe 2 or 3 elements per loop iteration. These iteration "windows" also passed to reducers.
Diffstat (limited to 'Modules/FindosgDB.cmake')
0 files changed, 0 insertions, 0 deletions