Lines Matching refs:HashTable

9952   int capacity = HashTable<Shape, Key>::Capacity();
9954 Object* k = HashTable<Shape, Key>::KeyAt(i);
9955 if (HashTable<Shape, Key>::IsKey(k)) {
9974 int capacity = HashTable<Shape, Key>::Capacity();
10854 void HashTable<Shape, Key>::IteratePrefix(ObjectVisitor* v) {
10860 void HashTable<Shape, Key>::IterateElements(ObjectVisitor* v) {
10868 MaybeObject* HashTable<Shape, Key>::Allocate(int at_least_space_for,
10871 if (capacity > HashTable::kMaxCapacity) {
10880 HashTable::cast(obj)->SetNumberOfElements(0);
10881 HashTable::cast(obj)->SetNumberOfDeletedElements(0);
10882 HashTable::cast(obj)->SetCapacity(capacity);
10890 return HashTable<StringDictionaryShape, String*>::FindEntry(key);
10953 MaybeObject* HashTable<Shape, Key>::Rehash(HashTable* new_table, Key key) {
10972 uint32_t hash = HashTable<Shape, Key>::HashForObject(key, k);
10987 MaybeObject* HashTable<Shape, Key>::EnsureCapacity(int n, Key key) {
11008 return Rehash(HashTable::cast(obj), key);
11013 MaybeObject* HashTable<Shape, Key>::Shrink(Key key) {
11037 return Rehash(HashTable::cast(obj), key);
11042 uint32_t HashTable<Shape, Key>::FindInsertionEntry(uint32_t hash) {
11058 template class HashTable<SymbolTableShape, HashTableKey*>;
11060 template class HashTable<CompilationCacheShape, HashTableKey*>;
11062 template class HashTable<MapCacheShape, HashTableKey*>;
11064 template class HashTable<ObjectHashTableShape<1>, Object*>;
11066 template class HashTable<ObjectHashTableShape<2>, Object*>;
11165 int HashTable<SeededNumberDictionaryShape, uint32_t>::FindEntry(uint32_t);
11892 // SymbolsKey used for HashTable where key is array of symbols.
11954 HashTable<Shape, Key>::Allocate(at_least_space_for);
11967 int length = HashTable<Shape, Key>::NumberOfElements();
11986 int capacity = HashTable<Shape, Key>::Capacity();
12005 capacity = HashTable<Shape, Key>::Capacity();
12033 return HashTable<Shape, Key>::EnsureCapacity(n, key);
12047 HashTable<Shape, Key>::ElementRemoved();
12054 return HashTable<Shape, Key>::Shrink(key);
12126 HashTable<Shape, Key>::ElementAdded();
12232 int capacity = HashTable<Shape, Key>::Capacity();
12235 Object* k = HashTable<Shape, Key>::KeyAt(i);
12236 if (HashTable<Shape, Key>::IsKey(k)) {
12260 int capacity = HashTable<Shape, Key>::Capacity();
12263 Object* k = HashTable<Shape, Key>::KeyAt(i);
12264 if (HashTable<Shape, Key>::IsKey(k)) {
12305 int capacity = HashTable<Shape, Key>::Capacity();
12307 Object* k = HashTable<Shape, Key>::KeyAt(i);
12308 if (HashTable<Shape, Key>::IsKey(k)) {
12324 int capacity = HashTable<Shape, Key>::Capacity();
12326 Object* k = HashTable<Shape, Key>::KeyAt(i);