Lines Matching refs:table
52 static JSHandle<Derived> Insert(const JSThread *thread, const JSHandle<Derived> &table,
55 static JSHandle<Derived> InsertWeakRef(const JSThread *thread, const JSHandle<Derived> &table,
58 static JSHandle<Derived> GrowCapacity(const JSThread *thread, const JSHandle<Derived> &table,
61 static JSHandle<Derived> Remove(const JSThread *thread, const JSHandle<Derived> &table,
64 static JSHandle<Derived> Shrink(const JSThread *thread, const JSHandle<Derived> &table, int additionalCapacity = 0);
224 ASSERT_PRINT(newTable != nullptr && newTable->Capacity() > NumberOfElements(), "can not rehash to new table");
225 // Rehash elements to new table
241 // If the key is a weak reference, we use the weak referent to calculate the new index in the new table.
363 static JSHandle<LinkedHashMap> Shrink(const JSThread *thread, const JSHandle<LinkedHashMap> &table,
368 static JSHandle<LinkedHashMap> Clear(const JSThread *thread, const JSHandle<LinkedHashMap> &table);
402 static JSHandle<LinkedHashSet> Shrink(const JSThread *thread, const JSHandle<LinkedHashSet> &table,
407 static JSHandle<LinkedHashSet> Clear(const JSThread *thread, const JSHandle<LinkedHashSet> &table);