diff options
| author | bors[bot] <26634292+bors[bot]@users.noreply.github.com> | 2021-12-12 16:38:56 +0000 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2021-12-12 16:38:56 +0000 |
| commit | db2a7087b994e20f264f26ad6db75184282ad120 (patch) | |
| tree | dc2644c96f3cea0e29539a236112211d3b82ee6c /src/test/codegen/src-hash-algorithm | |
| parent | fc628cfc8952faa370e650d055c06205e923e7e6 (diff) | |
| parent | 3b5b988526b9cec74422f46e20ab1b2f9826d39c (diff) | |
| download | rust-db2a7087b994e20f264f26ad6db75184282ad120.tar.gz rust-db2a7087b994e20f264f26ad6db75184282ad120.zip | |
Merge #10995
10995: internal: switch from trait-based TokenSource to simple struct of arrays r=matklad a=matklad cc #10765 The idea here is to try to simplify the interface as best as we can. The original trait-based approach is a bit over-engineered and hard to debug. Here, we replace callback with just data. The next PR in series will replace the output `TreeSink` trait with data as well. The biggest drawback here is that we now require to materialize all parser's input up-front. This is a bad fit for macro by example: when you parse `$e:expr`, you might consume only part of the input. However, today's trait-based solution doesn't really help -- we were already materializing the whole thing! So, let's keep it simple! Co-authored-by: Aleksey Kladov <aleksey.kladov@gmail.com>
Diffstat (limited to 'src/test/codegen/src-hash-algorithm')
0 files changed, 0 insertions, 0 deletions
