Home
last modified time | relevance | path

Searched refs:table (Results 1 – 24 of 24) sorted by relevance

/libcore/ojluni/src/main/java/java/lang/
DThreadLocal.java348 private Entry[] table; field in ThreadLocal.ThreadLocalMap
387 table = new Entry[INITIAL_CAPACITY]; in ThreadLocalMap()
389 table[i] = new Entry(firstKey, firstValue); in ThreadLocalMap()
401 Entry[] parentTable = parentMap.table; in ThreadLocalMap()
404 table = new Entry[len]; in ThreadLocalMap()
414 while (table[h] != null) in ThreadLocalMap()
416 table[h] = c; in ThreadLocalMap()
434 int i = key.threadLocalHashCode & (table.length - 1); in getEntry()
435 Entry e = table[i]; in getEntry()
453 Entry[] tab = table; in getEntryAfterMiss()
[all …]
/libcore/ojluni/src/main/java/java/util/
DHashtable.java143 private transient HashtableEntry<?,?>[] table; field in Hashtable
197 table = new HashtableEntry<?,?>[initialCapacity]; in Hashtable()
315 HashtableEntry<?,?> tab[] = table; in contains()
353 HashtableEntry<?,?> tab[] = table; in containsKey()
381 HashtableEntry<?,?> tab[] = table; in get()
409 int oldCapacity = table.length; in rehash()
410 HashtableEntry<?,?>[] oldMap = table; in rehash()
424 table = newMap; in rehash()
439 HashtableEntry<?,?> tab[] = table; in addEntry()
444 tab = table; in addEntry()
[all …]
DIdentityHashMap.java177 transient Object[] table; // non-private to simplify nested class access field in IdentityHashMap
259 table = new Object[2 * initCapacity]; in init()
331 Object[] tab = table; in get()
355 Object[] tab = table; in containsKey()
378 Object[] tab = table; in containsValue()
396 Object[] tab = table; in containsMapping()
428 final Object[] tab = table; in put()
466 Object[] oldTable = table; in resize()
491 table = newTable; in resize()
525 Object[] tab = table; in remove()
[all …]
DImmutableCollections.java1174 final Object[] table; // pairs of key, value
1187 table = new Object[len];
1199 table[dest] = k;
1200 table[dest+1] = v;
1214 for (int i = 1; i < table.length; i += 2) {
1215 Object v = table[i];
1226 for (int i = 0; i < table.length; i += 2) {
1227 Object k = table[i];
1229 hash += k.hashCode() ^ table[i + 1].hashCode();
1244 return (V)table[i+1];
[all …]
DWeakHashMap.java159 Entry<K,V>[] table; field in WeakHashMap
219 table = newTable(capacity); in WeakHashMap()
327 int i = indexFor(e.hash, table.length); in expungeStaleEntries()
329 Entry<K,V> prev = table[i]; in expungeStaleEntries()
335 table[i] = next; in expungeStaleEntries()
356 return table; in getTable()
500 table = newTable; in resize()
512 table = oldTable; in resize()
563 int newCapacity = table.length; in putAll()
566 if (newCapacity > table.length) in putAll()
[all …]
DHashMap.java389 transient Node<K,V>[] table; field in HashMap
504 if (table == null) { // pre-size in putMapEntries()
514 while (s > threshold && table.length < MAXIMUM_CAPACITY) in putMapEntries()
574 if ((tab = table) != null && (n = tab.length) > 0 && in getNode()
633 if ((tab = table) == null || (n = tab.length) == 0) in putVal()
683 Node<K,V>[] oldTab = table; in resize()
710 table = newTab; in resize()
821 if ((tab = table) != null && (n = tab.length) > 0 && in removeNode()
866 if ((tab = table) != null && size > 0) { in clear()
883 if ((tab = table) != null && size > 0) { in containsValue()
[all …]
/libcore/support/src/test/java/org/apache/harmony/xnet/tests/support/
DmySSLSession.java43 private Hashtable table; field in mySSLSession
54 table = new Hashtable(); in mySSLSession()
145 Object obj1 = table.put(s, obj); in putValue()
159 Object obj = table.remove(s); in removeValue()
170 return table.get(s); in getValue()
176 Enumeration enumeration = table.keys(); in getValueNames()
/libcore/ojluni/src/test/java/util/HashMap/
DWhiteBoxResizeTest.java76 Object[] table(HashMap map) { in table() method in WhiteBoxResizeTest
83 return table(map).length; in capacity()
109 assertNull(table(map)); in capacityTestDefaultConstructor()
129 assertNull(table(map)); in capacityTestInitialCapacity()
/libcore/ojluni/src/main/java/jdk/random/
DXoroshiro128PlusPlus.java262 private void jumpAlgorithm(long[] table) { in jumpAlgorithm() argument
264 for (int i = 0; i < table.length; i++) { in jumpAlgorithm()
266 if ((table[i] & (1L << b)) != 0) { in jumpAlgorithm()
DXoshiro256PlusPlus.java288 private void jumpAlgorithm(long[] table) { in jumpAlgorithm() argument
290 for (int i = 0; i < table.length; i++) { in jumpAlgorithm()
292 if ((table[i] & (1L << b)) != 0) { in jumpAlgorithm()
/libcore/ojluni/src/main/java/java/sql/
DDatabaseMetaData.java1736 String table, String columnNamePattern) throws SQLException; in getColumnPrivileges() argument
1833 String table, int scope, boolean nullable) throws SQLException; in getBestRowIdentifier() argument
1944 String table) throws SQLException; in getVersionColumns() argument
2006 String table) throws SQLException; in getPrimaryKeys() argument
2084 String table) throws SQLException; in getImportedKeys() argument
2268 String table) throws SQLException; in getExportedKeys() argument
2554 ResultSet getIndexInfo(String catalog, String schema, String table, in getIndexInfo() argument
/libcore/luni/src/test/java/org/apache/harmony/security/tests/java/security/
DSecurity2Test.java104 private void addOrIncrementTable(Map<String, Integer> table, String k) { in addOrIncrementTable() argument
106 if (table.containsKey(key)) { in addOrIncrementTable()
107 int before = table.get(key); in addOrIncrementTable()
108 table.put(key, before + 1); in addOrIncrementTable()
110 table.put(key, 1); in addOrIncrementTable()
/libcore/luni/src/main/java/org/xml/sax/helpers/
DNamespaceSupport.java646 Hashtable table; in processName() local
653 table = attributeNameTable; in processName()
655 table = elementNameTable; in processName()
661 name = (String[])table.get(qName); in processName()
710 table.put(name[2], name); in processName()
/libcore/ojluni/src/main/java/java/util/zip/
DCRC32C.java110 for (int[] table : byteTables) {
111 for (int index = 0; index < table.length; index++) {
112 table[index] = Integer.reverseBytes(table[index]);
DZipFile.java1285 int next = table[hsh]; in checkAndAddEntry()
1286 table[hsh] = index; in checkAndAddEntry()
1302 private int[] table; // Hash chain heads: indexes into entries field in ZipFile.Source
1464 table = null; in close()
1643 int[] table = new int[tablelen]; in initCEN() local
1644 this.table = table; in initCEN()
1646 Arrays.fill(table, ZIP_ENDCHAIN); in initCEN()
1771 int idx = table[(hsh & 0x7fffffff) % tablelen]; in getEntryPos()
/libcore/ojluni/src/main/java/java/util/concurrent/
DConcurrentHashMap.java778 transient volatile Node<K,V>[] table; field in ConcurrentHashMap
937 if ((tab = table) != null && (n = tab.length) > 0 && in get()
981 if ((t = table) != null) { in containsValue()
1014 for (Node<K,V>[] tab = table;;) { in putVal()
1112 for (Node<K,V>[] tab = table;;) { in replaceNode()
1189 Node<K,V>[] tab = table; in clear()
1304 if ((t = table) != null) { in hashCode()
1325 int f = (t = table) == null ? 0 : t.length; in toString()
1361 int f = (t = table) == null ? 0 : t.length; in equals()
1425 if ((t = table) != null) { in writeObject()
[all …]
/libcore/ojluni/src/main/native/
Dzip_util.c555 free(zip->table); zip->table = NULL; in freeCEN()
608 jint *table; in readCEN() local
710 table = zip->table = malloc(tablelen * sizeof(table[0])); in readCEN()
714 if ((entries == NULL && total != 0) || table == NULL) goto Catch; in readCEN()
716 table[j] = ZIP_ENDCHAIN; in readCEN()
783 int chain = table[hsh]; in readCEN()
800 entries[i].next = table[hsh]; in readCEN()
801 table[hsh] = i; in readCEN()
1282 idx = zip->table[hsh % zip->tablelen]; in ZIP_GetEntry2()
1353 idx = zip->table[hsh % zip->tablelen]; in ZIP_GetEntry2()
Dzip_util.h230 jint *table; /* Hash chain heads: indexes into entries */ member
/libcore/ojluni/annotations/hiddenapi/java/lang/
DThreadLocal.java181 private java.lang.ThreadLocal.ThreadLocalMap.Entry[] table; field in ThreadLocal.ThreadLocalMap
/libcore/ojluni/src/main/java/java/math/
DBigInteger.java3136 int[][] table = new int[tblmask][]; in oddModPow() local
3138 table[i] = new int[modLen]; in oddModPow()
3155 table[0] = r.toIntArray(); in oddModPow()
3158 if (table[0].length < modLen) { in oddModPow()
3159 int offset = modLen - table[0].length; in oddModPow()
3161 System.arraycopy(table[0], 0, t2, offset, table[0].length); in oddModPow()
3162 table[0] = t2; in oddModPow()
3166 int[] b = montgomerySquare(table[0], mod, modLen, inv, null); in oddModPow()
3173 table[i] = montgomeryMultiply(t, table[i-1], mod, modLen, inv, null); in oddModPow()
3204 int[] mult = table[buf >>> 1]; in oddModPow()
[all …]
/libcore/luni/src/test/java/tests/java/sql/
DDatabaseMetaDataTest.java1853 String table = rs.getString("TABLE_NAME"); in crossCheckGetColumnsAndResultSetMetaData() local
1856 "SELECT * FROM " + schema+"."+table); in crossCheckGetColumnsAndResultSetMetaData()
1875 table, rs.getString("TABLE_NAME")); in crossCheckGetColumnsAndResultSetMetaData()
/libcore/tools/expected_upstream/
DREADME.md98 * The table has 3 columns, i.e.
/libcore/ojluni/annotations/hiddenapi/java/util/
DHashMap.java285 transient java.util.HashMap.Node<K, V>[] table; field in HashMap
/libcore/
DEXPECTED_UPSTREAM15 # This table has 3 columns, i.e.