Lines Matching defs:slot
165 Iter(const TTable* table, int slot) : fTable(table), fSlot(slot) {}
176 return *fTable->slot(fSlot);
180 return fTable->slot(fSlot);
210 // Finds the first non-empty slot for an iterator.
220 // Increments an iterator's slot.
230 // Reads from an iterator's slot.
231 const T* slot(int i) const {
288 // Look for an element that can be moved into the empty slot.
289 // If the empty slot is in between where an element landed, and its native slot, then
290 // move it to the empty slot. Don't move it if its native slot is in between where
291 // the element landed and the empty slot.
292 // [native] <= [empty] < [candidate] == GOOD, can move candidate to empty slot
298 // We're done shuffling elements around. Clear the last empty slot.
306 // Move the element to the empty slot.