Lines Matching defs:length
42 int len = array->length();
65 int prototype_chain_keys_length = prototype_chain_keys->length();
73 int own_keys_length = own_keys.is_null() ? 0 : own_keys->length();
167 int add_length = array->length();
193 for (int i = 0; i < keys->length(); ++i) {
363 Handle<FixedArray> array, int length) {
364 DCHECK_LE(length, array->length());
365 if (array->length() == length) return array;
366 return isolate->factory()->CopyFixedArrayUpTo(array, length);
377 // Check if the {map} has a valid enum length, which implies that it
382 DCHECK_LE(enum_length, keys->length());
393 if (enum_length <= keys->length()) {
417 DCHECK_EQ(index, keys->length());
436 DCHECK_EQ(index, indices->length());
470 keys->length(), result.ToHandleChecked()->length() - keys->length());
522 keys->length());
618 return isolate_->factory()->CopyFixedArrayUpTo(result, result->length());
664 size_t length = accessor->GetCapacity(*result, result->elements());
665 for (InternalIndex entry : InternalIndex::Range(length)) {
808 int length = storage->length();
842 if (mode == KeyCollectionMode::kOwnOnly && properties == length) break;
845 CHECK_EQ(length, properties);
860 int length = storage->length();
869 std::sort(start, start + length, cmp);
870 for (int i = 0; i < length; i++) {
899 int length = dictionary->NumberOfEnumerableProperties();
900 Handle<FixedArray> storage = isolate->factory()->NewFixedArray(length);
986 // If the number of properties equals the length of enumerable properties
990 if (enum_keys->length() != nof_descriptors) {
1016 for (int i = 0, n = enum_keys->length(); i < n; ++i) {
1251 for (int i = 0; i < trap_result->length(); ++i) {
1279 isolate_->factory()->NewFixedArray(target_keys->length());
1282 for (int i = 0; i < target_keys->length(); ++i) {
1330 for (int i = 0; i < target_configurable_keys->length(); ++i) {