Cross Reference: /external/v8/src/objects.cc

Lines Matching refs:Key
3670   // Key was not already in the dictionary, so add the entry.
3704     // Key wasn't in dictionary. Deletion is a success.
3707   // Key was in the dictionary. Remove it.
9950 template<typename Shape, typename Key>
9951 void Dictionary<Shape, Key>::Print(FILE* out) {
9952   int capacity = HashTable<Shape, Key>::Capacity();
9954     Object* k = HashTable<Shape, Key>::KeyAt(i);
9955     if (HashTable<Shape, Key>::IsKey(k)) {
9971 template<typename Shape, typename Key>
9972 void Dictionary<Shape, Key>::CopyValuesTo(FixedArray* elements) {
9974   int capacity = HashTable<Shape, Key>::Capacity();
9978     Object* k =  Dictionary<Shape, Key>::KeyAt(i);
9979     if (Dictionary<Shape, Key>::IsKey(k)) {
10853 template<typename Shape, typename Key>
10854 void HashTable<Shape, Key>::IteratePrefix(ObjectVisitor* v) {
10859 template<typename Shape, typename Key>
10860 void HashTable<Shape, Key>::IterateElements(ObjectVisitor* v) {
10867 template<typename Shape, typename Key>
10868 MaybeObject* HashTable<Shape, Key>::Allocate(int at_least_space_for,
10952 template<typename Shape, typename Key>
10953 MaybeObject* HashTable<Shape, Key>::Rehash(HashTable* new_table, Key key) {
10972       uint32_t hash = HashTable<Shape, Key>::HashForObject(key, k);
10986 template<typename Shape, typename Key>
10987 MaybeObject* HashTable<Shape, Key>::EnsureCapacity(int n, Key key) {
11012 template<typename Shape, typename Key>
11013 MaybeObject* HashTable<Shape, Key>::Shrink(Key key) {
11041 template<typename Shape, typename Key>
11042 uint32_t HashTable<Shape, Key>::FindInsertionEntry(uint32_t hash) {
11950 template<typename Shape, typename Key>
11951 MaybeObject* Dictionary<Shape, Key>::Allocate(int at_least_space_for) {
11954         HashTable<Shape, Key>::Allocate(at_least_space_for);
11958   Dictionary<Shape, Key>::cast(obj)->
11964 template<typename Shape, typename Key>
11965 MaybeObject* Dictionary<Shape, Key>::GenerateNewEnumerationIndices() {
11966   Heap* heap = Dictionary<Shape, Key>::GetHeap();
11967   int length = HashTable<Shape, Key>::NumberOfElements();
11986   int capacity = HashTable<Shape, Key>::Capacity();
11989     if (Dictionary<Shape, Key>::IsKey(Dictionary<Shape, Key>::KeyAt(i))) {
12005   capacity = HashTable<Shape, Key>::Capacity();
12008     if (Dictionary<Shape, Key>::IsKey(Dictionary<Shape, Key>::KeyAt(i))) {
12022 template<typename Shape, typename Key>
12023 MaybeObject* Dictionary<Shape, Key>::EnsureCapacity(int n, Key key) {
12033   return HashTable<Shape, Key>::EnsureCapacity(n, key);
12037 template<typename Shape, typename Key>
12038 Object* Dictionary<Shape, Key>::DeleteProperty(int entry,
12040   Heap* heap = Dictionary<Shape, Key>::GetHeap();
12047   HashTable<Shape, Key>::ElementRemoved();
12052 template<typename Shape, typename Key>
12053 MaybeObject* Dictionary<Shape, Key>::Shrink(Key key) {
12054   return HashTable<Shape, Key>::Shrink(key);
12058 template<typename Shape, typename Key>
12059 MaybeObject* Dictionary<Shape, Key>::AtPut(Key key, Object* value) {
12063   if (entry != Dictionary<Shape, Key>::kNotFound) {
12080   return Dictionary<Shape, Key>::cast(obj)->AddEntry(key, value, details,
12081       Dictionary<Shape, Key>::Hash(key));
12085 template<typename Shape, typename Key>
12086 MaybeObject* Dictionary<Shape, Key>::Add(Key key,
12090   SLOW_ASSERT((this->FindEntry(key) == Dictionary<Shape, Key>::kNotFound));
12097   return Dictionary<Shape, Key>::cast(obj)->AddEntry(key, value, details,
12098       Dictionary<Shape, Key>::Hash(key));
12103 template<typename Shape, typename Key>
12104 MaybeObject* Dictionary<Shape, Key>::AddEntry(Key key,
12114   uint32_t entry = Dictionary<Shape, Key>::FindInsertionEntry(hash);
12124   ASSERT((Dictionary<Shape, Key>::KeyAt(entry)->IsNumber()
12125           || Dictionary<Shape, Key>::KeyAt(entry)->IsString()));
12126   HashTable<Shape, Key>::ElementAdded();
12229 template<typename Shape, typename Key>
12230 int Dictionary<Shape, Key>::NumberOfElementsFilterAttributes(
12232   int capacity = HashTable<Shape, Key>::Capacity();
12235     Object* k = HashTable<Shape, Key>::KeyAt(i);
12236     if (HashTable<Shape, Key>::IsKey(k)) {
12247 template<typename Shape, typename Key>
12248 int Dictionary<Shape, Key>::NumberOfEnumElements() {
12254 template<typename Shape, typename Key>
12255 void Dictionary<Shape, Key>::CopyKeysTo(
12258     typename Dictionary<Shape, Key>::SortMode sort_mode) {
12260   int capacity = HashTable<Shape, Key>::Capacity();
12263      Object* k = HashTable<Shape, Key>::KeyAt(i);
12264      if (HashTable<Shape, Key>::IsKey(k)) {
12271   if (sort_mode == Dictionary<Shape, Key>::SORTED) {
12298 template<typename Shape, typename Key>
12299 void Dictionary<Shape, Key>::CopyKeysTo(
12302     typename Dictionary<Shape, Key>::SortMode sort_mode) {
12305   int capacity = HashTable<Shape, Key>::Capacity();
12307     Object* k = HashTable<Shape, Key>::KeyAt(i);
12308     if (HashTable<Shape, Key>::IsKey(k)) {
12314   if (sort_mode == Dictionary<Shape, Key>::SORTED) {
12322 template<typename Shape, typename Key>
12323 Object* Dictionary<Shape, Key>::SlowReverseLookup(Object* value) {
12324   int capacity = HashTable<Shape, Key>::Capacity();
12326     Object* k =  HashTable<Shape, Key>::KeyAt(i);
12327     if (Dictionary<Shape, Key>::IsKey(k)) {
12335   Heap* heap = Dictionary<Shape, Key>::GetHeap();
12572   // Key is already in table, just overwrite value.