Lines Matching defs:current_
228 if (current_->more) {
231 return current_->key_value;
237 if (!current_) {
241 if (current_->more) {
242 DCHECK(more_iter_ != current_->more->end());
244 if (more_iter_ != current_->more->end()) return *this;
251 while (current_->key_hash[level_] == kRight || path_[level_] == nullptr) {
260 current_ = FindLeftmost(first_right_alternative, &level_, &path_);
261 if (current_->more) {
262 more_iter_ = current_->more->begin();
271 if (current_->key_hash != other.current_->key_hash) {
282 if (current_->key_hash == other.current_->key_hash) {
285 return current_->key_hash < other.current_->key_hash;
289 bool is_end() const { return current_ == nullptr; }
295 i.current_ = FindLeftmost(tree, &i.level_, &i.path_);
296 if (i.current_->more) {
297 i.more_iter_ = i.current_->more->begin();
310 const FocusedTree* current_;
315 : level_(0), current_(nullptr), def_value_(def_value) {}