diff options
| author | bors <bors@rust-lang.org> | 2024-06-24 07:20:50 +0000 |
|---|---|---|
| committer | bors <bors@rust-lang.org> | 2024-06-24 07:20:50 +0000 |
| commit | 4dd0ad7afd118e4ab7af0423696cf2b469207c4d (patch) | |
| tree | 2bd128c6a7204c7a4b9d55b43dd94daf3d8e5968 /tests/codegen/patchable-function-entry/patchable-function-entry-both-flags.rs | |
| parent | 70e9582f4c076a6b22ba4844f075762a1ed2296b (diff) | |
| parent | efecb90b7f4e6468e03c1a9520535a5d7bb5cd1c (diff) | |
| download | rust-4dd0ad7afd118e4ab7af0423696cf2b469207c4d.tar.gz rust-4dd0ad7afd118e4ab7af0423696cf2b469207c4d.zip | |
Auto merge of #17478 - kilpkonn:master, r=Veykril
Simplify some term search tactics Working on the paper `@phijor` found that "Data constructor" tactic could be simplified quite a bit by running it only in the backwards direction. With n+1 rounds it has same coverage as previous implementation in n rounds, however the tactic it self is more simple and also potentially faster as there is less to do. In a nutshell the idea is to only work with types in the wish-list rather than with any types. Turns out it is quite a bit faster: Before: ``` ripgrep: Tail Expr syntactic hits: 238/1692 (14%) Tail Exprs found: 1223/1692 (72%) Term search avg time: 15ms nalgebra: Tail Expr syntactic hits: 125/3001 (4%) Tail Exprs found: 2143/3001 (71%) Term search avg time: 849ms ``` After ```` ripgrep: Tail Expr syntactic hits: 246/1692 (14%) Tail Exprs found: 1209/1692 (71%) Term search avg time: 8ms nalgebra: Tail Expr syntactic hits: 125/3001 (4%) Tail Exprs found: 2028/3001 (67%) Term search avg time: 305ms ```` _Also removed niche optimization of removing scope defs from the search space as this wasn't helping much anyway and made code a bit more complex._
Diffstat (limited to 'tests/codegen/patchable-function-entry/patchable-function-entry-both-flags.rs')
0 files changed, 0 insertions, 0 deletions
