-
Notifications
You must be signed in to change notification settings - Fork 4.8k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Regex Capture Trees #38776
Comments
This seems more like an API request. I'm going to move to the runtime repo. |
Tagging subscribers to this area: @eerhardt |
@osamakawish , would you able to come up with a more detailed API proposal with use cases and justifications? Some examples of recent API proposals are: #50902, #50389 |
I think I'm over thinking this. It would be relatively easy to implement on your own and probably just as efficient performance-wise than I originally thought. |
This is to simplify regex captures a little. Although this can be done on the side, it would be more efficiently done in the code behind.
Basically, each regex
Capture
should be treated as a type of aMatch
, with it's own captures which are in the form of an ordered list or aCaptureCollection
.This is mainly for captures containing captures, like
"Email" : "((\w+)@(\w+).com)"
.For
"Email": "address@gmail.com"
, you'd have:1.1. address
1.2. gmail
Edit. It's worth clarifying that captures not containing captures would simply have an empty
CaptureCollection
.The text was updated successfully, but these errors were encountered: