Lines Matching full:hashtable
75 // - HashTable
833 V(HashTable) \
2652 // HashTable is a subclass of FixedArray that implements a hash table
2702 class HashTable: public FixedArray {
2753 // Returns a new HashTable object. Might return Failure.
2759 // number of elements. May be more than HashTable::kMaxCapacity.
2776 static inline HashTable* cast(Object* obj);
2798 // Maximal capacity of HashTable. Based on maximal length of underlying
2854 MUST_USE_RESULT MaybeObject* Rehash(HashTable* new_table, Key key);
2906 class SymbolTable: public HashTable<SymbolTableShape, HashTableKey*> {
2966 class MapCache: public HashTable<MapCacheShape, HashTableKey*> {
2979 class Dictionary: public HashTable<Shape, Key> {
2987 return this->get(HashTable<Shape, Key>::EntryToIndex(entry) + 1);
2992 this->set(HashTable<Shape, Key>::EntryToIndex(entry) + 1, value);
2999 Smi::cast(this->get(HashTable<Shape, Key>::EntryToIndex(entry) + 2)));
3004 this->set(HashTable<Shape, Key>::EntryToIndex(entry) + 2, value.AsSmi());
3081 HashTable<Shape, Key>::kPrefixStartIndex;
3114 // HashTable::FindEntry.
3236 class ObjectHashSet: public HashTable<ObjectHashTableShape<1>, Object*> {
3256 class ObjectHashTable: public HashTable<ObjectHashTableShape<2>, Object*> {
6397 class CompilationCacheTable: public HashTable<CompilationCacheShape,
6503 class CodeCacheHashTable: public HashTable<CodeCacheHashTableShape,
6559 : public HashTable<CodeCacheHashTableShape, HashTableKey*> {
7922 // - slow, backing storage is a HashTable with numbers as keys.
