98e4b2882f
This PR migrates usages of `Std.Range` to the new polymorphic ranges. This PR unfortunately increases the transitive imports for frequently-used parts of `Init` because the ranges now rely on iterators in order to provide their functionality for types other than `Nat`. However, iteration over ranges in compiled code is as efficient as before in the examples I checked. This is because of a special `IteratorLoop` implementation provided in the PR for this purpose. There were two issues that were uncovered during migration: * In `IndPredBelow.lean`, migrating the last remaining range causes `compilerTest1.lean` to break. I have minimized the issue and came to the conclusion it's a compiler bug. Therefore, I have not replaced said old range usage yet (see #9186). * In `BRecOn.lean`, we are publicly importing the ranges. Making this import private should theoretically work, but there seems to be a problem with the module system, causing the build to panic later in `Init.Data.Grind.Poly` (see #9185). * In `FuzzyMatching.lean`, inlining fails with the new ranges, which would have led to significant slowdown. Therefore, I have not migrated this file either.
16 lines
398 B
Text
16 lines
398 B
Text
def build (n : Nat) : Array Unit := Id.run <| do
|
||
let mut out := #[]
|
||
for _ in *...n do
|
||
out := out.push ()
|
||
out
|
||
|
||
@[noinline] def size : IO Nat := pure 50000
|
||
|
||
def bench (f : ∀ {α : Type}, α → IO Unit := fun _ => pure ()) : IO Unit := do
|
||
let n ← size
|
||
let arr := build n
|
||
timeit "time" $
|
||
for _ in *...(1000 : Nat) do
|
||
f $ #[1, 2, 3, 4].map fun ty => arr[ty]!
|
||
|
||
#eval bench
|