Searched refs:greedy (Results 1 – 11 of 11) sorted by relevance
/PHP-7.2/ext/pcre/tests/ |
H A D | preg_match_all_edit_basic.phpt | 16 …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 D | preg_match_all_basic.phpt | 12 …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-7.2/ext/standard/tests/streams/ |
H A D | proc_open_bug51800.phpt | 19 this is much more resource greedy and complexer to integrate into the user script. */
|
/PHP-7.2/ext/mbstring/oniguruma/src/ |
H A D | regcomp.c | 748 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() 3604 && q->greedy == qn->greedy) { in setup_comb_exp_check() [all …]
|
H A D | regparse.c | 1307 NQTFR(node)->greedy = 1; in node_new_quantifier() 2108 if (q->greedy) { in popular_quantifier_num() 2167 p->lower = 0; p->upper = REPEAT_INFINITE; p->greedy = 1; in onig_reduce_nested_quantifier() 2175 p->lower = 0; p->upper = 1; p->greedy = 0; in onig_reduce_nested_quantifier() 2179 p->lower = 0; p->upper = 1; p->greedy = 0; in onig_reduce_nested_quantifier() 2185 p->lower = 0; p->upper = 1; p->greedy = 1; in onig_reduce_nested_quantifier() 2242 int greedy; member 3168 tok->u.repeat.greedy = 0; in fetch_token() 3179 tok->u.repeat.greedy = 1; in fetch_token() 3183 tok->u.repeat.greedy = 1; in fetch_token() [all …]
|
H A D | regparse.h | 175 int greedy; member
|
/PHP-7.2/ext/mbstring/oniguruma/doc/ |
H A D | RE | 96 greedy 115 possessive (greedy and does not backtrack once match)
|
/PHP-7.2/ext/pcre/pcrelib/ |
H A D | HACKING | 424 skipping the pattern is also valid (greedy and non-greedy). The third is used
|
H A D | ChangeLog | 516 38. If a greedy quantified \X was preceded by \C in UTF mode (e.g. \C\X*), 1413 35. Improve JIT code generation for greedy plus quantifier. 4992 greedy quantifiers. Consequently, the use of the possessive quantifier forces
|
/PHP-7.2/ext/pcre/pcrelib/doc/ |
H A D | pcre.txt | 1422 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 2378 are not greedy by default, but become greedy if followed by "?". It is 4686 fiers is inverted, that is, by default they are not greedy, but if fol- 6289 By default, the quantifiers are "greedy", that is, they match as much 7864 ? 0 or 1, greedy 7867 * 0 or more, greedy 7870 + 1 or more, greedy 7874 {n,m} at least n, no more than m, greedy [all …]
|
/PHP-7.2/ |
H A D | NEWS | 2135 . Fixed bug #74302 (yield fromLABEL is over-greedy). (Sara)
|
Completed in 84 milliseconds