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--"<