Lines Matching defs:length
21 Vector(T* data, size_t length, bool isForward)
22 : start_(data), length_(length), is_forward_(isForward) {
23 CHECK(length > 0 && data != nullptr);
30 // Returns the length of the vector, in characters.
31 size_t length() const { return length_; }
74 // Bad-char shift table stored in the state. It's length is the alphabet size.
75 // For patterns below this length, the skip length of Boyer-Moore is too short
95 if (pattern.length() >= kBMMaxShift) {
96 start_ = pattern.length() - kBMMaxShift;
99 size_t pattern_length = pattern_.length();
221 const size_t max_n = (subject.length() - pattern.length() + 1);
236 CHECK_LE(pos, subject.length());
237 CHECK_LE(subject.length() - pos, SIZE_MAX / sizeof(Char));
238 void_pos = MemrchrFill(subject.start() + pattern.length() - 1,
244 return subject.length();
249 pos = subject.forward() ? raw_pos : (subject.length() - raw_pos - 1);
257 return subject.length();
268 const size_t subj_len = subject.length();
269 const size_t max_n = (subject.length() - pattern.length() + 1);
275 pos = MemrchrFill(subject.start() + pattern.length() - 1,
296 CHECK_EQ(1, pattern_.length());
309 CHECK_GT(pattern_.length(), 1);
310 const size_t n = subject.length() - pattern_.length();
313 if (i == subject.length())
314 return subject.length();
318 for (size_t j = 1; j < pattern_.length(); j++) {
328 return subject.length();
339 const size_t subject_length = subject.length();
340 const size_t pattern_length = pattern_.length();
357 return subject.length();
382 return subject.length();
387 const size_t pattern_length = pattern_.length();
391 const size_t length = pattern_length - start;
400 shift_table[i] = length;
417 if (static_cast<size_t>(shift_table[suffix]) == length) {
426 if (static_cast<size_t>(shift_table[pattern_length]) == length) {
440 if (static_cast<size_t>(shift_table[i]) == length) {
458 const size_t subject_length = subject.length();
459 const size_t pattern_length = pattern_.length();
502 return subject.length();
507 const size_t pattern_length = pattern_.length();
518 // All patterns less than kBMMaxShift in length.
542 const size_t pattern_length = pattern_.length();
550 for (size_t i = index, n = subject.length() - pattern_length; i <= n; i++) {
554 if (i == subject.length())
555 return subject.length();
574 return subject.length();