Method searchFrameValue

bolt/exec/WindowPartition.cpp:214–251

// show good locality this could give good results.
template <typename BoundTest>
vector_size_t WindowPartition::searchFrameValue(
    const RangeSearchParams<BoundTest>& params,
    vector_size_t start,
    column_index_t orderByColumn,
    column_index_t frameColumn) const {
  auto startRow = partition_[start];
  auto order = sortKeyInfo_[0].second;
  for (vector_size_t i = start; i >= 0 && i < numRows(); i += params.step) {
    auto compareResult = data_->compare(
        partition_[i],
        startRow,
        orderByColumn,
        frameColumn,
        {order.isNullsFirst(), order.isAscending(), false});

    // The bound value was found. Return if firstMatch required.
    // If the last match is required, then we need to find the first row that
    // crosses the bound and return the previous (or following, based on skip)
    // row.
    if (compareResult == 0) {
      if (params.firstMatch) {
        return i;
      }
    }

    // Bound is crossed. Last match needs the previous row.
    // But for first row matches, this is the first
    // row that has crossed, but not equals boundary (The equal boundary case
    // is covered by the condition above). So the bound matches this row itself.
    if (params.boundTest(compareResult)) {
      return params.firstMatch ? i : i - params.step;
    }
  }

  // Return a row beyond the partition boundary. The logic to determine valid
  // frames handles the out of bound and empty frames from this value.
  return params.step == 1 ? numRows() + 1 : -1;
}

template <typename BoundTest>
void WindowPartition::updateKRangeFrameBounds(