Lines Matching full:hashtable
173 /* Creates a hashtable with the specified minimum initial capacity.
176 * minimumInitialCapacity: The minimum initial capacity for the hashtable.
178 * loadFactor: The desired load factor for the hashtable, between 0 and 1.
183 /* Copies a hashtable.
188 /* Clears and destroys the hashtable.
192 /* Making this hashtable a copy of the other hashtable.
195 * other: The hashtable to copy.
202 /* Returns the number of entries in the hashtable.
208 /* Returns the capacity of the hashtable, which is the number of elements that can
209 * added to the hashtable without requiring it to be grown.
215 /* Returns the number of buckets that the hashtable has, which is the size of its
222 /* Returns the load factor of the hashtable. */
230 * the bounds of the hashtable.
239 * the bounds of the hashtable.
246 /* Clears the hashtable.
247 * All entries in the hashtable are destroyed immediately.
248 * If you need to do something special with the entries in the hashtable then iterate
249 * over them and do what you need before clearing the hashtable.
255 /* Returns the index of the next entry in the hashtable given the index of a previous entry.
256 * If the given index is -1, then returns the index of the first entry in the hashtable,
258 * If the given index is not -1, then returns the index of the next entry in the hashtable,
262 * iteration at the beginning of the hashtable.
271 * If the hashtable contains multiple entries with keys that match the requested
284 /* Adds the entry to the hashtable.
287 * If the entry will not fit, then the hashtable's capacity is increased and
297 /* Removes the entry with the specified index from the hashtable.
301 * The hashtable is not compacted after an item is removed, so it is legal
302 * to continue iterating over the hashtable using next() or find().
305 * bounds of the hashtable, and it must refer to an existing entry.
311 /* Rehashes the contents of the hashtable.
312 * Grows the hashtable to at least the specified minimum capacity or the
316 * Although the hash codes are cached by the hashtable, rehashing can be an
317 * expensive operation and should be avoided unless the hashtable's size
321 * hashtable once it has been created. It can be used to compact the
322 * hashtable by choosing a minimum capacity that is smaller than the current
354 // For dumping the raw contents of a hashtable during testing.
