Lines Matching refs:node_
343 : node_(node),
346 if (node_) {
348 while (!node_->children.empty()) {
349 const int child_index = node_->children.size() - 1;
350 stack_.push_back({node_, child_index});
351 node_ = node_->children[child_index].get();
354 if (!node_->children.empty() && iterate_leaves_only) {
361 : node_(other.node_),
367 CHECK_NE(nullptr, node_) << "walking off the end() of an iterator!";
370 node_ = stack_.back().first;
375 // All children are visited, yield <node_>.
379 stack_.push_back({node_, next_child_index});
380 node_ = node_->children[next_child_index].get();
381 while (!node_->children.empty()) {
382 const int child_index = node_->children.size() - 1;
383 stack_.push_back({node_, child_index});
384 node_ = node_->children[child_index].get();
392 if (!node_->children.empty()) {
393 stack_.push_back({node_, /*child-index=*/0});
394 node_ = node_->children[0].get();
395 if (node_->children.empty() || !iterate_leaves_only_) {
405 node_ = stack_.back().first;
408 if (node_->children.size() > next_child_index) {
409 stack_.push_back({node_, next_child_index});
410 node_ = node_->children[next_child_index].get();
412 if (node_->children.empty() || !iterate_leaves_only_) {
421 // We've walked off the end of the tree. Set node_ to nullptr to signify
423 node_ = nullptr;
433 return node_ == other.node_;
436 return node_ != other.node_;
448 current_ = MakeUnique<value_type>(index, node_->data);
455 NodeType* node_;
457 // to node_. This allows us to backtrack and know where to go next.
