Lines Matching defs:length
130 if (str2.length() > str1.length()) {
133 return str1.compare(0, str2.length(), str2) == 0;
140 if (str1.length() < str2.length()) {
143 return str1.substr(str1.length() - str2.length()) == str2;
154 while (i < a.length() && i < b.length()) {
166 if (a.length() == b.length())
169 if (a.length() < b.length())
183 if (a.length() != b.length())
189 if (a.length() != b.length())
240 const size_t last_char = input.length() - 1;
311 if (byte_size > input.length()) {
429 inline bool DoIsStringASCII(const Char* characters, size_t length) {
431 const Char* end = characters + length;
459 return DoIsStringASCII(str.data(), str.length());
463 return DoIsStringASCII(str.data(), str.length());
468 int32_t src_len = static_cast<int32_t>(str.length());
483 // through the buffers, one to file the length of lowercase_ascii, and one to
519 if (str.length() != ascii.length())
622 return input.find(find_this.data(), pos, find_this.length());
624 size_t MatchSize() { return find_this.length(); }
634 find_any_of_these.length());
641 // Runs in O(n) time in the length of |str|, and transforms the string without
666 const size_t replace_length = replace_with.length();
672 // If the find and replace strings are the same length, we can simply use
683 // Since the find and replace strings aren't the same length, a loop like the
689 // down in one pass while finding, and truncate the length at the end of the
699 size_t str_length = str->length();
702 // This operation lengthens the string; determine the new length by counting
777 size_t length = match - read_offset;
778 if (length) {
779 CharTraits::move(buffer + write_offset, buffer + read_offset, length);
780 write_offset += length;
781 read_offset += length;
941 sub_length += cur.length();
944 formatted.reserve(format_string.length() + sub_length);