/libcore/luni/src/main/java/java/lang/ |
H A D | ThreadLocal.java | 56 Object[] table = values.table; 58 if (this.reference == table[index]) { 59 return (T) table[index + 1]; 134 * (hash & (table.length - 1)) points to a key and not a value. 160 private Object[] table; field in class:ThreadLocal.Values 190 this.table = fromParent.table.clone(); 205 Object[] table = this.table; [all...] |
/libcore/luni/src/main/java/java/util/ |
H A D | ListResourceBundle.java | 29 HashMap<String, Object> table; field in class:ListResourceBundle 52 Iterator<String> local = table.keySet().iterator(); 64 if (!table.containsKey(next)) { 94 Iterator<String> it = table.keySet().iterator(); 113 return table.get(key); 117 if (table == null) { 119 table = new HashMap<String, Object>(contents.length / 3 * 4 + 3); 124 table.put((String) content[0], content[1]); 137 return table.keySet();
|
H A D | HashMap.java | 66 * An empty table shared by all zero-capacity maps (typically from default 69 * minimum-sized table. 87 * The hash table. If this hash map contains a mapping for null, it is 88 * not represented this hash table. 90 transient HashMapEntry<K, V>[] table; field in class:HashMap 109 * The table is rehashed when its size exceeds this threshold. 126 table = (HashMapEntry<K, V>[]) EMPTY_TABLE; 146 table = tab; 241 result.makeTable(table.length); 302 HashMapEntry<K, V>[] tab = table; [all...] |
H A D | Hashtable.java | 51 * An empty table shared by all zero-capacity maps (typically from default 54 * minimum-sized table. 72 * The hash table. 74 private transient HashtableEntry<K, V>[] table; field in class:Hashtable 88 * The table is rehashed when its size exceeds this threshold. 106 table = (HashtableEntry<K, V>[]) EMPTY_TABLE; 125 table = tab; 219 result.makeTable(table.length); 267 HashtableEntry<K, V>[] tab = table; 295 HashtableEntry<K, V>[] tab = table; [all...] |
H A D | LinkedHashMap.java | 177 * to the hash table (which is properly the province of our superclass). 182 * the resulting hash table corrupt. 193 // Create new entry, link it on to list, and put it into table 196 key, value, hash, table[index], header, oldTail); 197 table[index] = oldTail.nxt = header.prv = newTail; 209 // Create new entry, link it on to list, and put it into table 255 HashMapEntry<K, V>[] tab = table;
|
H A D | HashSet.java | 188 stream.writeInt(backingMap.table.length);
|
/libcore/support/src/test/java/org/apache/harmony/xnet/tests/support/ |
H A D | mySSLSession.java | 26 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/luni/src/main/java/java/sql/ |
H A D | DatabaseMetaData.java | 133 * key by some other table. Used for the column {@code UPDATE_RULE}. 223 * States that this table index is a clustered index. 228 * States that this table index is a hashed index. 233 * States this table's index is neither a clustered index, not a hashed 234 * index, and not a table statistics index; i.e. it is something else. 239 * States this column has the table's statistics, and that it is returned in 240 * conjunction with the table's index description. 351 * table 356 * States that the function does not return a table 361 * States that the function returns a table 584 getBestRowIdentifier(String catalog, String schema, String table, int scope, boolean nullable) argument 659 getColumnPrivileges(String catalog, String schema, String table, String columnNamePattern) argument 1022 getExportedKeys(String catalog, String schema, String table) argument 1131 getImportedKeys(String catalog, String schema, String table) argument 1203 getIndexInfo(String catalog, String schema, String table, boolean unique, boolean approximate) argument 1488 getPrimaryKeys(String catalog, String schema, String table) argument 2101 getVersionColumns(String catalog, String schema, String table) argument [all...] |
/libcore/luni/src/main/java/org/xml/sax/helpers/ |
H A D | NamespaceSupport.java | 645 Hashtable table; 650 // Select the appropriate table. 652 table = attributeNameTable; 654 table = elementNameTable; 660 name = (String[])table.get(qName); 709 table.put(name[2], name);
|
/libcore/luni/src/test/java/org/apache/harmony/security/tests/java/security/ |
H A D | Security2Test.java | 54 // to the allSupported table then increment the count of the 106 private void addOrIncrementTable(Map<String, Integer> table, String k) { argument 108 if (table.containsKey(key)) { 109 int before = table.get(key); 110 table.put(key, before + 1); 112 table.put(key, 1);
|
/libcore/luni/src/main/java/java/text/ |
H A D | DateFormat.java | 737 private static Hashtable<Integer, Field> table = new Hashtable<Integer, Field>(); field in class:DateFormat.Field 849 if (calendarField != -1 && table.get(Integer.valueOf(calendarField)) == null) { 850 table.put(Integer.valueOf(calendarField), this); 880 return table.get(Integer.valueOf(calendarField));
|
/libcore/luni/src/main/native/ |
H A D | libcore_icu_TimeZones.cpp | 126 std::vector<TimeZoneNames> table; local 143 table.push_back(row); 175 table.push_back(row); 184 for (size_t i = 0; i < table.size(); ++i) { 185 TimeZoneNames& row(table[i]);
|
/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | ConcurrentHashMap.java | 17 * A hash table supporting full concurrency of retrievals and 23 * and there is <em>not</em> any support for locking the entire table 35 * Enumerations return elements reflecting the state of the hash table 43 * table is internally partitioned to try to permit the indicated 47 * threads as will ever concurrently modify the table. Using a 54 * hash table is a relatively slow operation, so, when possible, it is 55 * a good idea to provide estimates of expected table sizes in 75 * The basic strategy is to subdivide the table among Segments, 76 * each of which itself is a concurrently readable hash table. To 80 * well as elements of segment's table mus 295 transient volatile HashEntry<K,V>[] table; field in class:ConcurrentHashMap.Segment [all...] |
/libcore/luni/src/test/java/tests/java/sql/ |
H A D | DatabaseMetaDataTest.java | 358 assertTrue("Invalid table name", Arrays.binarySearch( 378 assertTrue("Wrong table name", Arrays.binarySearch(tablesName, 393 assertTrue("Wrong table name", Arrays.binarySearch(tablesName, 462 assertEquals("Incorrect primary key table catalog", conn.getCatalog(), 464 assertEquals("Incorrect primary key table schema", "", rs 466 assertEquals("Incorrect primary key table name", 471 assertEquals("Incorrect foreign key table catalog", conn.getCatalog(), 473 assertEquals("Incorrect foreign key table schema", "", rs 475 assertEquals("Incorrect foreign key table name", 701 assertEquals("Incorrect primary key table catalo [all...] |
/libcore/luni/src/test/java/libcore/sqlite/ |
H A D | OldDatabaseTest.java | 75 this.statement.execute("drop table " + tableName); 78 // Create default test table 143 db.exec("create table AUX_TABLE", null); 208 args[0] = "table"; 223 db.exec("create table TEST5(id integer, firstname text, lastname text);", null); 229 db.exec("drop table TEST5;", null); 410 // set to fail immediately if table is locked. 469 //select from empty table 472 //fill table-> t 490 args[0] = "table"; 1071 busy(String table, int count) argument [all...] |