diff options
| author | David Lattimore <[email protected]> | 2020-07-22 07:48:12 +0100 |
|---|---|---|
| committer | David Lattimore <[email protected]> | 2020-07-24 12:34:00 +0100 |
| commit | 02fc3d50ee4d179cc5a443a790544c2a5e439cb0 (patch) | |
| tree | ebef46263fa32fc04f1838b8b6a5191ce8809184 /crates/ra_syntax/test_data/parser/err/0025_nope.rs | |
| parent | 699619a65cf816b927fffa77b2b38f611d8460bc (diff) | |
SSR: Refactor to not rely on recursive search for nesting of matches
Previously, submatches were handled simply by searching in placeholders
for more matches. That only works if we search all nodes in the tree
recursively. In a subsequent commit, I intend to make search not always
be recursive recursive. This commit prepares for that by finding all
matches, even if they overlap, then nesting them and removing
overlapping matches.
Diffstat (limited to 'crates/ra_syntax/test_data/parser/err/0025_nope.rs')
0 files changed, 0 insertions, 0 deletions