Lines Matching full:there

23 When there is only one possible way in which a given subject string can match a
25 when there are multiple possibilities. For example, if the pattern
33 there are three possible answers. The standard algorithm finds only one of
44 There are two ways to search a tree: depth-first and breadth-first, and these
54 checking that the subject matches what is required. When there is a mismatch,
62 the algorithm stops. Thus, if there is more than one possible match, this
85 subject string only once, without backtracking, there is one exception: when a
89 The scan continues until either the end of the subject is reached, or there are
91 different matching possibilities (if there are none, the match has failed).
92 Thus, if there is more than one possible match, this algorithm finds all of
94 decreasing order of length. There is an option to stop the algorithm after the
109 pattern "a\ed+" is compiled as if it were "a\ed++" because there is no point
115 There are a number of features of PCRE2 regular expressions that are not