Lines Matching refs:map
15 * Returns a new map from Integers 1-5 to Strings "A"-"E".
18 TreeMap map = new TreeMap();
19 assertTrue(map.isEmpty());
20 map.put(one, "A");
21 map.put(five, "E");
22 map.put(three, "C");
23 map.put(two, "B");
24 map.put(four, "D");
25 assertFalse(map.isEmpty());
26 assertEquals(5, map.size());
27 return map;
34 TreeMap map = map5();
35 map.clear();
36 assertEquals(0, map.size());
40 * copy constructor creates map equal to source map
43 TreeMap map = map5();
44 TreeMap map2 = new TreeMap(map);
45 assertEquals(map, map2);
65 TreeMap map = map5();
66 assertTrue(map.containsKey(one));
67 assertFalse(map.containsKey(zero));
74 TreeMap map = map5();
75 assertTrue(map.containsValue("A"));
76 assertFalse(map.containsValue("Z"));
84 TreeMap map = map5();
85 assertEquals("A", (String)map.get(one));
91 * isEmpty is true of empty map and false for non-empty
95 TreeMap map = map5();
97 assertFalse(map.isEmpty());
104 TreeMap map = map5();
105 assertEquals(one, map.firstKey());
112 TreeMap map = map5();
113 assertEquals(five, map.lastKey());
120 TreeMap map = map5();
121 Set s = map.keySet();
133 TreeMap map = map5();
134 Set s = map.descendingKeySet();
146 TreeMap map = map5();
147 Set s = map.keySet();
160 TreeMap map = map5();
161 Set s = map.keySet();
179 TreeMap map = map5();
180 NavigableSet s = map.navigableKeySet();
198 TreeMap map = map5();
199 Set s = map.descendingKeySet();
217 TreeMap map = map5();
218 NavigableSet s = map.descendingKeySet();
236 TreeMap map = map5();
237 Collection s = map.values();
250 TreeMap map = map5();
251 Set s = map.entrySet();
269 TreeMap map = map5();
270 Set s = map.descendingMap().entrySet();
288 TreeMap map = map5();
289 Set s = map.entrySet();
293 assertTrue(map.containsKey(((Map.Entry)(ar[i])).getKey()));
294 assertTrue(map.containsValue(((Map.Entry)(ar[i])).getValue()));
302 TreeMap map = map5();
303 Set s = map.descendingMap().entrySet();
307 assertTrue(map.containsKey(((Map.Entry)(ar[i])).getKey()));
308 assertTrue(map.containsValue(((Map.Entry)(ar[i])).getValue()));
313 * putAll adds all key-value pairs from the given map
317 TreeMap map = map5();
318 empty.putAll(map);
328 * remove removes the correct key-value pair from the map
331 TreeMap map = map5();
332 map.remove(five);
333 assertEquals(4, map.size());
334 assertFalse(map.containsKey(five));
341 TreeMap map = map5();
342 Map.Entry e1 = map.lowerEntry(three);
345 Map.Entry e2 = map.lowerEntry(six);
348 Map.Entry e3 = map.lowerEntry(one);
351 Map.Entry e4 = map.lowerEntry(zero);
359 TreeMap map = map5();
360 Map.Entry e1 = map.higherEntry(three);
363 Map.Entry e2 = map.higherEntry(zero);
366 Map.Entry e3 = map.higherEntry(five);
369 Map.Entry e4 = map.higherEntry(six);
377 TreeMap map = map5();
378 Map.Entry e1 = map.floorEntry(three);
381 Map.Entry e2 = map.floorEntry(six);
384 Map.Entry e3 = map.floorEntry(one);
387 Map.Entry e4 = map.floorEntry(zero);
395 TreeMap map = map5();
396 Map.Entry e1 = map.ceilingEntry(three);
399 Map.Entry e2 = map.ceilingEntry(zero);
402 Map.Entry e3 = map.ceilingEntry(five);
405 Map.Entry e4 = map.ceilingEntry(six);
485 TreeMap map = map5();
486 Map.Entry e = map.pollFirstEntry();
489 e = map.pollFirstEntry();
491 map.put(one, "A");
492 e = map.pollFirstEntry();
495 e = map.pollFirstEntry();
497 map.remove(four);
498 e = map.pollFirstEntry();
504 e = map.pollFirstEntry();
512 TreeMap map = map5();
513 Map.Entry e = map.pollLastEntry();
516 e = map.pollLastEntry();
518 map.put(five, "E");
519 e = map.pollLastEntry();
522 e = map.pollLastEntry();
524 map.remove(two);
525 e = map.pollLastEntry();
531 e = map.pollLastEntry();
539 TreeMap map = map5();
542 assertEquals(5, map.size());
549 TreeMap map = map5();
550 String s = map.toString();
559 * get(null) of nonempty map throws NPE
570 * containsKey(null) of nonempty map throws NPE
581 * remove(null) throws NPE for nonempty map
593 * A deserialized map equals original
607 * subMap returns map with keys in requested range
610 TreeMap map = map5();
611 NavigableMap sm = map.subMap(two, true, four, false);
637 assertFalse(map.containsKey(two));
638 assertEquals(4, map.size());
644 assertEquals(3, map.size());
648 TreeMap map = map5();
649 NavigableMap sm = map.subMap(two, true, three, false);
671 assertFalse(map.containsKey(two));
672 assertEquals(4, map.size());
676 assertEquals(4, map.size());
680 * headMap returns map with keys in requested range
683 TreeMap map = map5();
684 NavigableMap sm = map.headMap(four, false);
701 assertEquals(2, map.size());
702 assertEquals(four, map.firstKey());
706 * headMap returns map with keys in requested range
709 TreeMap map = map5();
710 NavigableMap sm = map.tailMap(two, true);
760 assertEquals(4, map.size());
772 NavigableMap<Integer, Integer> map = newMap(cl);
775 populate(map, mapSize);
776 check(map, 0, mapSize - 1, true);
777 check(map.descendingMap(), 0, mapSize - 1, false);
779 mutateMap(map, 0, mapSize - 1);
780 check(map, 0, mapSize - 1, true);
781 check(map.descendingMap(), 0, mapSize - 1, false);
783 bashSubMap(map.subMap(0, true, mapSize, false),
795 void populate(NavigableMap<Integer, Integer> map, int limit) {
798 put(map, key);
802 void mutateMap(NavigableMap<Integer, Integer> map, int min, int max) {
803 int size = map.size();
808 remove(map, min - 5 + rnd.nextInt(rangeSize + 10));
812 for (Iterator<Integer> it = map.keySet().iterator(); it.hasNext(); ) {
820 while (map.size() < size) {
823 put(map, key);
827 void mutateSubMap(NavigableMap<Integer, Integer> map, int min, int max) {
828 int size = map.size();
833 remove(map, min - 5 + rnd.nextInt(rangeSize + 10));
837 for (Iterator<Integer> it = map.keySet().iterator(); it.hasNext(); ) {
845 while (map.size() < size) {
848 put(map, key);
851 map.put(key, 2 * key);
858 void put(NavigableMap<Integer, Integer> map, int key) {
859 if (map.put(key, 2 * key) == null)
863 void remove(NavigableMap<Integer, Integer> map, int key) {
864 if (map.remove(key) != null)
868 void bashSubMap(NavigableMap<Integer, Integer> map,
870 check(map, min, max, ascending);
871 check(map.descendingMap(), min, max, !ascending);
873 mutateSubMap(map, min, max);
874 check(map, min, max, ascending);
875 check(map.descendingMap(), min, max, !ascending);
884 NavigableMap<Integer,Integer> hm = map.headMap(midPoint, incl);
901 NavigableMap<Integer,Integer> tm = map.tailMap(midPoint,incl);
926 NavigableMap<Integer,Integer> sm = map.subMap(
935 NavigableMap<Integer,Integer> sm = map.subMap(
949 void check(NavigableMap<Integer, Integer> map,
1013 assertEquals(bsContainsI, map.containsKey(i));
1017 assertEquals(size, map.size());
1022 for (int key : map.keySet()) {
1033 assertEq(map.lowerKey(key), rs.lower(key));
1034 assertEq(map.floorKey(key), rs.floor(key));
1035 assertEq(map.higherKey(key), rs.higher(key));
1036 assertEq(map.ceilingKey(key), rs.ceiling(key));
1040 if (map.size() != 0) {
1041 assertEq(map.firstKey(), rs.first());
1042 assertEq(map.lastKey(), rs.last());
1047 map.firstKey();
1051 map.lastKey();