Searched refs:k2 (Results 1 - 5 of 5) sorted by relevance
/libcore/jsr166-tests/src/test/java/jsr166/ |
H A D | EntryTest.java | 28 static final String k2 = "2"; field in class:EntryTest 93 Map.Entry e = new AbstractMap.SimpleEntry(k2, v1); 97 e = new AbstractMap.SimpleEntry(k2, v2); 101 Map.Entry s = new AbstractMap.SimpleImmutableEntry(k2, v1); 105 s = new AbstractMap.SimpleImmutableEntry(k2, v2); 117 e.setValue(k2); 118 assertEquals(k2, e.getValue()); 131 s.setValue(k2);
|
/libcore/luni/src/test/java/libcore/java/util/ |
H A D | CollectionsTest.java | 1409 Collections.emptyList().sort((k1, k2) -> 1); 1477 Collections.unmodifiableList(new ArrayList<>()).sort((k1, k2) -> 1); 1488 Collections.unmodifiableList(l).sort((k1, k2) -> 1); 1503 Collections.singletonList(1).sort((k1, k2) -> 2); 1650 private static<K,V> Map<K, V> createMap(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4) { argument 1653 result.put(k2, v2);
|
/libcore/luni/src/test/java/libcore/java/util/concurrent/ |
H A D | CopyOnWriteArrayListTest.java | 391 subList.sort((k1, k2) -> k1.compareTo(k2));
|
/libcore/ojluni/src/main/java/java/util/ |
H A D | WeakHashMap.java | 739 Object k2 = e.getKey(); 740 if (k1 == k2 || (k1 != null && k1.equals(k2))) {
|
H A D | TreeMap.java | 140 * <em>mutually comparable</em>: {@code k1.compareTo(k2)} must not throw 142 * {@code k2} in the map. If the user attempts to put a key into the 156 * k2)} must not throw a {@code ClassCastException} for any keys 157 * {@code k1} and {@code k2} in the map. If the user attempts to put 175 * <em>mutually comparable</em>: {@code k1.compareTo(k2)} must not throw 177 * {@code k2} in the map. This method runs in n*log(n) time. 1294 final int compare(Object k1, Object k2) { argument 1295 return comparator==null ? ((Comparable<? super K>)k1).compareTo((K)k2) 1296 : comparator.compare((K)k1, (K)k2);
|
Completed in 220 milliseconds