Lines Matching refs:substrings
569 return captured substrings. A description of the two matching algo-
575 convenience functions for extracting captured substrings from a subject
1490 matches, which are necessarily substrings of the first one, must obvi-
2327 subject and any substrings that were captured. This is known as the
2337 three captured substrings. A minimum of at least 1 pair is imposed by
2348 right size to hold all the substrings a pattern might capture. The sec-
2640 addition, further substrings from the subject may be picked out by
2645 other kinds of parenthesized subpattern that do not cause substrings to
2649 You can use auxiliary functions for accessing captured substrings by
2675 numbered pair that has been set. For example, if two substrings have
2691 zero. If captured substrings are not of interest, pcre2_match() may be
2917 Captured substrings can be accessed directly by using the ovector as
2919 extracting captured substrings as new, separate, zero-terminated
2924 The functions in this section identify substrings by number. The number
2926 ring to substrings captured by parenthesized groups. After a partial
2929 describes similar functions for extracting captured substrings by name.
3024 PCRE2_UNSET for unset substrings, or by calling pcre2_sub-
3328 If you want to get full details of all captured substrings for a given
3458 matches are all initial substrings of the longer matches. For example,
3474 which is the number of matched substrings. The offsets of the sub-
3480 Calls to the convenience functions that extract substrings by name
3482 after a DFA match. The convenience functions that extract substrings by
4367 substrings in the pattern. Note that whenever a recursion or subroutine
4380 inspected in order to extract substrings that have been matched so far,
4381 in the same way as extracting substrings after a match has completed.
4587 6. PCRE2 supports the \Q...\E escape for quoting substrings. Characters
5351 is not straightforward to keep track of captured substrings for the
5356 3. Because no substrings are captured, backreferences within the pat-
5397 rithm, by retaining partially matched substrings, it is more compli-
5649 matched substrings. The remaining four strings do not match the com-
6751 does not interfere with the setting of captured substrings. For exam-
7327 the captured substrings are "red king", "red", and "king", and are num-
7340 the captured substrings are "white queen" and "queen", and are numbered
7427 tured substrings by name.
7473 There are five capturing substrings, but only one is ever set after a
7751 matches an unlimited number of substrings that either consist of non-
7914 Within each branch of an assertion, locally captured substrings may be
7918 When a branch within an assertion fails to match, any substrings that
7921 branches fail to match; this means that no captured substrings are ever
7925 For a positive assertion, internally captured substrings in the suc-
7930 substrings are retained, because matching continues with the "no"
8359 substrings which can either be a sequence of non-parentheses, or a
9050 captured substrings and any (*MARK) name are discarded.
9054 substrings are retained in both cases.
9417 match_t for returning captured substrings. It also defines some con-
9591 string and any captured substrings are still given relative to the
9613 captured substrings, are returned via the pmatch argument, which points