Searched refs:traversal_ (Results 1 – 2 of 2) sorted by relevance
71 if (traversal_.size() != other.traversal_.size()) { in operator ==()74 for (size_t i = 0; i < traversal_.size(); ++i) { in operator ==()75 const Node& a = traversal_[i]; in operator ==()76 const Node& b = other.traversal_[i]; in operator ==()113 int start_num_nodes = traversal_.size(); in FlattenInto()171 node.num_nodes = traversal_.size() - start_num_nodes + 1; in FlattenInto()173 traversal_.push_back(std::move(node)); in FlattenInto()196 for (const Node& node : traversal_) { in Unflatten()297 auto it = traversal_.rbegin(); in FlattenUpTo()300 if (it == traversal_.rend()) { in FlattenUpTo()[all …]
130 if (traversal_.empty()) { in num_leaves()133 return traversal_.back().num_leaves; in num_leaves()136 int num_nodes() const { return traversal_.size(); } in num_nodes()197 std::vector<Node> traversal_; variable208 return H::combine_contiguous(std::move(h), t.traversal_.data(), in AbslHashValue()209 t.traversal_.size()); in AbslHashValue()