-
Enhancement
-
Resolution: Fixed
-
P4
-
None
-
b24
| Issue | Fix Version | Assignee | Priority | Status | Resolution | Resolved In Build |
|---|---|---|---|---|---|---|
| JDK-8225967 | 14 | Ivan Gerasimov | P4 | Resolved | Fixed | team |
Current regex engine uses a special optimized node of type CharPropertyGreedy for greedy quantifiers '+' and '*'.
The same optimized node type can be used without modifications for greedy quantifiers without upper limit of type '{N,}'.
Currently, the later type of quantifier uses two nodes Curly + Single, which also increases the depth of the regex tree.
The same optimized node type can be used without modifications for greedy quantifiers without upper limit of type '{N,}'.
Currently, the later type of quantifier uses two nodes Curly + Single, which also increases the depth of the regex tree.
- backported by
-
JDK-8225967 Optimize regex tree for greedy quantifiers of type {N,}
-
- Resolved
-