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.
22 lines
576 B
Text
22 lines
576 B
Text
structure HeapNodeAux (α : Type u) (h : Type u) where
|
||
val : α
|
||
children : List h
|
||
|
||
-- A `Heap` is a forest of binomial trees.
|
||
inductive Heap (α : Type u) : Type u where
|
||
| heap (ns : List (HeapNodeAux α (Heap α))) : Heap α
|
||
deriving Inhabited
|
||
|
||
open Heap
|
||
|
||
partial def toArrayUnordered' (h : Heap α) : Array α :=
|
||
go #[] h
|
||
where
|
||
go (acc : Array α) : Heap α → Array α
|
||
| heap ns => Id.run do
|
||
let mut acc := acc
|
||
for h₁ : n in ns do
|
||
acc := acc.push n.val
|
||
for h₂ : h in n.children do
|
||
acc := go acc h
|
||
return acc
|