Function frontierAfter

pj_datastore/src/query.cpp:53–55

Min-heap ordering for cursor frontiers: earliest (ts, chunk, row) on top.

// Min-heap ordering for cursor frontiers: earliest (ts, chunk, row) on top.
[[nodiscard]] bool frontierAfter(const CursorFrontier& a, const CursorFrontier& b) {
  return std::tie(a.ts, a.chunk, a.row) > std::tie(b.ts, b.chunk, b.row);
}

// Replace the heap top with its in-chunk successor (has_next) or drop it.
// O(1) when the successor is still the global minimum — which is every