Searched defs:table (Results 1 - 11 of 11) sorted by relevance

/libcore/luni/src/test/java/org/apache/harmony/security/tests/java/security/
H A DSecurity2Test.java54 // to the allSupported table then increment the count of the
104 private void addOrIncrementTable(Map<String, Integer> table, String k) { argument
106 if (table.containsKey(key)) {
107 int before = table.get(key);
108 table.put(key, before + 1);
110 table.put(key, 1);
/libcore/ojluni/src/main/java/java/lang/
H A DThreadLocal.java293 * very large and long-lived usages, the hash table entries use
296 * the table starts running out of space.
305 * entry can be expunged from table. Such entries are referred to
324 * The table, resized as necessary.
325 * table.length MUST always be a power of two.
327 private Entry[] table; field in class:ThreadLocal.ThreadLocalMap
330 * The number of entries in the table.
366 table = new Entry[INITIAL_CAPACITY];
368 table[i] = new Entry(firstKey, firstValue);
380 Entry[] parentTable = parentMap.table;
[all...]
/libcore/support/src/test/java/org/apache/harmony/xnet/tests/support/
H A DmySSLSession.java26 private Hashtable table; field in class:mySSLSession
37 table = new Hashtable();
128 Object obj1 = table.put(s, obj);
142 Object obj = table.remove(s);
153 return table.get(s);
159 Enumeration enumeration = table.keys();
/libcore/ojluni/src/main/java/java/util/
H A DHashtable.java35 * This class implements a hash table, which maps keys to values. Any
44 * <i>capacity</i> is the number of <i>buckets</i> in the hash table, and the
45 * <i>initial capacity</i> is simply the capacity at the time the hash table
46 * is created. Note that the hash table is <i>open</i>: in the case of a "hash
49 * table is allowed to get before its capacity is automatically increased.
69 * automatic rehashing as needed to grow the table. <p>
135 * The hash table data.
137 private transient HashtableEntry<?,?>[] table; field in class:Hashtable
140 * The total number of entries in the hash table.
145 * The table i
1334 HashtableEntry<?,?>[] table = Hashtable.this.table; field in class:Hashtable.Enumerator
[all...]
H A DIdentityHashMap.java34 * This class implements the <tt>Map</tt> interface with a hash table, using
51 * a transformation, a program must maintain a "node table" that keeps track
53 * table must not equate distinct objects even if they happen to be equal.
72 * comprising the hash table. The precise relationship between the expected
80 * time proportional to the number of buckets in the hash table, so it
117 * <p>Implementation note: This is a simple <i>linear-probe</i> hash table,
170 * The table, resized as necessary. Length MUST always be a power of two.
172 transient Object[] table; // non-private to simplify nested class access field in class:IdentityHashMap
254 table = new Object[2 * initCapacity];
300 * Circularly traverses table o
[all...]
H A DWeakHashMap.java37 * Hash table based implementation of the <tt>Map</tt> interface, with
158 * The table, resized as necessary. Length MUST Always be a power of two.
160 Entry<K,V>[] table; field in class:WeakHashMap
173 * The load factor for the hash table.
220 table = newTable(capacity);
315 * Expunges stale entries from the table.
322 int i = indexFor(e.hash, table.length);
324 Entry<K,V> prev = table[i];
330 table[i] = next;
347 * Returns the table afte
[all...]
H A DHashMap.java39 * Hash table based implementation of the <tt>Map</tt> interface. This
58 * <i>capacity</i> is the number of buckets in the hash table, and the initial
59 * capacity is simply the capacity at the time the hash table is created. The
60 * <i>load factor</i> is a measure of how full the hash table is allowed to
62 * entries in the hash table exceeds the product of the load factor and the
63 * current capacity, the hash table is <i>rehashed</i> (that is, internal data
64 * structures are rebuilt) so that the hash table has approximately twice the
81 * automatic rehashing as needed to grow the table. Note that using
83 * down performance of any hash table. To ameliorate impact, when keys
145 * This map usually acts as a binned (bucketed) hash table, bu
395 transient Node<K,V>[] table; field in class:HashMap
[all...]
/libcore/ojluni/src/main/native/
H A Dzip_util.h174 * In-memory hash table cell.
229 jint *table; /* Hash chain heads: indexes into entries */ member in struct:jzfile
H A Dzip_util.c517 free(zip->table); zip->table = NULL;
562 jint *table; local
665 table = zip->table = malloc(tablelen * sizeof(table[0]));
668 * for 'table' because 'tablelen' can't be zero (see computation above). */
669 if ((entries == NULL && total != 0) || table == NULL) goto Catch;
671 table[j] = ZIP_ENDCHAIN;
720 /* Add the entry to the hash table */
[all...]
/libcore/ojluni/src/main/java/java/sql/
H A DDatabaseMetaData.java223 * Retrieves whether this database uses a file for each table.
225 * @return <code>true</code> if this database uses a local file for each table;
456 * Retrieves whether this database supports table correlation names.
464 * Retrieves whether, when table correlation names are supported, they
667 * table name. If not, the catalog appears at the end.
670 * of a fully qualified table name; <code>false</code> otherwise
677 * separator between a catalog and table name.
701 * Retrieves whether a schema name can be used in a table definition statement.
741 * Retrieves whether a catalog name can be used in a table definition statement.
986 * Retrieves the maximum number of columns this database allows in a table
1735 getColumnPrivileges(String catalog, String schema, String table, String columnNamePattern) argument
1832 getBestRowIdentifier(String catalog, String schema, String table, int scope, boolean nullable) argument
1943 getVersionColumns(String catalog, String schema, String table) argument
2005 getPrimaryKeys(String catalog, String schema, String table) argument
2083 getImportedKeys(String catalog, String schema, String table) argument
2267 getExportedKeys(String catalog, String schema, String table) argument
2554 getIndexInfo(String catalog, String schema, String table, boolean unique, boolean approximate) argument
[all...]
/libcore/ojluni/src/main/java/java/util/concurrent/
H A DConcurrentHashMap.java77 * A hash table supporting full concurrency of retrievals and
83 * and there is <em>not</em> any support for locking the entire table
98 * state of the hash table at some point at or since the creation of the
109 * <p>The table is dynamically expanded when there are too many
111 * the same slot modulo the table size), with the expected average
117 * table may be a relatively slow operation. When possible, it is a
121 * customizing initial table capacity by specifying the table density
128 * hash table. To ameliorate impact, when keys are {@link Comparable},
271 * The primary design goal of this hash table i
781 transient volatile Node<K,V>[] table; field in class:ConcurrentHashMap
[all...]

Completed in 273 milliseconds