Lines Matching defs:length
37 DCHECK_NE(cons->second().length(), 0);
41 while (cons->first().length() == 0) {
54 int length = cons->length();
63 ->NewRawOneByteString(length, allocation)
66 WriteToFlat(*cons, flat->GetChars(no_gc), 0, length);
71 ->NewRawTwoByteString(length, allocation)
74 WriteToFlat(*cons, flat->GetChars(no_gc), 0, length);
104 int length = flat->length();
107 isolate->factory()->NewRawSharedOneByteString(length).ToHandleChecked();
109 WriteToFlat(*flat, copy->GetChars(no_gc), 0, length);
113 isolate->factory()->NewRawSharedTwoByteString(length).ToHandleChecked();
115 WriteToFlat(*flat, copy->GetChars(no_gc), 0, length);
377 DCHECK(static_cast<size_t>(this->length()) == resource->length());
378 base::ScopedVector<base::uc16> smart_chars(this->length());
379 String::WriteToFlat(*this, smart_chars.begin(), 0, this->length());
381 resource->length() * sizeof(smart_chars[0])));
456 DCHECK(static_cast<size_t>(this->length()) == resource->length());
458 base::ScopedVector<uint16_t> smart_chars(this->length());
459 String::WriteToFlat(*this, smart_chars.begin(), 0, this->length());
460 DCHECK(String::IsOneByte(smart_chars.begin(), this->length()));
462 base::ScopedVector<char> smart_chars(this->length());
463 String::WriteToFlat(*this, smart_chars.begin(), 0, this->length());
465 resource->length() * sizeof(smart_chars[0])));
601 const int len = length();
618 if (end < 0) end = length();
626 if (end < 0) end = length();
702 int len = subject->length();
782 length(), access_guard)
788 int offset, int length,
793 // Negative length means the to the end of the string.
794 if (length < 0) length = kMaxInt - offset;
801 while (stream.HasMore() && character_position++ < offset + length) {
818 while (stream.HasMore() && character_position++ < offset + length) {
839 void String::WriteToFlat(String source, sinkchar* sink, int start, int length) {
841 return WriteToFlat(source, sink, start, length, GetPtrComprCageBase(source),
847 void String::WriteToFlat(String source, sinkchar* sink, int start, int length,
851 if (length == 0) return;
853 DCHECK_LT(0, length);
855 DCHECK_LE(length, source.length());
861 length);
867 length);
873 length);
879 length);
885 int boundary = first.length();
887 int second_length = start + length - boundary;
899 length -= first_length;
923 length -= second_length;
927 if (length == 0) return;
952 const int src_len = src.length();
975 // length of (unpacked) code.
976 int line_count_estimate = src->length() >> 4;
1018 int len = length();
1019 if (len != other.length()) return false;
1078 const int one_length = one->length();
1079 if (one_length != two->length()) return false;
1147 } else if (y->length() == 0) {
1148 return x->length() == 0 ? ComparisonResult::kEqual
1150 } else if (x->length() == 0) {
1167 int prefix_length = x->length();
1168 if (y->length() < prefix_length) {
1169 prefix_length = y->length();
1171 } else if (y->length() > prefix_length) {
1208 uint32_t length_value = static_cast<uint32_t>(str.length());
1257 DCHECK(start_index <= receiver->length());
1259 uint32_t search_length = search->length();
1262 uint32_t receiver_length = receiver->length();
1291 const int replacement_length = replacement->length();
1449 int pattern_length = pattern.length();
1451 DCHECK(idx + pattern_length <= subject.length());
1503 start_index = receiver_string->length();
1510 uint32_t pattern_length = search_string->length();
1511 uint32_t receiver_length = receiver_string->length();
1591 uint32_t HashString(String string, size_t start, int length, uint64_t seed,
1596 if (length > String::kMaxHashCalcLength) {
1597 return StringHasher::GetTrivialHash(length);
1606 buffer.reset(new Char[length]);
1607 String::WriteToFlat(string, buffer.get(), 0, length, cage_base,
1614 return StringHasher::HashSequentialString<Char>(chars, length, seed);
1653 if (length() == string.length()) {
1660 ? HashString<uint8_t>(string, start, length(), seed, cage_base,
1662 : HashString<uint16_t>(string, start, length(), seed, cage_base,
1675 int length = this->length();
1676 if (length <= kMaxCachedArrayIndexLength) {
1683 if (length == 0 || length > kMaxArrayIndexSize) return false;
1690 int length = this->length();
1691 if (length <= kMaxCachedArrayIndexLength) {
1698 if (length == 0 || length > kMaxIntegerIndexSize) return false;
1705 int length = this->length();
1706 for (int i = 0; i < length; i++) {
1712 int length = this->length();
1713 for (int i = 0; i < length; i++) {
1722 int old_length = string->length();
1747 // We are storing the new length using release store after creating a filler
1755 int data_size = SeqString::kHeaderSize + length() * kOneByteSize;
1757 SizeFor(length()) - data_size);
1761 int data_size = SeqString::kHeaderSize + length() * base::kUC16Size;
1763 SizeFor(length()) - data_size);
1769 DCHECK(index >= 0 && index < this->length());
1772 if (second(cage_base).length() == 0) {
1783 if (left.length() > index) {
1786 index -= left.length();
1811 return length() * length_multiplier;
1815 : Relocatable(isolate), str_(str), length_(str->length()) {
1875 int length = string.length();
1877 if (consumed < offset + length) {
1891 offset += length;
1901 length = string.length();
1904 if (length == 0) {
1914 DCHECK_NE(length, 0);
1916 consumed_ = offset + length;
1942 int length = string.length();
1944 if (length == 0) continue;
1945 consumed_ += length;
1957 int length = string.length();
1958 if (length == 0) break; // Skip empty left-hand sides of ConsStrings.
1959 consumed_ += length;
1988 CHECK_LE(start_index, subject.length());