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
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
|
/*
* Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package java.util;
import android.compat.annotation.UnsupportedAppUsage;
@SuppressWarnings({"unchecked", "deprecation", "all"})
public class LinkedHashMap<K, V> extends java.util.HashMap<K, V> implements java.util.Map<K, V> {
public LinkedHashMap(int initialCapacity, float loadFactor) {
throw new RuntimeException("Stub!");
}
public LinkedHashMap(int initialCapacity) {
throw new RuntimeException("Stub!");
}
public LinkedHashMap() {
throw new RuntimeException("Stub!");
}
public LinkedHashMap(java.util.Map<? extends K, ? extends V> m) {
throw new RuntimeException("Stub!");
}
public LinkedHashMap(int initialCapacity, float loadFactor, boolean accessOrder) {
throw new RuntimeException("Stub!");
}
private void linkNodeLast(java.util.LinkedHashMap.LinkedHashMapEntry<K, V> p) {
throw new RuntimeException("Stub!");
}
private void transferLinks(
java.util.LinkedHashMap.LinkedHashMapEntry<K, V> src,
java.util.LinkedHashMap.LinkedHashMapEntry<K, V> dst) {
throw new RuntimeException("Stub!");
}
void reinitialize() {
throw new RuntimeException("Stub!");
}
java.util.HashMap.Node<K, V> newNode(int hash, K key, V value, java.util.HashMap.Node<K, V> e) {
throw new RuntimeException("Stub!");
}
java.util.HashMap.Node<K, V> replacementNode(
java.util.HashMap.Node<K, V> p, java.util.HashMap.Node<K, V> next) {
throw new RuntimeException("Stub!");
}
java.util.HashMap.TreeNode<K, V> newTreeNode(
int hash, K key, V value, java.util.HashMap.Node<K, V> next) {
throw new RuntimeException("Stub!");
}
java.util.HashMap.TreeNode<K, V> replacementTreeNode(
java.util.HashMap.Node<K, V> p, java.util.HashMap.Node<K, V> next) {
throw new RuntimeException("Stub!");
}
void afterNodeRemoval(java.util.HashMap.Node<K, V> e) {
throw new RuntimeException("Stub!");
}
void afterNodeInsertion(boolean evict) {
throw new RuntimeException("Stub!");
}
void afterNodeAccess(java.util.HashMap.Node<K, V> e) {
throw new RuntimeException("Stub!");
}
void internalWriteEntries(java.io.ObjectOutputStream s) throws java.io.IOException {
throw new RuntimeException("Stub!");
}
public boolean containsValue(java.lang.Object value) {
throw new RuntimeException("Stub!");
}
public V get(java.lang.Object key) {
throw new RuntimeException("Stub!");
}
public V getOrDefault(java.lang.Object key, V defaultValue) {
throw new RuntimeException("Stub!");
}
public void clear() {
throw new RuntimeException("Stub!");
}
@UnsupportedAppUsage
public java.util.Map.Entry<K, V> eldest() {
throw new RuntimeException("Stub!");
}
protected boolean removeEldestEntry(java.util.Map.Entry<K, V> eldest) {
throw new RuntimeException("Stub!");
}
public java.util.Set<K> keySet() {
throw new RuntimeException("Stub!");
}
public java.util.Collection<V> values() {
throw new RuntimeException("Stub!");
}
public java.util.Set<java.util.Map.Entry<K, V>> entrySet() {
throw new RuntimeException("Stub!");
}
public void forEach(java.util.function.BiConsumer<? super K, ? super V> action) {
throw new RuntimeException("Stub!");
}
public void replaceAll(
java.util.function.BiFunction<? super K, ? super V, ? extends V> function) {
throw new RuntimeException("Stub!");
}
@UnsupportedAppUsage
final boolean accessOrder;
{
accessOrder = false;
}
transient java.util.LinkedHashMap.LinkedHashMapEntry<K, V> head;
private static final long serialVersionUID = 3801124242820219131L; // 0x34c04e5c106cc0fbL
transient java.util.LinkedHashMap.LinkedHashMapEntry<K, V> tail;
@SuppressWarnings({"unchecked", "deprecation", "all"})
final class LinkedEntryIterator extends java.util.LinkedHashMap.LinkedHashIterator
implements java.util.Iterator<java.util.Map.Entry<K, V>> {
public java.util.Map.Entry<K, V> next() {
throw new RuntimeException("Stub!");
}
}
@SuppressWarnings({"unchecked", "deprecation", "all"})
final class LinkedEntrySet extends java.util.AbstractSet<java.util.Map.Entry<K, V>> {
LinkedEntrySet() {
throw new RuntimeException("Stub!");
}
public int size() {
throw new RuntimeException("Stub!");
}
public void clear() {
throw new RuntimeException("Stub!");
}
public java.util.Iterator<java.util.Map.Entry<K, V>> iterator() {
throw new RuntimeException("Stub!");
}
public boolean contains(java.lang.Object o) {
throw new RuntimeException("Stub!");
}
public boolean remove(java.lang.Object o) {
throw new RuntimeException("Stub!");
}
public java.util.Spliterator<java.util.Map.Entry<K, V>> spliterator() {
throw new RuntimeException("Stub!");
}
public void forEach(java.util.function.Consumer<? super java.util.Map.Entry<K, V>> action) {
throw new RuntimeException("Stub!");
}
}
@SuppressWarnings({"unchecked", "deprecation", "all"})
abstract class LinkedHashIterator {
LinkedHashIterator() {
throw new RuntimeException("Stub!");
}
public final boolean hasNext() {
throw new RuntimeException("Stub!");
}
final java.util.LinkedHashMap.LinkedHashMapEntry<K, V> nextNode() {
throw new RuntimeException("Stub!");
}
public final void remove() {
throw new RuntimeException("Stub!");
}
java.util.LinkedHashMap.LinkedHashMapEntry<K, V> current;
int expectedModCount;
java.util.LinkedHashMap.LinkedHashMapEntry<K, V> next;
}
@SuppressWarnings({"unchecked", "deprecation", "all"})
static class LinkedHashMapEntry<K, V> extends java.util.HashMap.Node<K, V> {
LinkedHashMapEntry(int hash, K key, V value, java.util.HashMap.Node<K, V> next) {
super(0, null, null, null);
throw new RuntimeException("Stub!");
}
java.util.LinkedHashMap.LinkedHashMapEntry<K, V> after;
java.util.LinkedHashMap.LinkedHashMapEntry<K, V> before;
}
@SuppressWarnings({"unchecked", "deprecation", "all"})
final class LinkedKeyIterator extends java.util.LinkedHashMap.LinkedHashIterator
implements java.util.Iterator<K> {
public K next() {
throw new RuntimeException("Stub!");
}
}
@SuppressWarnings({"unchecked", "deprecation", "all"})
final class LinkedKeySet extends java.util.AbstractSet<K> {
LinkedKeySet() {
throw new RuntimeException("Stub!");
}
public int size() {
throw new RuntimeException("Stub!");
}
public void clear() {
throw new RuntimeException("Stub!");
}
public java.util.Iterator<K> iterator() {
throw new RuntimeException("Stub!");
}
public boolean contains(java.lang.Object o) {
throw new RuntimeException("Stub!");
}
public boolean remove(java.lang.Object key) {
throw new RuntimeException("Stub!");
}
public java.util.Spliterator<K> spliterator() {
throw new RuntimeException("Stub!");
}
public void forEach(java.util.function.Consumer<? super K> action) {
throw new RuntimeException("Stub!");
}
}
@SuppressWarnings({"unchecked", "deprecation", "all"})
final class LinkedValueIterator extends java.util.LinkedHashMap.LinkedHashIterator
implements java.util.Iterator<V> {
public V next() {
throw new RuntimeException("Stub!");
}
}
@SuppressWarnings({"unchecked", "deprecation", "all"})
final class LinkedValues extends java.util.AbstractCollection<V> {
LinkedValues() {
throw new RuntimeException("Stub!");
}
public int size() {
throw new RuntimeException("Stub!");
}
public void clear() {
throw new RuntimeException("Stub!");
}
public java.util.Iterator<V> iterator() {
throw new RuntimeException("Stub!");
}
public boolean contains(java.lang.Object o) {
throw new RuntimeException("Stub!");
}
public java.util.Spliterator<V> spliterator() {
throw new RuntimeException("Stub!");
}
public void forEach(java.util.function.Consumer<? super V> action) {
throw new RuntimeException("Stub!");
}
}
}
|
