Lines Matching defs:table
20 * A hash table supporting full concurrency of retrievals and
26 * and there is <em>not</em> any support for locking the entire table
38 * Enumerations return elements reflecting the state of the hash table
46 * table is internally partitioned to try to permit the indicated
50 * threads as will ever concurrently modify the table. Using a
57 * hash table is a relatively slow operation, so, when possible, it is
58 * a good idea to provide estimates of expected table sizes in
78 * The basic strategy is to subdivide the table among Segments,
79 * each of which itself is a concurrently readable hash table.
85 * The default initial capacity for this table,
91 * The default load factor for this table, used when not
97 * The default concurrency level for this table, used when not
138 * The segments, each of which is a specialized hash table
215 * Segments maintain a table of entry lists that are ALWAYS
234 * "count" field, and should not look at table entries if
243 * can reveal that the table has grown but the threshold
259 * Number of updates that alter the size of the table. This is
269 * The table is rehashed when its size exceeds this threshold.
276 * The per-segment table.
278 transient volatile HashEntry<K,V>[] table;
281 * The load factor for the hash table. Even though this value
299 * Sets table to new HashEntry array.
304 table = newTable;
311 HashEntry<K,V>[] tab = table;
319 * its table assignment, which is legal under memory model
363 HashEntry<K,V>[] tab = table;
421 HashEntry<K,V>[] tab = table;
447 HashEntry<K,V>[] oldTable = table;
460 * a table doubles. The nodes they replace will be garbage
462 * reader thread that may be in the midst of traversing table
507 table = newTable;
517 HashEntry<K,V>[] tab = table;
551 HashEntry<K,V>[] tab = table;
662 * table was never actually empty at any point. Note the
701 // continuous async changes in table, resort to locking.
754 * Tests if the specified object is a key in this table.
758 * is a key in this table, as determined by the
770 * traversal of the hash table, and so is much slower than
830 * in this table. This method is identical in functionality to
838 * <tt>value</tt> argument in this table as
848 * Maps the specified key to the specified value in this table.
1017 * Returns an enumeration of the keys in this table.
1019 * @return an enumeration of the keys in this table
1027 * Returns an enumeration of the values in this table.
1029 * @return an enumeration of the values in this table
1065 currentTable = seg.table;
1286 HashEntry<K,V>[] tab = seg.table;
1315 // Read the keys and values, and put the mappings in the table