Home
last modified time | relevance | path

Searched refs:greedy (Results 1 – 9 of 9) sorted by relevance

/PHP-5.3/ext/pcre/tests/
H A Dpreg_match_all_basic.phpt12 …2, PREG_SET_ORDER)); //finds "This is a test." and "This is another test." (non-greedy) (2 matches)
14 …ATTERN_ORDER)); //finds ".\ [...]" and everything else to the end of the string. (greedy) (1 match)
H A Dpreg_match_all_edit_basic.phpt16 …ET_ORDER)); //finds "This is a test." and "This is another test." (non-greedy) (2 matches)
19 … //finds ".\ [...]" and everything else to the end of the string. (greedy) (1 match)
/PHP-5.3/ext/mbstring/oniguruma/
H A Dregcomp.c728 if (qn->greedy && infinite) { in compile_length_quantifier_node()
742 if (qn->greedy) { in compile_length_quantifier_node()
765 else if (qn->upper == 1 && qn->greedy) { in compile_length_quantifier_node()
845 if (qn->greedy) { in compile_quantifier_node()
957 if (qn->greedy && infinite) { in compile_length_quantifier_node()
979 if (qn->greedy) { in compile_length_quantifier_node()
993 else if (!infinite && qn->greedy && in compile_length_quantifier_node()
1047 if (qn->greedy) { in compile_quantifier_node()
1065 if (qn->greedy) { in compile_quantifier_node()
1108 else if (!infinite && qn->greedy && in compile_quantifier_node()
[all …]
H A Dregparse.c1330 NQUANTIFIER(node).greedy = 1; in node_new_quantifier()
2124 if (qf->greedy) { in popular_quantifier_num()
2182 p->lower = 0; p->upper = REPEAT_INFINITE; p->greedy = 1; in onig_reduce_nested_quantifier()
2190 p->lower = 0; p->upper = 1; p->greedy = 0; in onig_reduce_nested_quantifier()
2194 p->lower = 0; p->upper = 1; p->greedy = 0; in onig_reduce_nested_quantifier()
2200 p->lower = 0; p->upper = 1; p->greedy = 1; in onig_reduce_nested_quantifier()
2257 int greedy; member
3012 tok->u.repeat.greedy = 0; in fetch_token()
3023 tok->u.repeat.greedy = 1; in fetch_token()
3027 tok->u.repeat.greedy = 1; in fetch_token()
[all …]
H A Dregparse.h126 int greedy; member
/PHP-5.3/ext/mbstring/oniguruma/doc/
H A DRE75 greedy
94 possessive (greedy and does not backtrack after repeated)
381 + /a{n}?/ is not a non-greedy operator.
/PHP-5.3/ext/pcre/pcrelib/
H A DHACKING379 skipping the pattern is also valid (greedy and non-greedy). The third is used
H A DChangeLog291 35. Improve JIT code generation for greedy plus quantifier.
3869 greedy quantifiers. Consequently, the use of the possessive quantifier forces
/PHP-5.3/ext/pcre/pcrelib/doc/
H A Dpcre.txt1388 branches are tried is controlled by the greedy or ungreedy nature of
1395 on the way the greedy and ungreedy repetition quantifiers are specified
1442 1. Because the algorithm finds all possible matches, the greedy or
2280 are not greedy by default, but become greedy if followed by "?". It is
4452 fiers is inverted, that is, by default they are not greedy, but if fol-
5901 By default, the quantifiers are "greedy", that is, they match as much
7352 ? 0 or 1, greedy
7355 * 0 or more, greedy
7358 + 1 or more, greedy
7362 {n,m} at least n, no more than m, greedy
[all …]

Completed in 76 milliseconds