| Index: src/objects.cc
|
| ===================================================================
|
| --- src/objects.cc (revision 8826)
|
| +++ src/objects.cc (working copy)
|
| @@ -9566,7 +9566,9 @@
|
| }
|
| ASSERT(storage->length() >= index);
|
| } else {
|
| - property_dictionary()->CopyKeysTo(storage, StringDictionary::UNSORTED);
|
| + property_dictionary()->CopyKeysTo(storage,
|
| + index,
|
| + StringDictionary::UNSORTED);
|
| }
|
| }
|
|
|
| @@ -10316,6 +10318,7 @@
|
|
|
| template void Dictionary<StringDictionaryShape, String*>::CopyKeysTo(
|
| FixedArray*,
|
| + int,
|
| Dictionary<StringDictionaryShape, String*>::SortMode);
|
|
|
| template int
|
| @@ -11414,11 +11417,11 @@
|
| template<typename Shape, typename Key>
|
| void Dictionary<Shape, Key>::CopyKeysTo(
|
| FixedArray* storage,
|
| + int index,
|
| typename Dictionary<Shape, Key>::SortMode sort_mode) {
|
| ASSERT(storage->length() >= NumberOfElementsFilterAttributes(
|
| static_cast<PropertyAttributes>(NONE)));
|
| int capacity = HashTable<Shape, Key>::Capacity();
|
| - int index = 0;
|
| for (int i = 0; i < capacity; i++) {
|
| Object* k = HashTable<Shape, Key>::KeyAt(i);
|
| if (HashTable<Shape, Key>::IsKey(k)) {
|
|
|