Testing containers for depth-first tree traversal

stack-test-snippet.cpp

template <typename Container> void tester(int iterations) {
  srandom(1337); // Seed PRNG to a known value for reproducibility.
  Container nodesToProcess(1); // Start with the first node to process.
  for (auto i = 0; i < iterations; ++i) {
    // Nodes are provided. Isolate and commonize generation.
    auto rand = random() % 128; // Determine number of nodes at this level.
    std::vector<typename Container::value_type> nodes(rand);

    // Process a node.
    if (!nodesToProcess.empty()) {
      nodesToProcess.pop_back();
    }
    // Queue up all the children nodes to process.
    std::for_each(nodes.rbegin(), nodes.rend(),
                  [&nodesToProcess](typename Container::value_type &v) {
      nodesToProcess.push_back(v);
    });
  }
}

A more thorough and compile-able example is available at: https://github.com/ldm5180/cppcon14-tdp