Searched refs:pattern_length (Results 1 – 6 of 6) sorted by relevance
89 int pattern_length = pattern_.length(); in StringSearch() local90 if (pattern_length < kBMMinPatternLength) { in StringSearch()91 if (pattern_length == 1) { in StringSearch()268 int pattern_length = pattern.length(); in LinearSearch() local271 int n = subject.length() - pattern_length; in LinearSearch()287 pattern_length - 1)) { in LinearSearch()305 int pattern_length = pattern.length(); in BoyerMooreSearch() local312 PatternChar last_char = pattern[pattern_length - 1]; in BoyerMooreSearch()315 while (index <= subject_length - pattern_length) { in BoyerMooreSearch()316 int j = pattern_length - 1; in BoyerMooreSearch()[all …]
2822 int pattern_length = pattern.length(); in FindStringIndices() local2829 index += pattern_length; in FindStringIndices()3359 int pattern_length = pat->length(); in StringMatch() local3360 if (pattern_length == 0) return start_index; in StringMatch()3363 if (start_index + pattern_length > subject_length) return -1; in StringMatch()3423 int pattern_length = pattern.length(); in StringMatchBackwards() local3424 ASSERT(pattern_length >= 1); in StringMatchBackwards()3425 ASSERT(idx + pattern_length <= subject.length()); in StringMatchBackwards()3428 for (int i = 0; i < pattern_length; i++) { in StringMatchBackwards()3440 while (j < pattern_length) { in StringMatchBackwards()[all …]
89 int pattern_length = pattern_.length(); in StringSearch() local90 if (pattern_length < kBMMinPatternLength) { in StringSearch()91 if (pattern_length == 1) { in StringSearch()276 int pattern_length = pattern.length(); in LinearSearch() local279 int n = subject.length() - pattern_length; in LinearSearch()295 pattern_length - 1)) { in LinearSearch()313 int pattern_length = pattern.length(); in BoyerMooreSearch() local320 PatternChar last_char = pattern[pattern_length - 1]; in BoyerMooreSearch()323 while (index <= subject_length - pattern_length) { in BoyerMooreSearch()324 int j = pattern_length - 1; in BoyerMooreSearch()[all …]
3775 int pattern_length = pattern.length(); in FindStringIndices() local3782 index += pattern_length; in FindStringIndices()4253 int pattern_length = pat->length(); in StringMatch() local4254 if (pattern_length == 0) return start_index; in StringMatch()4257 if (start_index + pattern_length > subject_length) return -1; in StringMatch()4317 int pattern_length = pattern.length(); in StringMatchBackwards() local4318 ASSERT(pattern_length >= 1); in StringMatchBackwards()4319 ASSERT(idx + pattern_length <= subject.length()); in StringMatchBackwards()4322 for (int i = 0; i < pattern_length; i++) { in StringMatchBackwards()4334 while (j < pattern_length) { in StringMatchBackwards()[all …]
32 #define OP_COMPARE_NODE_SUBSTRING(pattern, pattern_length, pattern_sum) \ argument33 std::string(1, '\x25') + pattern + pattern_length + pattern_sum
408 size_t pattern_length, in CompareNodeSubstring() argument411 pattern_length_(pattern_length), in CompareNodeSubstring()598 uint32 pattern_length = 0, pattern_sum = 0; in ParseNextSentence() local601 if (!ReadUint32(&pattern_length) || pattern_length == 0) in ParseNextSentence()606 hashed_pattern, pattern_length, pattern_sum)); in ParseNextSentence()