From be70e58441a143723c576cc953c5b0390a86bef7 Mon Sep 17 00:00:00 2001 From: Ichthyostega Date: Mon, 31 Aug 2015 03:34:23 +0200 Subject: [PATCH] considering how to implement the GenNode sequence iteration remembered that some years ago I had to deal with a very similar problem for planning the frame rendering jobs. It turned out, that the iterator monad developed for this looks promising for our task at hand --- src/lib/iter-explorer.hpp | 4 +- tests/library/diff/gen-node-basic-test.cpp | 2 +- tests/library/iter-explorer-test.cpp | 8 +- wiki/thinkPad.ichthyo.mm | 169 +++++++++++++++++++-- 4 files changed, 164 insertions(+), 19 deletions(-) diff --git a/src/lib/iter-explorer.hpp b/src/lib/iter-explorer.hpp index 28e9f8241..d2c05c8b4 100644 --- a/src/lib/iter-explorer.hpp +++ b/src/lib/iter-explorer.hpp @@ -613,7 +613,7 @@ namespace lib { /** * Strategy building block for recursive exhausting evaluation. - * Allows to create depth-fist or breadth-first evaluation patters, just + * Allows to create depth-fist or breadth-first evaluation patterns, just * by using a suitably intermediary storage container to hold the partially * evaluated iterators created at each evaluation step. Using a stack and * pushing results will create a depth-first pattern, while using a queue @@ -788,7 +788,7 @@ namespace lib { private: - /** assure the next elements to be processed + /** ensure the next elements to be processed * will appear at outSeq_ head. When outSeq_ * is still empty after this function, * we're done. diff --git a/tests/library/diff/gen-node-basic-test.cpp b/tests/library/diff/gen-node-basic-test.cpp index 12ef4b611..c4b07f882 100644 --- a/tests/library/diff/gen-node-basic-test.cpp +++ b/tests/library/diff/gen-node-basic-test.cpp @@ -278,7 +278,7 @@ namespace test{ .genNode("baked beans"); // build Node from named Record - cout << "--lovely-spam--"<