1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
|
/*
* Copyright 2000-2014 JetBrains s.r.o.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.intellij.codeInspection;
import com.intellij.openapi.util.Comparing;
import com.intellij.util.IncorrectOperationException;
import com.intellij.util.SingletonSet;
import gnu.trove.THashMap;
import gnu.trove.TObjectFunction;
import gnu.trove.TObjectObjectProcedure;
import gnu.trove.TObjectProcedure;
import org.jetbrains.annotations.NotNull;
import java.util.AbstractMap;
import java.util.Collection;
import java.util.Map;
import java.util.Set;
/**
* Hash set (based on THashSet) which is fast when contains one or zero elements (avoids to calculate hash codes and call equals whenever possible).
* For other sizes it delegates to THashSet.
* Null keys are NOT PERMITTED.
*/
public class SmartHashMap<K,V> extends THashMap<K,V> {
private K theKey; // contains the only element if size() == 1
private V theValue;
@Override
public boolean containsKey(@NotNull Object key) {
K theKey = this.theKey;
if (theKey != null) {
return eq(theKey, (K)key);
}
return !super.isEmpty() && super.containsKey(key);
}
@Override
public V put(@NotNull K key, V value) {
K theKey = this.theKey;
if (theKey != null) {
if (eq(theKey, key)) return theValue;
super.put(theKey, theValue);
this.theKey = null;
// fallthrough
}
else if (super.isEmpty()) {
this.theKey = key;
theValue = value;
return null;
}
return super.put(key, value);
}
private boolean eq(K obj, K theKey) {
return theKey == obj || _hashingStrategy.equals(theKey, obj);
}
@Override
public boolean equals(@NotNull Object other) {
K theKey = this.theKey;
if (theKey != null) {
if (!(other instanceof Map) || ((Map)other).size() != 1 ) return false;
Map.Entry<K, V> entry = ((Map<K, V>)other).entrySet().iterator().next();
return eq(theKey, entry.getKey()) && Comparing.equal(theValue, entry.getValue());
}
return super.equals(other);
}
@Override
public int hashCode() {
K theKey = this.theKey;
if (theKey != null) {
return _hashingStrategy.computeHashCode(theKey);
}
return super.hashCode();
}
@Override
public void clear() {
theKey = null;
theValue = null;
super.clear();
}
@Override
public int size() {
K theKey = this.theKey;
if (theKey != null) {
return 1;
}
return super.size();
}
@Override
public boolean isEmpty() {
K theKey = this.theKey;
return theKey == null && super.isEmpty();
}
@Override
public V remove(@NotNull Object obj) {
K theKey = this.theKey;
if (theKey != null) {
if (eq(theKey, (K)obj)) {
this.theKey = null;
V value = theValue;
theValue = null;
return value;
}
return null;
}
return super.remove(obj);
}
@NotNull
@Override
public Set<K> keySet() {
K theKey = this.theKey;
if (theKey != null) {
return new SingletonSet<K>(theKey);
}
return super.keySet();
}
@NotNull
@Override
public Collection<V> values() {
K theKey = this.theKey;
if (theKey != null) {
return new SingletonSet<V>(theValue);
}
return super.values();
}
@NotNull
@Override
public Set<Map.Entry<K, V>> entrySet() {
K theKey = this.theKey;
if (theKey != null) {
return new SingletonSet<Map.Entry<K, V>>(new AbstractMap.SimpleEntry<K, V>(theKey, theValue));
}
return super.entrySet();
}
@Override
public V get(Object key) {
K theKey = this.theKey;
if (theKey != null) {
return eq(theKey, (K)key) ? theValue : null;
}
return super.get(key);
}
@Override
public boolean containsValue(Object val) {
K theKey = this.theKey;
if (theKey != null) {
return Comparing.equal(theValue, val);
}
return super.containsValue(val);
}
@Override
public THashMap<K, V> clone() {
throw new IncorrectOperationException();
}
@Override
public void transformValues(TObjectFunction<V, V> function) {
throw new IncorrectOperationException();
}
@Override
public boolean retainEntries(TObjectObjectProcedure<K, V> procedure) {
throw new IncorrectOperationException();
}
@Override
public boolean forEachEntry(TObjectObjectProcedure<K, V> procedure) {
throw new IncorrectOperationException();
}
@Override
public boolean forEachValue(TObjectProcedure<V> procedure) {
throw new IncorrectOperationException();
}
@Override
public boolean forEachKey(TObjectProcedure<K> procedure) {
throw new IncorrectOperationException();
}
}
|
