Lines Matching full:hashtable
4888 ObjectHashTable* hashtable = ObjectHashTable::cast(inline_value);
4889 Object* entry = hashtable->Lookup(key);
4919 Handle<ObjectHashTable> hashtable =
4923 Handle<ObjectHashTable> new_table = ObjectHashTable::Put(hashtable, key,
4925 if (*new_table != *hashtable) {
4953 Handle<ObjectHashTable> hashtable(ObjectHashTable::cast(inline_value));
4954 ObjectHashTable::Put(hashtable, key, isolate->factory()->the_hole_value());
5009 Handle<ObjectHashTable> hashtable = isolate->factory()->NewObjectHashTable(
5016 hashtable = ObjectHashTable::Put(hashtable,
5024 hashtable,
5030 return hashtable;
13244 int capacity = HashTable<Shape, Key>::Capacity();
13246 Object* k = HashTable<Shape, Key>::KeyAt(i);
13247 if (HashTable<Shape, Key>::IsKey(k)) {
13266 int capacity = HashTable<Shape, Key>::Capacity();
14080 void HashTable<Shape, Key>::IteratePrefix(ObjectVisitor* v) {
14086 void HashTable<Shape, Key>::IterateElements(ObjectVisitor* v) {
14094 MaybeObject* HashTable<Shape, Key>::Allocate(Heap* heap,
14102 if (capacity > HashTable::kMaxCapacity) {
14111 HashTable::cast(obj)->SetNumberOfElements(0);
14112 HashTable::cast(obj)->SetNumberOfDeletedElements(0);
14113 HashTable::cast(obj)->SetCapacity(capacity);
14121 return HashTable<NameDictionaryShape, Name*>::FindEntry(key);
14159 MaybeObject* HashTable<Shape, Key>::Rehash(HashTable* new_table, Key key) {
14178 uint32_t hash = HashTable<Shape, Key>::HashForObject(key, k);
14193 uint32_t HashTable<Shape, Key>::EntryForProbe(Key key,
14197 uint32_t hash = HashTable<Shape, Key>::HashForObject(key, k);
14209 void HashTable<Shape, Key>::Swap(uint32_t entry1,
14228 void HashTable<Shape, Key>::Rehash(Key key) {
14261 MaybeObject* HashTable<Shape, Key>::EnsureCapacity(int n,
14287 return Rehash(HashTable::cast(obj), key);
14292 MaybeObject* HashTable<Shape, Key>::Shrink(Key key) {
14319 return Rehash(HashTable::cast(obj), key);
14324 uint32_t HashTable<Shape, Key>::FindInsertionEntry(uint32_t hash) {
14341 template class HashTable<StringTableShape, HashTableKey*>;
14343 template class HashTable<CompilationCacheShape, HashTableKey*>;
14345 template class HashTable<MapCacheShape, HashTableKey*>;
14347 template class HashTable<ObjectHashTableShape<1>, Object*>;
14349 template class HashTable<ObjectHashTableShape<2>, Object*>;
14351 template class HashTable<WeakHashTableShape<2>, Object*>;
14450 int HashTable<SeededNumberDictionaryShape, uint32_t>::FindEntry(uint32_t);
15301 // StringsKey used for HashTable where key is array of internalized strings.
15365 HashTable<Shape, Key>::Allocate(
15388 int length = HashTable<Shape, Key>::NumberOfElements();
15407 int capacity = HashTable<Shape, Key>::Capacity();
15427 capacity = HashTable<Shape, Key>::Capacity();
15455 return HashTable<Shape, Key>::EnsureCapacity(n, key);
15469 HashTable<Shape, Key>::ElementRemoved();
15476 return HashTable<Shape, Key>::Shrink(key);
15550 HashTable<Shape, Key>::ElementAdded();
15667 int capacity = HashTable<Shape, Key>::Capacity();
15670 Object* k = HashTable<Shape, Key>::KeyAt(i);
15671 if (HashTable<Shape, Key>::IsKey(k) &&
15696 int capacity = HashTable<Shape, Key>::Capacity();
15699 Object* k = HashTable<Shape, Key>::KeyAt(i);
15700 if (HashTable<Shape, Key>::IsKey(k)) {
15764 int capacity = HashTable<Shape, Key>::Capacity();
15766 Object* k = HashTable<Shape, Key>::KeyAt(i);
15767 if (HashTable<Shape, Key>::IsKey(k)) {
15784 int capacity = HashTable<Shape, Key>::Capacity();
15786 Object* k = HashTable<Shape, Key>::KeyAt(i);
15948 Handle<HashTable<ObjectHashTableShape<1>, Object*> > table_base = table;
15957 Handle<HashTable<ObjectHashTableShape<1>, Object*> > table_base = table;
16023 Handle<HashTable<ObjectHashTableShape<2>, Object*> > table_base = table;
16032 Handle<HashTable<ObjectHashTableShape<2>, Object*> > table_base = table;
