Lines Matching refs:Dictionary
9951 void Dictionary<Shape, Key>::Print(FILE* out) { in Print()
9972 void Dictionary<Shape, Key>::CopyValuesTo(FixedArray* elements) { in CopyValuesTo()
9978 Object* k = Dictionary<Shape, Key>::KeyAt(i); in CopyValuesTo()
9979 if (Dictionary<Shape, Key>::IsKey(k)) { in CopyValuesTo()
11068 template class Dictionary<StringDictionaryShape, String*>; variable
11070 template class Dictionary<SeededNumberDictionaryShape, uint32_t>; variable
11072 template class Dictionary<UnseededNumberDictionaryShape, uint32_t>; variable
11074 template MaybeObject* Dictionary<SeededNumberDictionaryShape, uint32_t>::
11077 template MaybeObject* Dictionary<UnseededNumberDictionaryShape, uint32_t>::
11080 template MaybeObject* Dictionary<StringDictionaryShape, String*>::Allocate(
11083 template MaybeObject* Dictionary<SeededNumberDictionaryShape, uint32_t>::AtPut(
11086 template MaybeObject* Dictionary<UnseededNumberDictionaryShape, uint32_t>::
11089 template Object* Dictionary<SeededNumberDictionaryShape, uint32_t>::
11092 template Object* Dictionary<UnseededNumberDictionaryShape, uint32_t>::
11095 template Object* Dictionary<StringDictionaryShape, String*>::SlowReverseLookup(
11098 template void Dictionary<SeededNumberDictionaryShape, uint32_t>::CopyKeysTo(
11101 Dictionary<SeededNumberDictionaryShape, uint32_t>::SortMode);
11103 template Object* Dictionary<StringDictionaryShape, String*>::DeleteProperty(
11106 template Object* Dictionary<SeededNumberDictionaryShape, uint32_t>::
11109 template MaybeObject* Dictionary<StringDictionaryShape, String*>::Shrink(
11112 template MaybeObject* Dictionary<SeededNumberDictionaryShape, uint32_t>::Shrink(
11115 template void Dictionary<StringDictionaryShape, String*>::CopyKeysTo(
11118 Dictionary<StringDictionaryShape, String*>::SortMode);
11121 Dictionary<StringDictionaryShape, String*>::NumberOfElementsFilterAttributes(
11124 template MaybeObject* Dictionary<StringDictionaryShape, String*>::Add(
11128 Dictionary<StringDictionaryShape, String*>::GenerateNewEnumerationIndices();
11131 Dictionary<SeededNumberDictionaryShape, uint32_t>::
11134 template MaybeObject* Dictionary<SeededNumberDictionaryShape, uint32_t>::Add(
11137 template MaybeObject* Dictionary<UnseededNumberDictionaryShape, uint32_t>::Add(
11140 template MaybeObject* Dictionary<SeededNumberDictionaryShape, uint32_t>::
11143 template MaybeObject* Dictionary<UnseededNumberDictionaryShape, uint32_t>::
11146 template MaybeObject* Dictionary<StringDictionaryShape, String*>::
11149 template MaybeObject* Dictionary<SeededNumberDictionaryShape, uint32_t>::
11152 template MaybeObject* Dictionary<UnseededNumberDictionaryShape, uint32_t>::
11155 template MaybeObject* Dictionary<StringDictionaryShape, String*>::AddEntry(
11159 int Dictionary<SeededNumberDictionaryShape, uint32_t>::NumberOfEnumElements();
11162 int Dictionary<StringDictionaryShape, String*>::NumberOfEnumElements();
11951 MaybeObject* Dictionary<Shape, Key>::Allocate(int at_least_space_for) { in Allocate()
11958 Dictionary<Shape, Key>::cast(obj)-> in Allocate()
11965 MaybeObject* Dictionary<Shape, Key>::GenerateNewEnumerationIndices() { in GenerateNewEnumerationIndices()
11966 Heap* heap = Dictionary<Shape, Key>::GetHeap(); in GenerateNewEnumerationIndices()
11989 if (Dictionary<Shape, Key>::IsKey(Dictionary<Shape, Key>::KeyAt(i))) { in GenerateNewEnumerationIndices()
12008 if (Dictionary<Shape, Key>::IsKey(Dictionary<Shape, Key>::KeyAt(i))) { in GenerateNewEnumerationIndices()
12023 MaybeObject* Dictionary<Shape, Key>::EnsureCapacity(int n, Key key) { in EnsureCapacity()
12038 Object* Dictionary<Shape, Key>::DeleteProperty(int entry, in DeleteProperty()
12040 Heap* heap = Dictionary<Shape, Key>::GetHeap(); in DeleteProperty()
12053 MaybeObject* Dictionary<Shape, Key>::Shrink(Key key) { in Shrink()
12059 MaybeObject* Dictionary<Shape, Key>::AtPut(Key key, Object* value) { in AtPut()
12063 if (entry != Dictionary<Shape, Key>::kNotFound) { in AtPut()
12080 return Dictionary<Shape, Key>::cast(obj)->AddEntry(key, value, details, in AtPut()
12081 Dictionary<Shape, Key>::Hash(key)); in AtPut()
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()
12104 MaybeObject* Dictionary<Shape, Key>::AddEntry(Key key, in AddEntry()
12114 uint32_t entry = Dictionary<Shape, Key>::FindInsertionEntry(hash); in AddEntry()
12124 ASSERT((Dictionary<Shape, Key>::KeyAt(entry)->IsNumber() in AddEntry()
12125 || Dictionary<Shape, Key>::KeyAt(entry)->IsString())); in AddEntry()
12230 int Dictionary<Shape, Key>::NumberOfElementsFilterAttributes( in NumberOfElementsFilterAttributes()
12248 int Dictionary<Shape, Key>::NumberOfEnumElements() { in NumberOfEnumElements()
12255 void Dictionary<Shape, Key>::CopyKeysTo( in CopyKeysTo()
12258 typename Dictionary<Shape, Key>::SortMode sort_mode) { in CopyKeysTo()
12271 if (sort_mode == Dictionary<Shape, Key>::SORTED) { in CopyKeysTo()
12299 void Dictionary<Shape, Key>::CopyKeysTo( in CopyKeysTo()
12302 typename Dictionary<Shape, Key>::SortMode sort_mode) { in CopyKeysTo()
12314 if (sort_mode == Dictionary<Shape, Key>::SORTED) { in CopyKeysTo()
12323 Object* Dictionary<Shape, Key>::SlowReverseLookup(Object* value) { in SlowReverseLookup()
12327 if (Dictionary<Shape, Key>::IsKey(k)) { in SlowReverseLookup()
12335 Heap* heap = Dictionary<Shape, Key>::GetHeap(); in SlowReverseLookup()