Lines Matching defs:pattern
639 CONVERT_ARG_CHECKED(String, pattern, 1);
641 Handle<Object> result = RegExpImpl::Compile(re, pattern, flags);
1238 Handle<String> pattern = args.at<String>(2);
1252 RegExpImpl::CreateRegExpLiteral(constructor, pattern, flags,
1645 // Number of distinct parts of the replacement pattern.
1683 // the replacement pattern, otherwise it's a value from PartType.
2081 static void BoyerMoorePopulateBadCharTable(Vector<const pchar> pattern,
2095 for (int i = start; i < pattern.length() - 1; i++) {
2096 pchar c = pattern[i];
2103 static void BoyerMoorePopulateGoodSuffixTable(Vector<const pchar> pattern,
2105 int m = pattern.length();
2112 pchar last_char = pattern[m - 1];
2115 for (pchar c = pattern[i - 1]; suffix <= m && c != pattern[suffix - 1];) {
2126 while (i > start && pattern[i - 1] != last_char) {
2171 Vector<const pchar> pattern,
2175 int m = pattern.length();
2176 // Only preprocess at most kBMMaxShift last characters of pattern.
2179 BoyerMoorePopulateBadCharTable(pattern, start);
2183 pchar last_char = pattern[m - 1];
2200 while (j >= 0 && pattern[j] == (subject[idx + j])) j--;
2224 Vector<const pchar> pattern,
2227 int m = pattern.length();
2228 // Only preprocess at most kBMMaxShift last characters of pattern.
2232 BoyerMoorePopulateGoodSuffixTable(pattern, start);
2233 pchar last_char = pattern[m - 1];
2245 while (j >= 0 && pattern[j] == (c = subject[idx + j])) j--;
2297 // further checking should start, i.e., it's guaranteed that the pattern
2301 Vector<const pchar> pattern,
2307 int badness = -10 - (pattern.length() << 2);
2308 // We know our pattern is at least 2 characters, we cache the first so
2310 pchar pattern_first_char = pattern[0];
2312 for (int i = idx, n = subject.length() - pattern.length(); i <= n; i++) {
2321 if (pattern[j] != subject[i+j]) {
2325 } while (j < pattern.length());
2326 if (j == pattern.length()) {
2339 Vector<const pchar> pattern,
2341 pchar pattern_first_char = pattern[0];
2342 for (int i = idx, n = subject.length() - pattern.length(); i <= n; i++) {
2346 if (pattern[j] != subject[i+j]) {
2350 } while (j < pattern.length());
2351 if (j == pattern.length()) {
2379 // The max shift of Boyer-Moore on a pattern of this length does
2392 // Perform string match of pattern on subject, starting at start index.
