6559cc582b16086f716eb461f5af801cf14b0105
Collapse duplicated cells and share their conditions: - Merge the crossed complete clamp cells. They all fall through to `end_.key`, and only the bottom / infinite / head-bottom / last-ge cells conflict with the long nonpositive cell, so test `negCrossClampNonposLastGe` explicitly and let the rest share the fall-through. - Allow `r.end_.offset ≤ 1` in the crossed truncated nonpositive cell and merge it with the old `...Small` cell into `negCrossTruncRevCrossedLow`. - Use `overshoot r res` in `negCrossOvershoot` and `negCrossTruncRevBelowEnd` instead of spelling out the same key bound. - Drop the `r.begin.key ≤ r.end_.key` shortcut in `emptyValue`; the cardinality branch below already returns `bottom..end_.key` in that case. - Inline the single-use helpers: `...TruncRevBelowEnd`, `...TruncRevCrossedNonposLarge`, `...ResidualFiniteUnder`, `...ResidualTopLargeSentinel`, `...TruncRevUnder` and `...TruncTopTopEq`. `Bridge.lean` follows the removed cells, keeping the deleted reference predicate as a private legacy abbreviation for the bridge proof. `lake build` is clean.
Description
A closed-form algorithm that computes the minimal conflict range for an observed
range read and result.
Apache-2.0
1.1 MiB
2 Watchers
0 Forks
Languages
Lean
97.5%
C++
2.3%
Shell
0.1%