Searched refs:ungreedy (Results 1 – 7 of 7) sorted by relevance
| /external/pcre/dist2/testdata/ |
| D | testinput18 | 88 /\w+A/ungreedy
|
| D | testoutput18 | 131 /\w+A/ungreedy
|
| D | testinput2 | 170 /<.*>/I,ungreedy
176 /<.*?>/I,ungreedy
179 /={3,}/I,ungreedy
893 /a{2,3}?+b/I,ungreedy
923 /a{1,3}b/ungreedy
|
| D | testoutput2 | 416 /<.*>/I,ungreedy
418 Options: ungreedy
433 /<.*?>/I,ungreedy
435 Options: ungreedy
442 /={3,}/I,ungreedy
444 Options: ungreedy
2997 /a{2,3}?+b/I,ungreedy
3116 /a{1,3}b/ungreedy
|
| /external/pcre/pcrecpp/include/ |
| D | pcrecpp.h | 447 bool ungreedy() const { in ungreedy() function
|
| /external/pcre/dist2/doc/ |
| D | pcre2test.txt | 496 ungreedy set PCRE2_UNGREEDY
767 ungreedy REG_UNGREEDY ) These options are not part of
|
| D | pcre2.txt | 3095 really do want multiple matches in such cases, either use an ungreedy
4735 branches are tried is controlled by the greedy or ungreedy nature of
4742 on the way the greedy and ungreedy repetition quantifiers are specified
4792 either use an ungreedy repeat ("a\d+?") or set the PCRE2_NO_AUTO_POS-
4800 ungreedy nature of repetition quantifiers is not relevant (though it
4802 greedy and ungreedy quantifiers are treated in exactly the same way.
5031 TIAL. On the other hand, if the pattern is made ungreedy the result is
5064 there is no difference between greedy and ungreedy repetition, their
5067 ungreedy pattern shown above:
7014 With both maximizing ("greedy") and minimizing ("ungreedy" or "lazy")
[all …]
|