08eb78a5b2
This PR sets up the new integrated test/bench suite. It then migrates all benchmarks and some related tests to the new suite. There's also some documentation and some linting. For now, a lot of the old tests are left alone so this PR doesn't become even larger than it already is. Eventually, all tests should be migrated to the new suite though so there isn't a confusing mix of two systems.
38 lines
1.6 KiB
Text
38 lines
1.6 KiB
Text
module
|
||
@[expose] public section -- TODO: remove after `congr_eq` fixed
|
||
open List
|
||
|
||
theorem eraseP_eq_nil_iff {xs : List α} {p : α → Bool} : xs.eraseP p = [] ↔ xs = [] ∨ ∃ x, p x ∧ xs = [x] := by
|
||
induction xs with grind
|
||
|
||
theorem eraseP_ne_nil_iff {xs : List α} {p : α → Bool} : xs.eraseP p ≠ [] ↔ xs ≠ [] ∧ ∀ x, p x → xs ≠ [x] := by
|
||
induction xs with grind
|
||
|
||
theorem length_eraseP_of_mem (al : a ∈ l) (pa : p a) :
|
||
length (l.eraseP p) = length l - 1 := by
|
||
grind
|
||
|
||
theorem eraseP_filterMap' {f : α → Option β} {l : List α} :
|
||
filterMap f (l.eraseP (fun x => match f x with | some y => p y | none => false)) = (filterMap f l).eraseP p := by
|
||
grind
|
||
|
||
theorem eraseP_append_left {a : α} (pa : p a) {l₁ : List α} {l₂} : a ∈ l₁ → (l₁ ++ l₂).eraseP p = l₁.eraseP p ++ l₂ := by
|
||
grind
|
||
|
||
theorem eraseP_append_right {l₁ : List α} {l₂} (h : ∀ b ∈ l₁, ¬p b) :
|
||
eraseP p (l₁ ++ l₂) = l₁ ++ l₂.eraseP p := by
|
||
grind
|
||
|
||
theorem head_eraseP_mem {xs : List α} {p : α → Bool} (h) : (xs.eraseP p).head h ∈ xs := by
|
||
-- This had previously been a `grind` lemma,
|
||
-- but it is quite aggressive as it initiates `Sublist` based reasoning.
|
||
grind [Sublist.head_mem]
|
||
|
||
theorem getLast_eraseP_mem {xs : List α} {p : α → Bool} (h) : (xs.eraseP p).getLast h ∈ xs := by
|
||
-- As above, this had previously been a `grind` lemma.
|
||
grind [Sublist.getLast_mem]
|
||
|
||
theorem set_getElem_succ_eraseIdx_succ
|
||
{xs : Array α} {i : Nat} (h : i + 1 < xs.size) :
|
||
(xs.eraseIdx (i + 1)).set i xs[i + 1] (by grind) = xs.eraseIdx i := by
|
||
grind (splits := 10)
|