Lines Matching refs:greedy
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
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
6311 be greedy, and instead matches the minimum number of times possible, so
6328 Perl), the quantifiers are not greedy by default, but individual ones
6329 can be made greedy by following them with a question mark. In other
6385 With both maximizing ("greedy") and minimizing ("ungreedy" or "lazy")
6441 Possessive quantifiers are always greedy; the setting of the
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
7873 {n,} n or more, greedy
8903 there is no difference between greedy and ungreedy repetition, their
