Polish release docs and add CI checks
- Correct stale references and headline-path wording in READMEs and Lean docstrings - Document build steps, comparator requirements, sweep scope, and coverage - Unify Apache headers across Lean and C++ sources - Add a bwrap-free axiom audit for the headline theorems - Add a Gitea workflow running lake build, the axiom audit, C++ tests, and coverage - Match LLVM coverage tool versions to the compiler and recreate stale build dirs
This commit is contained in:
1 parent
73e371fb40
commit
273ad72f0c
34 files changed
+431
-133
No files matched your search
@@ -2297,8 +2297,8 @@ disjunct is unsatisfiable and `ψ` reduces to "no stored key `≥ B`".
|
||||
/-- **The emptiness predicate.** At `begin.offset = 1` and `end_.offset ≥ 1`, an
|
||||
empty complete result is compatible with `db` exactly when either no stored key
|
||||
reaches `begin.key` (`c_B = n`) or the count difference is at least
|
||||
`end_.offset - 1`. This is the formal counterpart of the predicate `ψ` derived in
|
||||
the notes, and it holds regardless of the relative order of the selector keys. -/
|
||||
`end_.offset - 1`. This is the formal counterpart of the predicate `ψ` derived from the
|
||||
slice characterization, and it holds regardless of the relative order of the selector keys. -/
|
||||
theorem completeKeys_eq_nil_iff_counts {db : DB} {r : RangeRead}
|
||||
(hbegin : r.begin.offset = 1) (hoE : 1 ≤ r.end_.offset) :
|
||||
RangeRead.completeKeys db r = [] ↔
|
||||
|
||||
Reference in new issue
Block a user