1 package sun.awt; 2 3 import java.lang.ref.Reference; 4 import java.lang.ref.ReferenceQueue; 5 import java.lang.ref.WeakReference; 6 import java.util.*; 7 8 // A weak key reference hash map that uses System.identityHashCode() and "==" 9 // instead of hashCode() and equals(Object) 10 class WeakIdentityHashMap<K, V> implements Map<K, V> { 11 private final Map<WeakKey<K>, V> map; 12 private final transient ReferenceQueue<K> queue = new ReferenceQueue<K>(); 13 14 /** 15 * Constructs a new, empty identity hash map with a default initial 16 * size (16). 17 */ 18 public WeakIdentityHashMap() { 19 map = new HashMap<>(16); 20 } | 1 /* 2 * Copyright (c) 2015, 2018, 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. Oracle designates this 8 * particular file as subject to the "Classpath" exception as provided 9 * by Oracle in the LICENSE file that accompanied this code. 10 * 11 * This code is distributed in the hope that it will be useful, but WITHOUT 12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 14 * version 2 for more details (a copy is included in the LICENSE file that 15 * accompanied this code). 16 * 17 * You should have received a copy of the GNU General Public License version 18 * 2 along with this work; if not, write to the Free Software Foundation, 19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 20 * 21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 22 * or visit www.oracle.com if you need additional information or have any 23 * questions. 24 */ 25 26 package sun.awt; 27 28 import java.lang.ref.Reference; 29 import java.lang.ref.ReferenceQueue; 30 import java.lang.ref.WeakReference; 31 import java.util.*; 32 33 // A weak key reference hash map that uses System.identityHashCode() and "==" 34 // instead of hashCode() and equals(Object) 35 class WeakIdentityHashMap<K, V> implements Map<K, V> { 36 private final Map<WeakKey<K>, V> map; 37 private final transient ReferenceQueue<K> queue = new ReferenceQueue<K>(); 38 39 /** 40 * Constructs a new, empty identity hash map with a default initial 41 * size (16). 42 */ 43 public WeakIdentityHashMap() { 44 map = new HashMap<>(16); 45 } |