Hello!
When building a match-tree, the regex engine optimizes '*' and '+'
greedy quantifiers by using special node of type CharPropertyGreedy.
This later class can be used unmodified for other greedy quantifiers
without the upper limit, i.e. of type '{N,}'.
Would you please help review this simple optimization?
BUGURL: https://bugs.openjdk.java.net/browse/JDK-8225198
WEBREV: http://cr.openjdk.java.net/~igerasim/8225198/00/webrev/
(With the fix, one unused class was also removed. This class was to
implement conditionals, which were never supported by Java regexs.)
--
With kind regards,
Ivan Gerasimov
