Lines Matching full: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();
10861 void HashTable<Shape, Key>::IteratePrefix(ObjectVisitor* v) {
10867 void HashTable<Shape, Key>::IterateElements(ObjectVisitor* v) {
10875 MaybeObject* HashTable<Shape, Key>::Allocate(int at_least_space_for,
10878 if (capacity > HashTable::kMaxCapacity) {
10887 HashTable::cast(obj)->SetNumberOfElements(0);
10888 HashTable::cast(obj)->SetNumberOfDeletedElements(0);
10889 HashTable::cast(obj)->SetCapacity(capacity);
10897 return HashTable<StringDictionaryShape, String*>::FindEntry(key);
10960 MaybeObject* HashTable<Shape, Key>::Rehash(HashTable* new_table, Key key) {
10979 uint32_t hash = HashTable<Shape, Key>::HashForObject(key, k);
10994 MaybeObject* HashTable<Shape, Key>::EnsureCapacity(int n, Key key) {
11015 return Rehash(HashTable::cast(obj), key);
11020 MaybeObject* HashTable<Shape, Key>::Shrink(Key key) {
11044 return Rehash(HashTable::cast(obj), key);
11049 uint32_t HashTable<Shape, Key>::FindInsertionEntry(uint32_t hash) {
11065 template class HashTable<SymbolTableShape, HashTableKey*>;
11067 template class HashTable<CompilationCacheShape, HashTableKey*>;
11069 template class HashTable<MapCacheShape, HashTableKey*>;
11071 template class HashTable<ObjectHashTableShape<1>, Object*>;
11073 template class HashTable<ObjectHashTableShape<2>, Object*>;
11172 int HashTable<SeededNumberDictionaryShape, uint32_t>::FindEntry(uint32_t);
11899 // SymbolsKey used for HashTable where key is array of symbols.
11961 HashTable<Shape, Key>::Allocate(at_least_space_for);
11974 int length = HashTable<Shape, Key>::NumberOfElements();
11993 int capacity = HashTable<Shape, Key>::Capacity();
12012 capacity = HashTable<Shape, Key>::Capacity();
12040 return HashTable<Shape, Key>::EnsureCapacity(n, key);
12054 HashTable<Shape, Key>::ElementRemoved();
12061 return HashTable<Shape, Key>::Shrink(key);
12133 HashTable<Shape, Key>::ElementAdded();
12239 int capacity = HashTable<Shape, Key>::Capacity();
12242 Object* k = HashTable<Shape, Key>::KeyAt(i);
12243 if (HashTable<Shape, Key>::IsKey(k)) {
12267 int capacity = HashTable<Shape, Key>::Capacity();
12270 Object* k = HashTable<Shape, Key>::KeyAt(i);
12271 if (HashTable<Shape, Key>::IsKey(k)) {
12312 int capacity = HashTable<Shape, Key>::Capacity();
12314 Object* k = HashTable<Shape, Key>::KeyAt(i);
12315 if (HashTable<Shape, Key>::IsKey(k)) {
12331 int capacity = HashTable<Shape, Key>::Capacity();
12333 Object* k = HashTable<Shape, Key>::KeyAt(i);
