Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

NeighbourQueryBase needs the concept of a root child_iterator #26

Open
martinjrobins opened this issue Feb 9, 2018 · 0 comments
Open

Comments

@martinjrobins
Copy link
Collaborator

Aboria::NeighbourQueryBase needs the concept of a root child_iterator to simplify writing, for example, a depth-first iteration. At the moment it is:

     auto depth_first = [&](const auto &parent) {
      std::cout << query.get_bounds(parent) << std::endl;

      for (auto i = query.get_children(parent); i != false; ++i) {
        depth_first(i);
      }
    };

    for (auto i = query.get_children(); i != false; ++i) {
      depth_first(i);
    }

It should be

     auto depth_first = [&](const auto &parent) {
      std::cout << query.get_bounds(parent) << std::endl;

      for (auto i = query.get_children(parent); i != false; ++i) {
        depth_first(i);
      }
    };
    depth_first(query.get_root());
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant