Method NextUnmatched

be/src/exec/hash-table.inline.h:383–412

}

inline void HashTable::Iterator::NextUnmatched() {
  DCHECK(!AtEnd());
  Bucket* bucket = &table_->buckets_[bucket_idx_];
  // Check if there is any remaining unmatched duplicate node in the current bucket.
  if (table_->stores_duplicates() && bucket->HasDuplicates()) {
    auto next_node = node_->Next();
    while (next_node != NULL) {
      node_ = next_node;
      if (!node_->IsMatched()) return;
      next_node = next_node->Next();
    }
  }
  // Move to the next filled bucket and return if this bucket is not matched or
  // iterate to the first not matched duplicate node.
  table_->NextFilledBucket(&bucket_idx_, &node_);
  while (bucket_idx_ != Iterator::BUCKET_NOT_FOUND) {
    bucket = &table_->buckets_[bucket_idx_];
    if (!table_->stores_duplicates() || !bucket->HasDuplicates()) {
      if (!bucket->IsMatched()) return;
    } else {
      auto next_node = node_->Next();
      while (node_->IsMatched() && next_node != NULL) {
        node_ = next_node;
        next_node = next_node->Next();
      }
      if (!node_->IsMatched()) return;
    }
    table_->NextFilledBucket(&bucket_idx_, &node_);
  }
}

inline void HashTableCtx::set_level(int level) {
  DCHECK_GE(level, 0);