Home
last modified time | relevance | path

Searched refs:NumberOfBuckets (Results 1 - 4 of 4) sorted by relevance

/third_party/node/deps/v8/src/objects/
H A Dordered-hash-table.h39 // [kPrefixSize + 3..(kPrefixSize + 3 + NumberOfBuckets() - 1)]: "hash table",
43 // [kPrefixSize + 3 + NumberOfBuckets()..length]: "data table", an
110 int Capacity() { return NumberOfBuckets() * kLoadFactor; } in Capacity()
112 int NumberOfBuckets() const { in NumberOfBuckets() function in v8::internal::OrderedHashTable
237 return HashTableStartIndex() + NumberOfBuckets() + (entry * kEntrySize); in EntryToIndexRaw()
244 int HashToBucket(int hash) { return hash & (NumberOfBuckets() - 1); } in HashToBucket()
451 int capacity = NumberOfBuckets() * kLoadFactor; in Capacity()
473 int NumberOfBuckets() const { return getByte(NumberOfBucketsOffset(), 0); } in NumberOfBuckets() function in v8::internal::SmallOrderedHashTable
525 DCHECK_LE(static_cast<unsigned>(bucket), NumberOfBuckets());
530 DCHECK_LE(static_cast<unsigned>(bucket), NumberOfBuckets());
[all...]
H A Dordered-hash-table.cc115 if (table->NumberOfBuckets() > 0) { in Clear()
205 int nof_buckets = table->NumberOfBuckets(); in ConvertToKeysArray()
262 int new_buckets = new_table->NumberOfBuckets(); in Rehash()
293 if (table->NumberOfBuckets() > 0) { in Rehash()
/third_party/node/deps/v8/src/diagnostics/
H A Dobjects-printer.cc942 os << "\n - buckets: " << table.NumberOfBuckets(); in PrintOrderedHashTableHeaderAndBuckets()
946 for (int bucket = 0; bucket < table.NumberOfBuckets(); bucket++) { in PrintOrderedHashTableHeaderAndBuckets()
H A Dobjects-debug.cc1337 for (int entry = 0; entry < NumberOfBuckets(); entry++) { in SmallOrderedHashTableVerify()

Completed in 17 milliseconds