Lines Matching defs:in
5 * found in the LICENSE file.
35 // How many entries are in the table?
49 // The pointers you receive in foreach() are only valid for its duration.
51 // Copy val into the hash table, returning a pointer to the copy now in the table.
52 // If there already is an entry in the table with the same key, we overwrite it.
60 // If there is an entry in the table with this key, return a pointer to it. If not, NULL.
98 // Call fn on every entry in the table. You may mutate the entries, but be very careful.
108 // Call fn on every entry in the table. You may not mutate anything.
166 // A valid strategy explores all slots in [0, fCapacity) as n walks from 0 to fCapacity-1.
202 // How many key/value pairs are in the table?
210 // Set key to val in the table, replacing any previous value with the same key.
211 // We copy both key and val, and return a pointer to the value copy now in the table.
213 Pair in = { key, val };
214 Pair* out = fTable.set(in);
218 // If there is key/value entry in the table with this key, return a pointer to the value.
227 // Remove the key/value entry in the table with this key.
233 // Call fn on every key/value pair in the table. You may mutate the value but not the key.
239 // Call fn on every key/value pair in the table. You may not mutate anything.
265 // How many items are in the set?
274 // Is this item in the set?
277 // If an item equal to this is in the set, return a pointer to it, otherwise null.
281 // Remove the item in the set equal to this.
287 // Call fn on every item in the set. You may not mutate anything.
