| /libcore/ojluni/src/main/java/java/util/ |
| H A D | SortedMap.java | 216 K firstKey(); method in interface:SortedMap
|
| H A D | TreeSet.java | 394 return m.firstKey();
|
| H A D | Collections.java | 1850 public K firstKey() { return sm.firstKey(); } method in class:Collections.UnmodifiableSortedMap
2828 public K firstKey() { method in class:Collections.SynchronizedSortedMap
2829 synchronized (mutex) {return sm.firstKey();}
4020 public K firstKey() { return sm.firstKey(); } method in class:Collections.CheckedSortedMap
4094 public K firstKey() { return nm.firstKey(); } method in class:Collections.CheckedNavigableMap
|
| H A D | TreeMap.java | 290 public K firstKey() { method in class:TreeMap
1144 public E first() { return m.firstKey(); }
1566 public final K firstKey() { method in class:TreeMap.NavigableSubMap
2057 public K firstKey() { throw new InternalError(); } method in class:TreeMap.SubMap
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| H A D | SortedMapTestBase.java | 155 int key = ref.tailMap((ref.firstKey() + ref.lastKey()) / 2)
156 .firstKey();
188 assertEquals(ref.firstKey(), map.firstKey());
229 int firstKey = ref.firstKey();
234 assertEquals(ref.get(firstKey), map.get(firstKey));
298 assertEquals(ref.firstKey(), map.firstKey());
[all...] |
| H A D | RefSortedMap.java | 115 bsearch(SubMap.this.firstKey()) - 1 :
154 int firstIdx = bsearch(SubMap.this.firstKey());
170 public K firstKey() { method in class:RefSortedMap.SubMap
172 K res = RefSortedMap.this.firstKey();
271 return tailMap(firstKey()).entrySet();
274 public K firstKey() { method in class:RefSortedMap
283 return tailMap(firstKey()).keySet();
299 return tailMap(firstKey()).values();
|
| H A D | TreeMapTest.java | 115 assertTrue("TreeMap does not use comparator (firstKey was incorrect)",
116 reversedTreeMap.firstKey().equals(new Integer(2).toString()));
147 assertTrue("TreeMap does not use comparator (firstKey was incorrect)",
148 anotherTreeMap.firstKey().equals(new Integer(2).toString()));
211 assertTrue("TreeMap does not use comparator (firstKey was incorrect)",
212 reversedTreeMap.firstKey().equals(new Integer(2).toString()));
257 * java.util.TreeMap#firstKey()
260 // Test for method java.lang.Object java.util.TreeMap.firstKey()
261 assertEquals("Returned incorrect first key", "0", tm.firstKey());
362 sub.firstKey();
[all...] |
| H A D | TreeMapExtendTest.java | 84 treeMap.firstKey();
135 assertEquals(tm.firstKey(), treeMap.firstKey());
156 assertEquals(subMap_default.firstKey(), treeMap.firstKey());
349 assertEquals(firstKey1, subMap_default.firstKey());
350 assertEquals(firstKey2, subMap_startExcluded_endExcluded.firstKey());
351 assertEquals(firstKey2, subMap_startExcluded_endIncluded.firstKey());
352 assertEquals(firstKey1, subMap_startIncluded_endExcluded.firstKey());
353 assertEquals(firstKey1, subMap_startIncluded_endIncluded.firstKey());
[all...] |
| /libcore/luni/src/test/java/libcore/java/util/ |
| H A D | OldAndroidTreeMapTest.java | 66 if (SPEW) System.out.println("tm.firstKey() = " + tm.firstKey());
70 assertEquals(minVal, tm.firstKey().intValue());
|
| H A D | OldTreeMapTest.java | 98 assertTrue("TreeMap does not use comparator (firstKey was incorrect)",
99 reversedTreeMap.firstKey().equals(new Integer(2).toString()));
142 assertTrue("TreeMap does not use comparator (firstKey was incorrect)",
143 anotherTreeMap.firstKey().equals(new Integer(2).toString()));
177 // Test for method java.lang.Object java.util.TreeMap.firstKey()
178 assertEquals("Returned incorrect first key", "0", tm.firstKey());
181 tm.firstKey();
|
| H A D | CollectionsTest.java | 909 assertEquals(ceiling, floor == null ? map.firstKey() : map.higherKey(floor));
|
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| H A D | TreeSubMapTest.java | 141 * firstKey returns first key
145 assertEquals(one, map.firstKey());
460 assertEquals(two, sm.firstKey());
481 assertEquals(three, sm.firstKey());
492 assertEquals(two, sm.firstKey());
538 assertEquals(four, map.firstKey());
581 assertEquals(four, ssm.firstKey());
651 * firstKey returns first key
655 assertEquals(m1, map.firstKey());
987 assertEquals(m2, sm.firstKey());
[all...] |
| H A D | ConcurrentSkipListSubMapTest.java | 142 * firstKey returns first key
146 assertEquals(one, map.firstKey());
625 assertEquals(two, sm.firstKey());
646 assertEquals(three, sm.firstKey());
657 assertEquals(two, sm.firstKey());
703 assertEquals(four, map.firstKey());
746 assertEquals(four, ssm.firstKey());
816 * firstKey returns first key
820 assertEquals(m1, map.firstKey());
1299 assertEquals(m2, sm.firstKey());
[all...] |
| H A D | ConcurrentSkipListMapTest.java | 123 * firstKey returns first key
127 assertEquals(one, map.firstKey());
828 assertEquals(two, sm.firstKey());
856 assertEquals(three, sm.firstKey());
867 assertEquals(two, sm.firstKey());
918 assertEquals(four, map.firstKey());
971 assertEquals(four, ssm.firstKey());
1257 assertEq(map.firstKey(), rs.first());
1263 map.firstKey();
|
| H A D | TreeMapTest.java | 122 * firstKey returns first key
126 assertEquals(one, map.firstKey());
633 assertEquals(two, sm.firstKey());
661 assertEquals(three, sm.firstKey());
672 assertEquals(two, sm.firstKey());
723 assertEquals(four, map.firstKey());
776 assertEquals(four, ssm.firstKey());
1062 assertEq(map.firstKey(), rs.first());
1068 map.firstKey();
|
| /libcore/ojluni/src/main/java/java/lang/ |
| H A D | ThreadLocal.java | 361 * Construct a new map initially containing (firstKey, firstValue).
365 ThreadLocalMap(ThreadLocal<?> firstKey, Object firstValue) { argument
367 int i = firstKey.threadLocalHashCode & (INITIAL_CAPACITY - 1);
368 table[i] = new Entry(firstKey, firstValue);
|
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| H A D | ConcurrentSkipListSet.java | 398 return m.firstKey();
|
| H A D | ConcurrentSkipListMap.java | 2028 public K firstKey() { method in class:ConcurrentSkipListMap
2373 public K first() { return m.firstKey(); }
3025 public K firstKey() { method in class:ConcurrentSkipListMap.SubMap
|