Lines Matching refs:groups
9 However, it was failing to mark any other groups between the hightest
11 those groups contained whatever was previously there. An example is the
24 subroutine call (recursive or otherwise) if the number of captured groups
196 7. Fixed a bug concerned with zero-minimum possessive groups that could match
207 level, when possessive repeated groups should always return to a higher
413 string (which is used for indefinitely repeated groups to allow for
454 14. The code in pcre_compile.c for creating the table of named capturing groups
457 pass (on the stack unless there are more than 20 named groups, in which
460 shorter) and prepared the way for better handling of references to groups
483 19. The code for checking named groups as conditions, either for being set or
485 above). Processing unduplicated named groups should now be as fast at
486 numerical groups, and processing duplicated groups should be faster than
1025 any matched groups, this happens at the end of processing. In the case when
1054 1 to "aa" instead of to an empty string. The bug affected repeated groups
1071 possessively repeated groups, and atomic groups.
1153 4. (*MARK) settings inside atomic groups that do not contain any capturing
1351 18. Change 22 for version 13 caused atomic groups to use more stack. This is
1352 inevitable for groups that contain captures, but it can lead to a lot of
1354 groups that do not contain any capturing parentheses.
1425 calls to match() for possessively repeated groups such as (abc)++ when
1428 11. While implementing 10, a number of bugs in the handling of groups were
1491 branched capturing and non-capturing groups, repeated or not, and also to
1493 in PCRE) and also to nested atomic groups.
1499 24. The way atomic groups are processed by pcre_exec() has been changed so that
1777 be atomic by that change, but in the case of named groups, the amount of
2062 same bug. Such groups have to be quantified to be useful, or contained
2491 (an internal error was given). Such groups are now left in the compiled
2859 the size of patterns that contain repeated groups with explicit upper
2862 32-bit integer. However, it turns out that people want to use groups that
3021 for detecting groups that can match an empty string.
3026 bit of new cunning has reduced the workspace needed for groups with
3351 them into atomic groups such as ($>a+). Now they have their own opcodes,
3358 numbered groups.
3384 (a) Named groups can now be defined as (?<name>...) or (?'name'...) as well
3399 groups (named and numbered) that are never evaluated inline, but can be
3709 atomic groups. Thus, for example, (?R) is treated as if it were (?>(?R)).
4548 5. PCRE was failing to diagnose the case of two named groups with the same
5391 2. Allow quantification of (?>) groups, and make it work correctly.
5393 3. The first character computation wasn't working for (?>) groups.
5411 (?imsx-imsx:) non-capturing groups with option setting
5420 9. As in 5.005, unlimited repeated groups that could match an empty substring
