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