Lines Matching refs:algorithm
1338 ject string. The "standard" algorithm is the one provided by the
1345 An alternative algorithm is provided by the pcre_dfa_exec(),
1348 tages and disadvantages compared with the standard algorithm, and these
1362 there are three possible answers. The standard algorithm finds only one
1363 of them, whereas the alternative algorithm finds all three.
1380 sions", the standard algorithm is an "NFA algorithm". It conducts a
1383 required. When there is a mismatch, the algorithm tries any alterna-
1392 that point the algorithm stops. Thus, if there is more than one possi-
1393 ble match, this algorithm returns the first one that it finds. Whether
1399 tively straightforward for this algorithm to keep track of the sub-
1406 This algorithm conducts a breadth-first search of the tree. Starting
1410 matches. In Friedl's terminology, this is a kind of "DFA algorithm",
1414 Although the general principle of this matching algorithm is that it
1424 this algorithm finds all of them, and in particular, it finds the long-
1426 an option to stop the algorithm after the first match (which is neces-
1436 at the fifth character of the subject. The algorithm does not automati-
1440 supported by the alternative matching algorithm. They are as follows:
1442 1. Because the algorithm finds all possible matches, the greedy or
1459 algorithm does not attempt to do this. This means that no captured sub-
1477 7. The \C escape sequence, which (in the standard algorithm) always
1479 not supported in these modes, because the alternative algorithm moves
1490 Using the alternative matching algorithm provides the following advan-
1495 more than one match using the standard algorithm, you have to do kludgy
1498 2. Because the alternative algorithm scans the subject string just
1502 possible to do multi-segment matching using the standard algorithm by
1510 The alternative algorithm suffers from a number of disadvantages:
1512 1. It is substantially slower than the standard algorithm. This is
1519 performance advantage that it does for the standard algorithm.
1719 ble, is also provided. This uses a different algorithm for the match-
1720 ing. The alternative algorithm finds all possible matches (at a given
1722 are lookbehind assertions). However, this algorithm does not return
3875 The traditional matching function uses a similar algorithm to Perl,
3924 against a compiled pattern, using a matching algorithm that scans the
3926 characteristics to the normal algorithm, and is not compatible with
3992 Setting the PCRE_DFA_SHORTEST option causes the matching algorithm to
3994 tive algorithm works, this is necessarily the shortest possible match
4560 pcre[16|32_dfa_exec(), which match using a different algorithm that is
6881 the traditional matching functions, which use a backtracking algorithm.
