6e538c35dd
This PR replaces all usages of `[:]` slice notation in `src` with the new `[...]` notation in production code, tests and comments. The underlying implementation of the `Subarray` functions stays the same. Notation cheat sheet: * `*...*` is the doubly-unbounded range. * `*...a` or `*...<a` contains all elements that are less than `a`. * `*...=a` contains all elements that are less than or equal to `a`. * `a...*` contains all elements that are greater than or equal to `a`. * `a...b` or `a...<b` contains all elements that are greater than or equal to `a` and less than `b`. * `a...=b` contains all elements that are greater than or equal to `a` and less than or equal to `b`. * `a<...*` contains all elements that are greater than `a`. * `a<...b` or `a<...<b` contains all elements that are greater than `a` and less than `b`. * `a<...=b` contains all elements that are greater than `a` and less than or equal to `b`. Benchmarks have shown that importing the iterator-backed parts of the polymorphic slice library in `Init` impacts build performance. This PR avoids this problem by separating those parts of the library that do not rely on iterators from those those that do. Whereever the new slice notation is used, only the iterator-independent files are imported. |
||
|---|---|---|
| .. | ||
| Arith | ||
| BuiltinSimprocs | ||
| Arith.lean | ||
| Attr.lean | ||
| BuiltinSimprocs.lean | ||
| Diagnostics.lean | ||
| LoopProtection.lean | ||
| Main.lean | ||
| RegisterCommand.lean | ||
| Rewrite.lean | ||
| SimpAll.lean | ||
| SimpCongrTheorems.lean | ||
| Simproc.lean | ||
| SimpTheorems.lean | ||
| Types.lean | ||