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.
12 lines
401 B
Text
12 lines
401 B
Text
import Lean.Parser.Module
|
|
|
|
/-!
|
|
Test parsing only on a .lean file, which necessarily has to be one that does
|
|
not depend on non-built-in syntax, e.g. `Init.Prelude`. -/
|
|
|
|
def main : List String → IO Unit
|
|
| [fname, n] => do
|
|
let env ← Lean.mkEmptyEnvironment
|
|
for _ in *...n.toNat! do
|
|
discard $ Lean.Parser.testParseFile env fname
|
|
| _ => throw $ IO.userError "give file and iteration count"
|