Lines Matching defs:table
122 HashTableConstIterator(const HashTableType* table, PointerType position, PointerType endPosition)
125 addIterator(table, this);
129 HashTableConstIterator(const HashTableType* table, PointerType position, PointerType endPosition, HashItemKnownGoodTag)
132 addIterator(table, this);
251 HashTableIterator(HashTableType* table, PointerType pos, PointerType end) : m_iterator(table, pos, end) { }
252 HashTableIterator(HashTableType* table, PointerType pos, PointerType end, HashItemKnownGoodTag tag) : m_iterator(table, pos, end, tag) { }
363 // When the hash table is empty, just return the same iterator for end as for begin.
365 // buckets, and iterating an empty table is a common case that's worth optimizing.
380 // in the table.
422 static void deallocateTable(ValueType* table, int size);
591 ValueType* table = m_table;
595 if (!table)
608 ValueType* entry = table + i;
647 ValueType* table = m_table;
664 ValueType* entry = table + i;
708 ValueType* table = m_table;
725 ValueType* entry = table + i;
802 ValueType* table = m_table;
819 entry = table + i;
1071 void HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits>::deallocateTable(ValueType* table, int size)
1074 if (!isDeletedBucket(table[i]))
1075 table[i].~ValueType();
1077 fastFree(table);
1167 // Copy the hash table the dumb way, by adding each element to the new table.
1168 // It might be more efficient to copy the table slots, but it's not clear that efficiency is needed.
1264 void addIterator(const HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits>* table,
1267 it->m_table = table;
1271 if (!table) {
1274 std::lock_guard<std::mutex> lock(*table->m_mutex);
1275 ASSERT(table->m_iterators != it);
1276 it->m_next = table->m_iterators;
1277 table->m_iterators = it;