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.
64 lines
2.5 KiB
Text
64 lines
2.5 KiB
Text
universe u v
|
||
|
||
theorem eqLitOfSize0 {α : Type u} (a : Array α) (hsz : a.size = 0) : a = #[] :=
|
||
a.toArrayLit_eq 0 hsz
|
||
|
||
theorem eqLitOfSize1 {α : Type u} (a : Array α) (hsz : a.size = 1) : a = #[a.getLit 0 hsz (of_decide_eq_true rfl)] :=
|
||
a.toArrayLit_eq 1 hsz
|
||
|
||
theorem eqLitOfSize2 {α : Type u} (a : Array α) (hsz : a.size = 2) : a = #[a.getLit 0 hsz (of_decide_eq_true rfl), a.getLit 1 hsz (of_decide_eq_true rfl)] :=
|
||
a.toArrayLit_eq 2 hsz
|
||
|
||
theorem eqLitOfSize3 {α : Type u} (a : Array α) (hsz : a.size = 3) :
|
||
a = #[a.getLit 0 hsz (of_decide_eq_true rfl), a.getLit 1 hsz (of_decide_eq_true rfl), a.getLit 2 hsz (of_decide_eq_true rfl)] :=
|
||
a.toArrayLit_eq 3 hsz
|
||
|
||
/-
|
||
Matcher for the following patterns
|
||
```
|
||
| #[] => _
|
||
| #[a₁] => _
|
||
| #[a₁, a₂, a₃] => _
|
||
| a => _
|
||
``` -/
|
||
def matchArrayLit {α : Type u} (C : Array α → Sort v) (a : Array α)
|
||
(h₁ : Unit → C #[])
|
||
(h₂ : ∀ a₁, C #[a₁])
|
||
(h₃ : ∀ a₁ a₂ a₃, C #[a₁, a₂, a₃])
|
||
(h₄ : ∀ a, C a)
|
||
: C a :=
|
||
if h : a.size = 0 then
|
||
@Eq.rec _ _ (fun x _ => C x) (h₁ ()) _ (a.toArrayLit_eq 0 h).symm
|
||
else if h : a.size = 1 then
|
||
@Eq.rec _ _ (fun x _ => C x) (h₂ (a.getLit 0 h (of_decide_eq_true rfl))) _ (a.toArrayLit_eq 1 h).symm
|
||
else if h : a.size = 3 then
|
||
@Eq.rec _ _ (fun x _ => C x) (h₃ (a.getLit 0 h (of_decide_eq_true rfl)) (a.getLit 1 h (of_decide_eq_true rfl)) (a.getLit 2 h (of_decide_eq_true rfl))) _ (a.toArrayLit_eq 3 h).symm
|
||
else
|
||
h₄ a
|
||
|
||
/- Equational lemmas that should be generated automatically. -/
|
||
theorem matchArrayLit.eq1 {α : Type u} (C : Array α → Sort v)
|
||
(h₁ : Unit → C #[])
|
||
(h₂ : ∀ a₁, C #[a₁])
|
||
(h₃ : ∀ a₁ a₂ a₃, C #[a₁, a₂, a₃])
|
||
(h₄ : ∀ a, C a)
|
||
: matchArrayLit C #[] h₁ h₂ h₃ h₄ = h₁ () :=
|
||
rfl
|
||
|
||
theorem matchArrayLit.eq2 {α : Type u} (C : Array α → Sort v)
|
||
(h₁ : Unit → C #[])
|
||
(h₂ : ∀ a₁, C #[a₁])
|
||
(h₃ : ∀ a₁ a₂ a₃, C #[a₁, a₂, a₃])
|
||
(h₄ : ∀ a, C a)
|
||
(a₁ : α)
|
||
: matchArrayLit C #[a₁] h₁ h₂ h₃ h₄ = h₂ a₁ :=
|
||
rfl
|
||
|
||
theorem matchArrayLit.eq3 {α : Type u} (C : Array α → Sort v)
|
||
(h₁ : Unit → C #[])
|
||
(h₂ : ∀ a₁, C #[a₁])
|
||
(h₃ : ∀ a₁ a₂ a₃, C #[a₁, a₂, a₃])
|
||
(h₄ : ∀ a, C a)
|
||
(a₁ a₂ a₃ : α)
|
||
: matchArrayLit C #[a₁, a₂, a₃] h₁ h₂ h₃ h₄ = h₃ a₁ a₂ a₃ :=
|
||
rfl
|