Lines Matching defs:table
53 * To sucessfully store and retrieve objects from a hash table the
80 * The hash table data.
82 private CacheEntry table[];
85 * The total number of entries in the hash table.
90 * Rehashes the table when count exceeds this threshold.
104 table = new CacheEntry[initialCapacity];
167 return new CacheEnumerator(table, true);
177 return new CacheEnumerator(table, false);
182 * @param key the key in the hash table
184 * is not defined in the hash table.
188 CacheEntry tab[] = table;
200 * Rehashes the contents of the table into a bigger table.
205 int oldCapacity = table.length;
206 CacheEntry oldTable[] = table;
212 table = newTable;
248 CacheEntry tab[] = table;
262 // Rehash the table if the threshold is exceeded
286 CacheEntry tab[] = table;
311 CacheEntry table[];
314 CacheEnumerator (CacheEntry table[], boolean keys) {
315 this.table = table;
317 this.index = table.length;
327 while (--index >= 0 && (entry = table[index]) == null) ;
335 while (--index >= 0 && (entry = table[index]) == null) ;