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.
22 lines
507 B
Text
22 lines
507 B
Text
namespace Ex
|
||
class GetElem (Cont : Type u) (Idx : Type v) (Elem : outParam (Type w)) where
|
||
getElem (xs : Cont) (i : Idx) : Elem
|
||
|
||
export GetElem (getElem)
|
||
|
||
instance : GetElem (Array α) Nat α where
|
||
getElem xs i := xs.get i sorry
|
||
|
||
opaque f : Option Bool → Id Unit
|
||
|
||
def bad2 (bs : Array Bool) (n : Nat) : Id Unit := do
|
||
for idx in *...n do
|
||
let b := getElem bs idx
|
||
f b
|
||
|
||
def bad3 (bs : Array Bool) (n : Nat) : Id Unit := do
|
||
for h : idx in *...n do
|
||
let b := getElem bs idx
|
||
f b
|
||
|
||
end Ex
|