7987 template<typename Shape, typename Key>
7988 void Dictionary<Shape, Key>::Print(FILE* out) {  in Print()
7989   int capacity = HashTable<Shape, Key>::Capacity();  in Print()
7991     Object* k = HashTable<Shape, Key>::KeyAt(i);  in Print()
7992     if (HashTable<Shape, Key>::IsKey(k)) {  in Print()
8008 template<typename Shape, typename Key>
8009 void Dictionary<Shape, Key>::CopyValuesTo(FixedArray* elements) {  in CopyValuesTo()
8011   int capacity = HashTable<Shape, Key>::Capacity();  in CopyValuesTo()
8015     Object* k =  Dictionary<Shape, Key>::KeyAt(i);  in CopyValuesTo()
8016     if (Dictionary<Shape, Key>::IsKey(k)) {  in CopyValuesTo()
8750 template<typename Shape, typename Key>
8751 void HashTable<Shape, Key>::IteratePrefix(ObjectVisitor* v) {  in IteratePrefix()
8756 template<typename Shape, typename Key>
8757 void HashTable<Shape, Key>::IterateElements(ObjectVisitor* v) {  in IterateElements()
8764 template<typename Shape, typename Key>
8765 MaybeObject* HashTable<Shape, Key>::Allocate(int at_least_space_for,  in Allocate()
8827 template<typename Shape, typename Key>
8828 MaybeObject* HashTable<Shape, Key>::EnsureCapacity(int n, Key key) {  in EnsureCapacity()
8855        i < kPrefixStartIndex + Shape::kPrefixSize;  in EnsureCapacity()
8864       uint32_t hash = Shape::HashForObject(key, k);  in EnsureCapacity()
8867       for (int j = 0; j < Shape::kEntrySize; j++) {  in EnsureCapacity()
8878 template<typename Shape, typename Key>
8879 uint32_t HashTable<Shape, Key>::FindInsertionEntry(uint32_t hash) {  in FindInsertionEntry()
9671 template<typename Shape, typename Key>
9672 MaybeObject* Dictionary<Shape, Key>::Allocate(int at_least_space_for) {  in Allocate()
9675         HashTable<Shape, Key>::Allocate(at_least_space_for);  in Allocate()
9679   Dictionary<Shape, Key>::cast(obj)->  in Allocate()
9685 template<typename Shape, typename Key>
9686 MaybeObject* Dictionary<Shape, Key>::GenerateNewEnumerationIndices() {  in GenerateNewEnumerationIndices()
9687   Heap* heap = Dictionary<Shape, Key>::GetHeap();  in GenerateNewEnumerationIndices()
9688   int length = HashTable<Shape, Key>::NumberOfElements();  in GenerateNewEnumerationIndices()
9707   int capacity = HashTable<Shape, Key>::Capacity();  in GenerateNewEnumerationIndices()
9710     if (Dictionary<Shape, Key>::IsKey(Dictionary<Shape, Key>::KeyAt(i))) {  in GenerateNewEnumerationIndices()
9726   capacity = HashTable<Shape, Key>::Capacity();  in GenerateNewEnumerationIndices()
9729     if (Dictionary<Shape, Key>::IsKey(Dictionary<Shape, Key>::KeyAt(i))) {  in GenerateNewEnumerationIndices()
9743 template<typename Shape, typename Key>
9744 MaybeObject* Dictionary<Shape, Key>::EnsureCapacity(int n, Key key) {  in EnsureCapacity()
9746   if (Shape::kIsEnumerable &&  in EnsureCapacity()
9754   return HashTable<Shape, Key>::EnsureCapacity(n, key);  in EnsureCapacity()
9782 template<typename Shape, typename Key>
9783 Object* Dictionary<Shape, Key>::DeleteProperty(int entry,  in DeleteProperty()
9785   Heap* heap = Dictionary<Shape, Key>::GetHeap();  in DeleteProperty()
9792   HashTable<Shape, Key>::ElementRemoved();  in DeleteProperty()
9797 template<typename Shape, typename Key>
9798 MaybeObject* Dictionary<Shape, Key>::AtPut(Key key, Object* value) {  in AtPut()
9802   if (entry != Dictionary<Shape, Key>::kNotFound) {  in AtPut()
9814   { MaybeObject* maybe_k = Shape::AsObject(key);  in AtPut()
9818   return Dictionary<Shape, Key>::cast(obj)->  in AtPut()
9819       AddEntry(key, value, details, Shape::Hash(key));  in AtPut()
9823 template<typename Shape, typename Key>
9824 MaybeObject* Dictionary<Shape, Key>::Add(Key key,  in Add()
9828   SLOW_ASSERT((this->FindEntry(key) == Dictionary<Shape, Key>::kNotFound));  in Add()
9834   return Dictionary<Shape, Key>::cast(obj)->  in Add()
9835       AddEntry(key, value, details, Shape::Hash(key));  in Add()
9840 template<typename Shape, typename Key>
9841 MaybeObject* Dictionary<Shape, Key>::AddEntry(Key key,  in AddEntry()
9847   { MaybeObject* maybe_k = Shape::AsObject(key);  in AddEntry()
9851   uint32_t entry = Dictionary<Shape, Key>::FindInsertionEntry(hash);  in AddEntry()
9853   if (!details.IsDeleted() && details.index() == 0 && Shape::kIsEnumerable) {  in AddEntry()
9861   ASSERT((Dictionary<Shape, Key>::KeyAt(entry)->IsNumber()  in AddEntry()
9862           || Dictionary<Shape, Key>::KeyAt(entry)->IsString()));  in AddEntry()
9863   HashTable<Shape, Key>::ElementAdded();  in AddEntry()
9920 template<typename Shape, typename Key>
9921 int Dictionary<Shape, Key>::NumberOfElementsFilterAttributes(  in NumberOfElementsFilterAttributes()
9923   int capacity = HashTable<Shape, Key>::Capacity();  in NumberOfElementsFilterAttributes()
9926     Object* k = HashTable<Shape, Key>::KeyAt(i);  in NumberOfElementsFilterAttributes()
9927     if (HashTable<Shape, Key>::IsKey(k)) {  in NumberOfElementsFilterAttributes()
9938 template<typename Shape, typename Key>
9939 int Dictionary<Shape, Key>::NumberOfEnumElements() {  in NumberOfEnumElements()
9945 template<typename Shape, typename Key>
9946 void Dictionary<Shape, Key>::CopyKeysTo(FixedArray* storage,  in CopyKeysTo()
9949   int capacity = HashTable<Shape, Key>::Capacity();  in CopyKeysTo()
9952      Object* k = HashTable<Shape, Key>::KeyAt(i);  in CopyKeysTo()
9953      if (HashTable<Shape, Key>::IsKey(k)) {  in CopyKeysTo()
9985 template<typename Shape, typename Key>
9986 void Dictionary<Shape, Key>::CopyKeysTo(  in CopyKeysTo()
9990   int capacity = HashTable<Shape, Key>::Capacity();  in CopyKeysTo()
9992     Object* k = HashTable<Shape, Key>::KeyAt(i);  in CopyKeysTo()
9993     if (HashTable<Shape, Key>::IsKey(k)) {  in CopyKeysTo()
10004 template<typename Shape, typename Key>
10005 Object* Dictionary<Shape, Key>::SlowReverseLookup(Object* value) {  in SlowReverseLookup()
10006   int capacity = HashTable<Shape, Key>::Capacity();  in SlowReverseLookup()
10008     Object* k =  HashTable<Shape, Key>::KeyAt(i);  in SlowReverseLookup()
10009     if (Dictionary<Shape, Key>::IsKey(k)) {  in SlowReverseLookup()
10017   Heap* heap = Dictionary<Shape, Key>::GetHeap();  in SlowReverseLookup()