The algorithm coded thus far turns out to be rather generic, and thus it can be rewritten into a template, while all specific parts are supplied as λ-Functors. - instead of Time we use a generic ordering type - the Iterator is likewise turned into a template parameter - all the operations are directly supplied as functor types - C++17 is able to pick up all those λ-Types from the ctor call This change looks like "low hanging fruit"; the legibility of the code is not seriously hampered, yet we get the benefit to test this rather technical piece of logic by an isolated test (which for now is the primary motivation), and we can hope to re-use it for similar tasks. |
||
|---|---|---|
| .. | ||
| draw | ||
| DIR_INFO | ||
| empty.html | ||
| InterfaceConcept_Varga.mm | ||
| renderengine.html | ||
| thinkPad.ichthyo.mm | ||
| uml | ||
| workflow.mm | ||