Searched refs:map (Results 76 - 82 of 82) sorted by relevance
1234
/libcore/json/src/test/java/org/json/ |
H A D | JSONObjectTest.java | 601 // array elements are converted to strings to do name lookups on the map! 992 Map<String, Object> map = new TreeMap<String, Object>(); 993 map.put("x", "l"); 994 map.put("y", list); 995 assertEquals("{\"x\":\"l\",\"y\":[\"a\",[]]}", new JSONObject(map).toString());
|
/libcore/luni/src/test/java/libcore/java/util/ |
H A D | OldCollectionsTest.java | 174 fail("Assert 0: synchronizedMap(map) must throw NPE"); 724 private void assertSerialized(Map<?, ?> map, String s) { argument 725 new SerializationTester<Map<?, ?>>(map, s) {
|
/libcore/luni/src/main/java/java/util/ |
H A D | TreeMap.java | 30 * A map whose entries are sorted by their keys. All optional operations such as 33 * <p>This map sorts keys using either a user-supplied comparator or the key's 37 * this map. If a user-supplied comparator is in use, it will be returned 43 * this map. In this case {@link #comparator} will return null. 52 * Map}. Consider a tree map of case-insensitive strings, an ordering that is 54 * TreeMap<String, String> map = new TreeMap<String, String>(String.CASE_INSENSITIVE_ORDER); 55 * map.put("a", "android"); 61 * System.out.println(map.get("A")); 82 * Create a natural order, empty tree map whose keys must be mutually 91 * Create a natural order tree map populate [all...] |
/libcore/luni/src/test/java/libcore/java/sql/ |
H A D | OldPreparedStatementTest.java | 2272 public Object getObject(Map<String, Class<?>> map) throws SQLException { argument 2289 public Object getArray(long index, int count, Map<String, Class<?>> map) argument 2294 public Object getArray(Map<String, Class<?>> map) throws SQLException { argument 2316 Map<String, Class<?>> map) throws SQLException { 2320 public ResultSet getResultSet(Map<String, Class<?>> map) argument 2315 getResultSet(long index, int count, Map<String, Class<?>> map) argument
|
/libcore/luni/src/test/java/libcore/javax/crypto/ |
H A D | CipherTest.java | 387 private static void setExpectedSize(Map<String, Integer> map, argument 390 map.put(algorithm, value); 393 private static void setExpectedSize(Map<String, Integer> map, argument 395 setExpectedSize(map, modeKey(algorithm, mode), value); 398 private static void setExpectedSize(Map<String, Integer> map, argument 400 setExpectedSize(map, modeProviderKey(algorithm, mode, provider), value); 403 private static int getExpectedSize(Map<String, Integer> map, String algorithm, int mode, String provider) { argument 406 Integer expected = map.get(modeProviderKey(algorithm, mode, provider)); 410 expected = map.get(modeKey(algorithm, mode)); 414 expected = map [all...] |
/libcore/luni/src/test/java/libcore/java/nio/ |
H A D | BufferTest.java | 49 MappedByteBuffer result = ch.map(FileChannel.MapMode.READ_WRITE, 0, size); 61 MappedByteBuffer mbb = raf.getChannel().map(FileChannel.MapMode.READ_ONLY, 0, 65536); 87 .map(FileChannel.MapMode.READ_WRITE, 65536, 131072); 284 // allocate/allocateDirect/map always returns a big-endian buffer.
|
/libcore/benchmarks/src/benchmarks/regression/ |
H A D | ByteBufferBenchmark.java | 68 result = fc.map(FileChannel.MapMode.READ_WRITE, 0, fc.size());
|
Completed in 277 milliseconds
1234