Score of a candidate compaction input. Higher is better: first by the predicted
net file count reduction, then by the number of files participating in an
overlap, then by smaller input bytes.
A closed merge in an inactive window may take this many times
MAX_INPUT_FILES. Resolving overlaps across a whole window needs all of
its overlapping files at once, and each byte is rewritten once per window.
Whether the region has written at least as many rows as files hold, and at
least one row, since the newest of them was written. Sequences are assigned
per row and compaction keeps the inputsβ maximum, so this needs no state.
Files written before row counts were recorded have zero rows, so a window
holding them is not quiet.
Last-resort pick for inactive windows with no balance requirement at all.
Callers must only pass single-level (L0) files so the rewrite stays bounded
by their bytes.
Uses the same half-open windows as memtables, including timestamps in the first
second after a boundary. An unrepresentable window start is clamped to i64::MIN.