Home
last modified time | relevance | path

Searched refs:ungreedy (Results 1 – 7 of 7) sorted by relevance

/external/pcre/dist2/testdata/
Dtestinput1892 /\w+A/ungreedy
Dtestoutput18138 /\w+A/ungreedy
Dtestinput2170 /<.*>/I,ungreedy
176 /<.*?>/I,ungreedy
179 /={3,}/I,ungreedy
893 /a{2,3}?+b/I,ungreedy
925 /a{1,3}b/ungreedy
Dtestoutput2420 /<.*>/I,ungreedy
422 Options: ungreedy
437 /<.*?>/I,ungreedy
439 Options: ungreedy
446 /={3,}/I,ungreedy
448 Options: ungreedy
3140 /a{2,3}?+b/I,ungreedy
3265 /a{1,3}b/ungreedy
/external/pcre/pcrecpp/include/
Dpcrecpp.h447 bool ungreedy() const { in ungreedy() function
/external/pcre/dist2/doc/
Dpcre2.txt3494 really do want multiple matches in such cases, either use an ungreedy
5270 branches are tried is controlled by the greedy or ungreedy nature of
5277 on the way the greedy and ungreedy repetition quantifiers are specified
5327 either use an ungreedy repeat ("a\d+?") or set the PCRE2_NO_AUTO_POS-
5335 ungreedy nature of repetition quantifiers is not relevant (though it
5337 greedy and ungreedy quantifiers are treated in exactly the same way.
5566 TIAL. On the other hand, if the pattern is made ungreedy the result is
5599 there is no difference between greedy and ungreedy repetition, their
5602 ungreedy pattern shown above:
7669 With both maximizing ("greedy") and minimizing ("ungreedy" or "lazy")
[all …]
Dpcre2test.txt564 ungreedy set PCRE2_UNGREEDY
870 ungreedy REG_UNGREEDY ) These options are not part of