Lines Matching defs:table
58 // Clear the table.
61 // How many entries are in the table?
64 // How many slots does the table contain? (Note that unlike an array, hash tables can grow
72 // set(), find() and foreach() all allow mutable access to table entries.
81 // Copy val into the hash table, returning a pointer to the copy now in the table.
82 // If there already is an entry in the table with the same key, we overwrite it.
90 // If there is an entry in the table with this key, return a pointer to it. If not, null.
108 // If there is an entry in the table with this key, return it. If not, null.
117 // Remove the value with this key from the hash table.
137 // Call fn on every entry in the table. You may mutate the entries, but be very careful.
147 // Call fn on every entry in the table. You may not mutate anything.
165 Iter(const TTable* table, int slot) : fTable(table), fSlot(slot) {}
167 static Iter MakeBegin(const TTable* table) {
168 return Iter{table, table->firstPopulatedSlot()};
171 static Iter MakeEnd(const TTable* table) {
172 return Iter{table, table->capacity()};
419 // How many key/value pairs are in the table?
427 // Set key to val in the table, replacing any previous value with the same key.
428 // We copy both key and val, and return a pointer to the value copy now in the table.
434 // If there is key/value entry in the table with this key, return a pointer to the value.
450 // Remove the key/value entry in the table with this key.
456 // Call fn on every key/value pair in the table. You may mutate the value but not the key.
462 // Call fn on every key/value pair in the table. You may not mutate anything.