1 /*
2  * Copyright (c) 2011, Oracle and/or its affiliates. All rights reserved.
3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4  *
5  * This code is free software; you can redistribute it and/or modify it
6  * under the terms of the GNU General Public License version 2 only, as
7  * published by the Free Software Foundation.
8  *
9  * This code is distributed in the hope that it will be useful, but WITHOUT
10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
12  * version 2 for more details (a copy is included in the LICENSE file that
13  * accompanied this code).
14  *
15  * You should have received a copy of the GNU General Public License version
16  * 2 along with this work; if not, write to the Free Software Foundation,
17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18  *
19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20  * or visit www.oracle.com if you need additional information or have any
21  * questions.
22  */
23 
24 /*
25  * Portions Copyright (c) 2011 IBM Corporation
26  */
27 
28 /*
29  * @test
30  * @bug 6312706
31  * @summary Sets from Map.entrySet() return distinct objects for each Entry
32  * @author Neil Richards <neil.richards@ngmr.net>, <neil_richards@uk.ibm.com>
33  */
34 
35 import java.util.concurrent.ConcurrentHashMap;
36 import java.util.HashSet;
37 import java.util.Map;
38 import java.util.Set;
39 
40 public class DistinctEntrySetElements {
main(String[] args)41     public static void main(String[] args) throws Exception {
42         final ConcurrentHashMap<String, String> concurrentHashMap =
43             new ConcurrentHashMap<>();
44 
45         concurrentHashMap.put("One", "Un");
46         concurrentHashMap.put("Two", "Deux");
47         concurrentHashMap.put("Three", "Trois");
48 
49         Set<Map.Entry<String, String>> entrySet = concurrentHashMap.entrySet();
50         HashSet<Map.Entry<String, String>> hashSet = new HashSet<>(entrySet);
51 
52         if (false == hashSet.equals(entrySet)) {
53             throw new RuntimeException("Test FAILED: Sets are not equal.");
54         }
55         if (hashSet.hashCode() != entrySet.hashCode()) {
56             throw new RuntimeException("Test FAILED: Set's hashcodes are not equal.");
57         }
58     }
59 }
60