< prev index next >

test/jdk/java/util/Map/InPlaceOpsCollisions.java

Print this page




 506                 String.format("map expected size m%d != k%d", map.size(), keys.length - removes));
 507     }
 508 
 509     /*
 510      * Re-map the odd-numbered keys to map to the EXTRA value
 511      */
 512     private static <T> void remapOddKeys(Map<T, T> map, T[] keys, T val) {
 513         for (int i = 0; i < keys.length; i++) {
 514             if (i % 2 != 0) {
 515                 map.put(keys[i], val);
 516             }
 517         }
 518     }
 519 
 520     @DataProvider
 521     public Iterator<Object[]> nullValueFriendlyMaps() {
 522         return Arrays.asList(
 523                 new Object[]{"HashMap", (Supplier<Map<?, ?>>) HashMap::new},
 524                 new Object[]{"LinkedHashMap", (Supplier<Map<?, ?>>) LinkedHashMap::new},
 525                 new Object[]{"TreeMap", (Supplier<Map<?, ?>>) TreeMap::new},
 526                 new Object[]{"TreeMap(cmp)", (Supplier<Map<?, ?>>) () -> new TreeMap<>(Comparator.reverseOrder())}

 527         ).iterator();
 528     }
 529 }


 506                 String.format("map expected size m%d != k%d", map.size(), keys.length - removes));
 507     }
 508 
 509     /*
 510      * Re-map the odd-numbered keys to map to the EXTRA value
 511      */
 512     private static <T> void remapOddKeys(Map<T, T> map, T[] keys, T val) {
 513         for (int i = 0; i < keys.length; i++) {
 514             if (i % 2 != 0) {
 515                 map.put(keys[i], val);
 516             }
 517         }
 518     }
 519 
 520     @DataProvider
 521     public Iterator<Object[]> nullValueFriendlyMaps() {
 522         return Arrays.asList(
 523                 new Object[]{"HashMap", (Supplier<Map<?, ?>>) HashMap::new},
 524                 new Object[]{"LinkedHashMap", (Supplier<Map<?, ?>>) LinkedHashMap::new},
 525                 new Object[]{"TreeMap", (Supplier<Map<?, ?>>) TreeMap::new},
 526                 new Object[]{"TreeMap(cmp)", (Supplier<Map<?, ?>>) () -> new TreeMap<>(Comparator.reverseOrder())},
 527                 new Object[]{"TreeMap.descendingMap", (Supplier<Map<?, ?>>) () -> new TreeMap<>().descendingMap()}
 528         ).iterator();
 529     }
 530 }
< prev index next >