Lines Matching refs:HashTable
1914 os << "<HashTable[" << FixedArray::cast(*this).length() << "]>";
5689 void HashTable<Derived, Shape>::IteratePrefix(ObjectVisitor* v) {
5694 void HashTable<Derived, Shape>::IterateElements(ObjectVisitor* v) {
5701 Handle<Derived> HashTable<Derived, Shape>::New(
5711 if (capacity > HashTable::kMaxCapacity) {
5719 Handle<Derived> HashTable<Derived, Shape>::NewInternal(
5734 void HashTable<Derived, Shape>::Rehash(PtrComprCageBase cage_base,
5765 InternalIndex HashTable<Derived, Shape>::EntryForProbe(ReadOnlyRoots roots,
5779 void HashTable<Derived, Shape>::Swap(InternalIndex entry1, InternalIndex entry2,
5799 void HashTable<Derived, Shape>::Rehash(PtrComprCageBase cage_base) {
5851 Handle<Derived> HashTable<Derived, Shape>::EnsureCapacity(
5862 Handle<Derived> new_table = HashTable::New(
5871 bool HashTable<Derived, Shape>::HasSufficientCapacityToAdd(
5880 bool HashTable<Derived, Shape>::HasSufficientCapacityToAdd(
5897 int HashTable<Derived, Shape>::ComputeCapacityWithShrink(
5912 Handle<Derived> HashTable<Derived, Shape>::Shrink(Isolate* isolate,
5923 HashTable::New(isolate, new_capacity,
5932 InternalIndex HashTable<Derived, Shape>::FindInsertionEntry(
5946 // This reimplements HashTable::FindEntry for use in a concurrent setting.
5974 return HashTable::New(isolate, 0);
6872 HashTable<DERIVED, SHAPE>; \
6875 HashTable<DERIVED, SHAPE>::New(Isolate*, int, AllocationType, \
6878 HashTable<DERIVED, SHAPE>::New(LocalIsolate*, int, AllocationType, \
6882 HashTable<DERIVED, SHAPE>::EnsureCapacity(Isolate*, Handle<DERIVED>, int, \
6885 HashTable<DERIVED, SHAPE>::EnsureCapacity(LocalIsolate*, Handle<DERIVED>, \