Lines Matching defs:keys
5 #include "src/objects/keys.h"
105 OrderedHashSet::ConvertToKeysArray(isolate(), keys(), convert);
118 Handle<OrderedHashSet> KeyAccumulator::keys() {
148 OrderedHashSet::Add(isolate(), keys(), key);
184 Handle<FixedArray> keys,
189 return keys;
193 for (int i = 0; i < keys->length(); ++i) {
194 Handle<Name> key(Name::cast(keys->get(i)), isolate);
213 keys->set(store_position, *key);
217 return FixedArray::ShrinkOrEmpty(isolate, keys, store_position);
222 Handle<FixedArray> keys) {
226 isolate_, keys,
227 FilterProxyKeys(this, proxy, keys, filter_, skip_indices_),
231 // As of 10.5.11.9 says, the keys collected from Proxy should not contain
232 // any duplicates. And the order of the keys is preserved by the
234 RETURN_NOTHING_IF_NOT_SUCCESSFUL(AddKeys(keys, CONVERT_TO_ARRAY_INDEX));
255 // shadowing keys.
269 // case on API objects for OWN_ONLY keys handled in CollectOwnKeys.
325 // Directly go for the fast path for OWN_ONLY keys.
327 // Fully walk the prototype chain and find the last prototype with keys.
374 Handle<FixedArray> keys(
375 map->instance_descriptors(isolate).enum_cache().keys(), isolate);
382 DCHECK_LE(enum_length, keys->length());
385 return ReduceFixedArrayTo(isolate, keys, enum_length);
393 if (enum_length <= keys->length()) {
396 return ReduceFixedArrayTo(isolate, keys, enum_length);
403 // Create the keys array.
406 keys = isolate->factory()->NewFixedArray(enum_length);
413 keys->set(index, key);
417 DCHECK_EQ(index, keys->length());
439 DescriptorArray::InitializeOrChangeEnumCache(descriptors, isolate, keys,
443 return keys;
451 Handle<FixedArray> keys;
454 keys = GetFastEnumPropertyKeys(isolate, object);
457 keys = KeyAccumulator::GetOwnEnumPropertyKeys(isolate, object);
462 result = keys;
465 accessor->PrependElementIndices(object, keys, convert, ONLY_ENUMERABLE);
470 keys->length(), result.ToHandleChecked()->length() - keys->length());
485 Handle<FixedArray> keys;
486 if (GetKeysFast(keys_conversion).ToHandle(&keys)) {
487 return keys;
506 // From this point on we are certain to only collect own keys.
517 Handle<FixedArray> keys;
519 if (GetOwnKeysWithUninitializedEnumCache().ToHandle(&keys)) {
522 keys->length());
526 return keys;
551 // We have no elements but possibly enumerable property keys, hence we can
553 Handle<FixedArray> keys = GetFastEnumPropertyKeys(isolate_, object);
554 if (is_for_in_) return keys;
556 return isolate_->factory()->CopyFixedArray(keys);
757 Handle<JSObject> object, KeyAccumulator* keys,
761 PropertyFilter filter = keys->filter();
762 KeyCollectionMode mode = keys->mode();
787 if (key.FilterKey(keys->filter())) continue;
791 keys->AddShadowingKey(key, &allow_gc);
794 if (keys->AddKey(key, DO_NOT_CONVERT) != ExceptionStatus::kSuccess) {
848 // Copies enumerable keys to preallocated fixed array.
905 // Collect the keys from |dictionary| into |keys|, in ascending chronological
909 KeyAccumulator* keys) {
910 Isolate* isolate = keys->isolate();
916 PropertyFilter filter = keys->filter();
918 DCHECK_NE(keys->filter(), ENUMERABLE_STRINGS);
930 keys->AddShadowingKey(key, &gc);
939 // TODO(emrich): consider storing keys instead of indices into the array
963 ExceptionStatus status = keys->AddKey(key, DO_NOT_CONVERT);
971 ExceptionStatus status = keys->AddKey(key, DO_NOT_CONVERT);
1053 // Add the property keys from the interceptor.
1360 Handle<FixedArray> keys;
1362 isolate_, keys,
1367 Maybe<bool> result = AddKeysFromJSProxy(proxy, keys);