Lines Matching defs:set
39 // set(), find() and foreach() all allow mutable access to table entries.
45 // The pointers returned by set() and find() are valid only until the next call to set().
50 T* set(const T& val) {
202 // N.B. The pointers returned by set() and find() are valid only until the next call to set().
204 // Set key to val in the table, replacing any previous value with the same key.
206 V* set(const K& key, const V& val) {
208 Pair* out = fTable.set(in);
250 // A set of T. T is treated as an ordiary copyable C++ type.
256 // Clear the set.
259 // How many items are in the set?
262 // Copy an item into the set.
263 void add(const T& item) { fTable.set(item); }
265 // Is this item in the set?
268 // If an item equal to this is in the set, return a pointer to it, otherwise null.
272 // Remove the item in the set equal to this.
278 // Call fn on every item in the set. You may not mutate anything.
