DistinctEntrySetElements.java revision 4248
0N/A/*
0N/A * Copyright (c) 2011, Oracle and/or its affiliates. All rights reserved.
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
0N/A * published by the Free Software Foundation.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
0N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
0N/A * or visit www.oracle.com if you need additional information or have any
0N/A * questions.
0N/A */
0N/A
0N/A/*
0N/A * Portions Copyright (c) 2011 IBM Corporation
0N/A */
0N/A
0N/A/*
0N/A * @test
0N/A * @bug 6312706
0N/A * @summary Sets from Map.entrySet() return distinct objects for each Entry
0N/A * @author Neil Richards <neil.richards@ngmr.net>, <neil_richards@uk.ibm.com>
0N/A */
0N/A
0N/Aimport java.util.IdentityHashMap;
0N/Aimport java.util.HashSet;
0N/Aimport java.util.Map;
0N/Aimport java.util.Set;
0N/A
0N/Apublic class DistinctEntrySetElements {
0N/A public static void main(String[] args) throws Exception {
0N/A final IdentityHashMap<String, String> identityHashMap =
0N/A new IdentityHashMap<>();
0N/A
0N/A identityHashMap.put("One", "Un");
0N/A identityHashMap.put("Two", "Deux");
0N/A identityHashMap.put("Three", "Trois");
0N/A
Set<Map.Entry<String, String>> entrySet = identityHashMap.entrySet();
HashSet<Map.Entry<String, String>> hashSet = new HashSet<>(entrySet);
// NB: These comparisons are valid in this case because none of the
// keys put into 'identityHashMap' above are equal to any other.
if (false == hashSet.equals(entrySet)) {
throw new RuntimeException("Test FAILED: Sets are not equal.");
}
if (hashSet.hashCode() != entrySet.hashCode()) {
throw new RuntimeException("Test FAILED: Set's hashcodes are not equal.");
}
}
}