This makes several changes to rw? and lazy discrimination trees based on test failures in rewrite search. Changes include: 1. Reverting to Mathlib function for candidate lemma priority in rw? 2. Introducing additional filters for auto-generated named in lazy discriminator tree. 3. Refactoring lazy discriminator values to clarify what is stored. 4. Including star keys in calculation of match closeness in prioritization. 5. Using more fields in current core context when initializing lazy discriminator tree and avoiding max heartbeat issues. --------- Co-authored-by: Scott Morrison <scott.morrison@gmail.com> |
||
|---|---|---|
| .. | ||
| bench | ||
| compiler | ||
| elabissues | ||
| ir | ||
| lean | ||
| pkg | ||
| playground | ||
| plugin | ||
| simpperf | ||
| .gitignore | ||
| common.sh | ||
| lean-toolchain | ||