Lines Matching refs:search
133 has a very large search tree against a string that will never match.
951 will search for a C++ compiler and C++ header files. If it finds them,
1406 thought of as a search of the tree. There are two ways to search a
1415 depth-first search of the pattern tree. That is, it proceeds along a
1440 This algorithm conducts a breadth-first search of the tree. Starting
1556 partly because it has to search for all possible matches, but is also
2352 a full unoptimized search and run all the callouts, but it is mainly
3141 search trees. The classic example is a pattern that uses nested unlim-
3464 zero, the search for a match starts at the beginning of the subject,
6741 again the search for "a" covers the entire string, from right to left,
8890 without continuing to search for possible complete matches. This option
8949 Because the DFA functions always search for all possible matches, and
9948 Example: simple search for a string: