Lines Matching full:there
12 from the original man page. If there is any nonsense in it, please consult the
44 When there is only one possible way in which a given subject string can match a
46 when there are multiple possibilities. For example, if the pattern
54 there are three possible answers. The standard algorithm finds only one of
63 There are two ways to search a tree: depth-first and breadth-first, and these
72 there is a mismatch, the algorithm tries any alternatives at the current point,
81 the algorithm stops. Thus, if there is more than one possible match, this
104 subject string only once, without backtracking, there is one exception: when a
109 The scan continues until either the end of the subject is reached, or there are
111 different matching possibilities (if there are none, the match has failed).
112 Thus, if there is more than one possible match, this algorithm finds all of
114 decreasing order of length. There is an option to stop the algorithm after the
131 pattern "a\d+" is compiled as if it were "a\d++" because there is no point
138 There are a number of features of PCRE regular expressions that are not
