Home
last modified time | relevance | path

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

/PHP-5.6/ext/pcre/tests/
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)
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)
/PHP-5.6/ext/standard/tests/streams/
H A Dproc_open_bug51800.phpt19 this is much more resource greedy and complexer to integrate into the user script. */
/PHP-5.6/ext/mbstring/oniguruma/
H A Dregcomp.c748 if (qn->greedy && infinite) { in compile_length_quantifier_node()
762 if (qn->greedy) { in compile_length_quantifier_node()
865 if (qn->greedy) { in compile_quantifier_node()
977 if (qn->greedy && infinite) { in compile_length_quantifier_node()
999 if (qn->greedy) { in compile_length_quantifier_node()
1013 else if (!infinite && qn->greedy && in compile_length_quantifier_node()
1067 if (qn->greedy) { in compile_quantifier_node()
1085 if (qn->greedy) { in compile_quantifier_node()
1128 else if (!infinite && qn->greedy && in compile_quantifier_node()
3559 && q->greedy == qn->greedy) { in setup_comb_exp_check()
[all …]
H A Dregparse.c1361 NQTFR(node)->greedy = 1; in node_new_quantifier()
2160 if (q->greedy) { in popular_quantifier_num()
2219 p->lower = 0; p->upper = REPEAT_INFINITE; p->greedy = 1; in onig_reduce_nested_quantifier()
2227 p->lower = 0; p->upper = 1; p->greedy = 0; in onig_reduce_nested_quantifier()
2231 p->lower = 0; p->upper = 1; p->greedy = 0; in onig_reduce_nested_quantifier()
2237 p->lower = 0; p->upper = 1; p->greedy = 1; in onig_reduce_nested_quantifier()
2294 int greedy; member
3184 tok->u.repeat.greedy = 0; in fetch_token()
3195 tok->u.repeat.greedy = 1; in fetch_token()
3199 tok->u.repeat.greedy = 1; in fetch_token()
[all …]
H A Dregparse.h175 int greedy; member
/PHP-5.6/ext/mbstring/oniguruma/doc/
H A DRE107 greedy
126 possessive (greedy and does not backtrack after repeated)
416 + /a{n}?/ is not a non-greedy operator.
/PHP-5.6/ext/pcre/pcrelib/
H A DHACKING424 skipping the pattern is also valid (greedy and non-greedy). The third is used
H A DChangeLog330 38. If a greedy quantified \X was preceded by \C in UTF mode (e.g. \C\X*),
1227 35. Improve JIT code generation for greedy plus quantifier.
4806 greedy quantifiers. Consequently, the use of the possessive quantifier forces
/PHP-5.6/ext/pcre/pcrelib/doc/
H A Dpcre.txt1422 branches are tried is controlled by the greedy or ungreedy nature of
1429 on the way the greedy and ungreedy repetition quantifiers are specified
1485 1. Because the algorithm finds all possible matches, the greedy or
2379 are not greedy by default, but become greedy if followed by "?". It is
4687 fiers is inverted, that is, by default they are not greedy, but if fol-
6293 By default, the quantifiers are "greedy", that is, they match as much
7860 ? 0 or 1, greedy
7863 * 0 or more, greedy
7866 + 1 or more, greedy
7870 {n,m} at least n, no more than m, greedy
[all …]

Completed in 75 milliseconds