9950 template<typename Shape, typename Key>
9951 void Dictionary<Shape, Key>::Print(FILE* out) {  in Print()
9952   int capacity = HashTable<Shape, Key>::Capacity();  in Print()
9954     Object* k = HashTable<Shape, Key>::KeyAt(i);  in Print()
9955     if (HashTable<Shape, Key>::IsKey(k)) {  in Print()
9971 template<typename Shape, typename Key>
9972 void Dictionary<Shape, Key>::CopyValuesTo(FixedArray* elements) {  in CopyValuesTo()
9974   int capacity = HashTable<Shape, Key>::Capacity();  in CopyValuesTo()
9978     Object* k =  Dictionary<Shape, Key>::KeyAt(i);  in CopyValuesTo()
9979     if (Dictionary<Shape, Key>::IsKey(k)) {  in CopyValuesTo()
10853 template<typename Shape, typename Key>
10854 void HashTable<Shape, Key>::IteratePrefix(ObjectVisitor* v) {  in IteratePrefix()
10859 template<typename Shape, typename Key>
10860 void HashTable<Shape, Key>::IterateElements(ObjectVisitor* v) {  in IterateElements()
10867 template<typename Shape, typename Key>
10868 MaybeObject* HashTable<Shape, Key>::Allocate(int at_least_space_for,  in Allocate()
10952 template<typename Shape, typename Key>
10953 MaybeObject* HashTable<Shape, Key>::Rehash(HashTable* new_table, Key key) {  in Rehash()
10961        i < kPrefixStartIndex + Shape::kPrefixSize;  in Rehash()
10972       uint32_t hash = HashTable<Shape, Key>::HashForObject(key, k);  in Rehash()
10975       for (int j = 0; j < Shape::kEntrySize; j++) {  in Rehash()
10986 template<typename Shape, typename Key>
10987 MaybeObject* HashTable<Shape, Key>::EnsureCapacity(int n, Key key) {  in EnsureCapacity()
11012 template<typename Shape, typename Key>
11013 MaybeObject* HashTable<Shape, Key>::Shrink(Key key) {  in Shrink()
11041 template<typename Shape, typename Key>
11042 uint32_t HashTable<Shape, Key>::FindInsertionEntry(uint32_t hash) {  in FindInsertionEntry()
11950 template<typename Shape, typename Key>
11951 MaybeObject* Dictionary<Shape, Key>::Allocate(int at_least_space_for) {  in Allocate()
11954         HashTable<Shape, Key>::Allocate(at_least_space_for);  in Allocate()
11958   Dictionary<Shape, Key>::cast(obj)->  in Allocate()
11964 template<typename Shape, typename Key>
11965 MaybeObject* Dictionary<Shape, Key>::GenerateNewEnumerationIndices() {  in GenerateNewEnumerationIndices()
11966   Heap* heap = Dictionary<Shape, Key>::GetHeap();  in GenerateNewEnumerationIndices()
11967   int length = HashTable<Shape, Key>::NumberOfElements();  in GenerateNewEnumerationIndices()
11986   int capacity = HashTable<Shape, Key>::Capacity();  in GenerateNewEnumerationIndices()
11989     if (Dictionary<Shape, Key>::IsKey(Dictionary<Shape, Key>::KeyAt(i))) {  in GenerateNewEnumerationIndices()
12005   capacity = HashTable<Shape, Key>::Capacity();  in GenerateNewEnumerationIndices()
12008     if (Dictionary<Shape, Key>::IsKey(Dictionary<Shape, Key>::KeyAt(i))) {  in GenerateNewEnumerationIndices()
12022 template<typename Shape, typename Key>
12023 MaybeObject* Dictionary<Shape, Key>::EnsureCapacity(int n, Key key) {  in EnsureCapacity()
12025   if (Shape::kIsEnumerable &&  in EnsureCapacity()
12033   return HashTable<Shape, Key>::EnsureCapacity(n, key);  in EnsureCapacity()
12037 template<typename Shape, typename Key>
12038 Object* Dictionary<Shape, Key>::DeleteProperty(int entry,  in DeleteProperty()
12040   Heap* heap = Dictionary<Shape, Key>::GetHeap();  in DeleteProperty()
12047   HashTable<Shape, Key>::ElementRemoved();  in DeleteProperty()
12052 template<typename Shape, typename Key>
12053 MaybeObject* Dictionary<Shape, Key>::Shrink(Key key) {  in Shrink()
12054   return HashTable<Shape, Key>::Shrink(key);  in Shrink()
12058 template<typename Shape, typename Key>
12059 MaybeObject* Dictionary<Shape, Key>::AtPut(Key key, Object* value) {  in AtPut()
12063   if (entry != Dictionary<Shape, Key>::kNotFound) {  in AtPut()
12075   { MaybeObject* maybe_k = Shape::AsObject(key);  in AtPut()
12080   return Dictionary<Shape, Key>::cast(obj)->AddEntry(key, value, details,  in AtPut()
12081       Dictionary<Shape, Key>::Hash(key));  in AtPut()
12085 template<typename Shape, typename Key>
12086 MaybeObject* Dictionary<Shape, Key>::Add(Key key,  in Add()
12090   SLOW_ASSERT((this->FindEntry(key) == Dictionary<Shape, Key>::kNotFound));  in Add()
12097   return Dictionary<Shape, Key>::cast(obj)->AddEntry(key, value, details,  in Add()
12098       Dictionary<Shape, Key>::Hash(key));  in Add()
12103 template<typename Shape, typename Key>
12104 MaybeObject* Dictionary<Shape, Key>::AddEntry(Key key,  in AddEntry()
12110   { MaybeObject* maybe_k = Shape::AsObject(key);  in AddEntry()
12114   uint32_t entry = Dictionary<Shape, Key>::FindInsertionEntry(hash);  in AddEntry()
12116   if (!details.IsDeleted() && details.index() == 0 && Shape::kIsEnumerable) {  in AddEntry()
12124   ASSERT((Dictionary<Shape, Key>::KeyAt(entry)->IsNumber()  in AddEntry()
12125           || Dictionary<Shape, Key>::KeyAt(entry)->IsString()));  in AddEntry()
12126   HashTable<Shape, Key>::ElementAdded();  in AddEntry()
12229 template<typename Shape, typename Key>
12230 int Dictionary<Shape, Key>::NumberOfElementsFilterAttributes(  in NumberOfElementsFilterAttributes()
12232   int capacity = HashTable<Shape, Key>::Capacity();  in NumberOfElementsFilterAttributes()
12235     Object* k = HashTable<Shape, Key>::KeyAt(i);  in NumberOfElementsFilterAttributes()
12236     if (HashTable<Shape, Key>::IsKey(k)) {  in NumberOfElementsFilterAttributes()
12247 template<typename Shape, typename Key>
12248 int Dictionary<Shape, Key>::NumberOfEnumElements() {  in NumberOfEnumElements()
12254 template<typename Shape, typename Key>
12255 void Dictionary<Shape, Key>::CopyKeysTo(  in CopyKeysTo()
12258     typename Dictionary<Shape, Key>::SortMode sort_mode) {  in CopyKeysTo()  argument
12260   int capacity = HashTable<Shape, Key>::Capacity();  in CopyKeysTo()
12263      Object* k = HashTable<Shape, Key>::KeyAt(i);  in CopyKeysTo()
12264      if (HashTable<Shape, Key>::IsKey(k)) {  in CopyKeysTo()
12271   if (sort_mode == Dictionary<Shape, Key>::SORTED) {  in CopyKeysTo()
12298 template<typename Shape, typename Key>
12299 void Dictionary<Shape, Key>::CopyKeysTo(  in CopyKeysTo()
12302     typename Dictionary<Shape, Key>::SortMode sort_mode) {  in CopyKeysTo()  argument
12305   int capacity = HashTable<Shape, Key>::Capacity();  in CopyKeysTo()
12307     Object* k = HashTable<Shape, Key>::KeyAt(i);  in CopyKeysTo()
12308     if (HashTable<Shape, Key>::IsKey(k)) {  in CopyKeysTo()
12314   if (sort_mode == Dictionary<Shape, Key>::SORTED) {  in CopyKeysTo()
12322 template<typename Shape, typename Key>
12323 Object* Dictionary<Shape, Key>::SlowReverseLookup(Object* value) {  in SlowReverseLookup()
12324   int capacity = HashTable<Shape, Key>::Capacity();  in SlowReverseLookup()
12326     Object* k =  HashTable<Shape, Key>::KeyAt(i);  in SlowReverseLookup()
12327     if (Dictionary<Shape, Key>::IsKey(k)) {  in SlowReverseLookup()
12335   Heap* heap = Dictionary<Shape, Key>::GetHeap();  in SlowReverseLookup()