You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Once we have #484, we can greatly simplify our surrounding pairs code. In the process, we'd like to do the following:
Only deal with expanding from a single position, so we can remove the backwards pass to extend past selection start
Refactor text-based item scope stage to leverage surrounding pairs code. We can probably use a greatly simplified version of the algorithm suggested in Support generic comma-separated lists #357, because that one tries to handle ranges, not just positions
Support "every" for surrounding pairs
The text was updated successfully, but these errors were encountered:
I had an idea for an alternative implementation of surrounding pairs
We start off with a pure text based implementation that finds all the delimiters. We then use Tree sitter to disqualify or quantify the delimiters. For example tree sitter could determine that an angle bracket is actually a less than operator, that the parenthesis is inside a string or a comment. As well as quantifying if a quote is the opening or closing of a string.
Once we have #484, we can greatly simplify our surrounding pairs code. In the process, we'd like to do the following:
The text was updated successfully, but these errors were encountered: