Lines Matching defs:length
162 int length = std::min(kMaxLookaheadForBoyerMoore, pattern->length());
163 if (length <= kPatternTooShortForBoyerMoore) return false;
168 for (int i = 0; i < length; i++) {
175 if (different * 3 > length) return false;
358 DCHECK_LE(index, subject->length());
364 int needle_len = needle.length();
368 if (index + needle_len > subject->length()) {
661 DCHECK_LE(index, subject->length());
745 // subject string length is equal or greater than the given heuristic value.
747 subject->length() >= JSRegExp::kTierUpForSubjectLengthValue) {
780 if (output_registers[0] >= subject->length()) {
852 if (pattern->length() > RegExp::kRegExpTooLargeToOptimize) return true;
892 int half_way = (sample_subject->length() - kSampleSize) / 2;
894 i < sample_subject->length() && chars_sampled < kSampleSize;
1026 bytecode->length(), pattern_cstring.get());
1127 last_index + 1 < subject_->length() &&
1170 // Zero-length match. Advance by one code point.
1173 if (last_end_index > subject_->length()) {
1290 if (type == STRING_SPLIT_SUBSTRINGS && value_array->length() < 100) {
1291 for (int i = 0; i < value_array->length(); i++) {