6cfdb13da15b23ebf9f213cbd00db02711422a5e
On a clamped nonpositive begin the reference clamped rule `compactClamped` and the positive rule `compactPositive` coincide: the begin offset is nonpositive, so `residualB = 0`, and the reversed-truncated rule collapses to its no-skip case. So `closedForm` now dispatches on `1 ≤ r.begin.offset ∨ clampedNonpos r res` and drops `closedFormClamped`, `closedFormNonposRevTrunc` and `nonposRevReduced`, together with their bridges. `closedForm_eq` splits explicitly on the positive and clamped regions, using the new reference lemmas `ref_closedFormNonposRevTrunc_eq` and `ref_compactClamped_eq_compactPositive`. The headlines, their statements and the comparator inputs are unchanged.
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%