Cross Reference: /openjdk7/jdk/test/java/util/Map/Collisions.java

Lines Matching defs:keys
161                 Object[] keys = (Object[]) keys_desc[1];
163                     testMap(map, desc, keys);
171     private static <T> void testMap(Map<T, T> map, String keys_desc, T[] keys) {
174         testInsertion(map, keys_desc, keys);
176         if (keys[0] instanceof HashableInteger) {
177             testIntegerIteration((Map<HashableInteger, HashableInteger>) map, (HashableInteger[]) keys);
179             testStringIteration((Map<String, String>) map, (String[]) keys);
182         testContainsKey(map, keys_desc, keys);
184         testRemove(map, keys_desc, keys);
187         testInsertion(map, keys_desc, keys);
188         testKeysIteratorRemove(map, keys_desc, keys);
191         testInsertion(map, keys_desc, keys);
192         testValuesIteratorRemove(map, keys_desc, keys);
195         testInsertion(map, keys_desc, keys);
196         testEntriesIteratorRemove(map, keys_desc, keys);
201     private static <T> void testInsertion(Map<T, T> map, String keys_desc, T[] keys) {
204         for (int i = 0; i < keys.length; i++) {
207             check(String.format("insertion: put(%s[%d])", keys_desc, i), null == map.put(keys[i], keys[i]));
208             check(String.format("insertion: containsKey(%s[%d])", keys_desc, i), map.containsKey(keys[i]));
209             check(String.format("insertion: containsValue(%s[%d])", keys_desc, i), map.containsValue(keys[i]));
212         check(String.format("map expected size m%d != k%d", map.size(), keys.length),
213                 map.size() == keys.length);
216     private static void testIntegerIteration(Map<HashableInteger, HashableInteger> map, HashableInteger[] keys) {
217         check(String.format("map expected size m%d != k%d", map.size(), keys.length),
218                 map.size() == keys.length);
220         BitSet all = new BitSet(keys.length);
226         all.flip(0, keys.length);
227         check("Iteration: some keys not visited", all.isEmpty());
234         all.flip(0, keys.length);
235         check("Iteration: some keys not visited", all.isEmpty());
246     private static void testStringIteration(Map<String, String> map, String[] keys) {
247         check(String.format("map expected size m%d != k%d", map.size(), keys.length),
248                 map.size() == keys.length);
250         BitSet all = new BitSet(keys.length);
254             int index = key.hashCode() + (longKey ? keys.length / 2 : 0);
259         all.flip(0, keys.length);
260         check("some keys not visited", all.isEmpty());
264             int index = each.hashCode() + (longKey ? keys.length / 2 : 0);
269         all.flip(0, keys.length);
270         check("some keys not visited", all.isEmpty());
277         check(String.format("value count matches size m%d != k%d", map.size(), keys.length),
278                 map.size() == keys.length);
281     private static <T> void testContainsKey(Map<T, T> map, String keys_desc, T[] keys) {
282         for (int i = 0; i < keys.length; i++) {
283             T each = keys[i];
288     private static <T> void testRemove(Map<T, T> map, String keys_desc, T[] keys) {
289         check(String.format("remove: map expected size m%d != k%d", map.size(), keys.length),
290                 map.size() == keys.length);
292         for (int i = 0; i < keys.length; i++) {
293             T each = keys[i];
301     private static <T> void testKeysIteratorRemove(Map<T, T> map, String keys_desc, T[] keys) {
302         check(String.format("remove: map expected size m%d != k%d", map.size(), keys.length),
303                 map.size() == keys.length);
316     private static <T> void testValuesIteratorRemove(Map<T, T> map, String keys_desc, T[] keys) {
317         check(String.format("remove: map expected size m%d != k%d", map.size(), keys.length),
318                 map.size() == keys.length);
331     private static <T> void testEntriesIteratorRemove(Map<T, T> map, String keys_desc, T[] keys) {
332         check(String.format("remove: map expected size m%d != k%d", map.size(), keys.length),
333                 map.size() == keys.length);