-
Notifications
You must be signed in to change notification settings - Fork 2k
Expand file tree
/
Copy pathArrayMap.java
More file actions
40 lines (37 loc) · 1.68 KB
/
Copy pathArrayMap.java
File metadata and controls
40 lines (37 loc) · 1.68 KB
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
// Generated automatically from android.util.ArrayMap for testing purposes
package android.util;
import java.util.Collection;
import java.util.Map;
import java.util.Set;
public class ArrayMap<K, V> implements java.util.Map<K, V>
{
public ArrayMap(){}
public ArrayMap(ArrayMap<K, V> p0){}
public ArrayMap(int p0){}
public K keyAt(int p0){ return null; }
public String toString(){ return null; }
public V get(Object p0){ return null; }
public V put(K p0, V p1){ return null; }
public V remove(Object p0){ return null; }
public V removeAt(int p0){ return null; }
public V setValueAt(int p0, V p1){ return null; }
public V valueAt(int p0){ return null; }
public boolean containsAll(Collection<? extends Object> p0){ return false; }
public boolean containsKey(Object p0){ return false; }
public boolean containsValue(Object p0){ return false; }
public boolean equals(Object p0){ return false; }
public boolean isEmpty(){ return false; }
public boolean removeAll(Collection<? extends Object> p0){ return false; }
public boolean retainAll(Collection<? extends Object> p0){ return false; }
public int hashCode(){ return 0; }
public int indexOfKey(Object p0){ return 0; }
public int indexOfValue(Object p0){ return 0; }
public int size(){ return 0; }
public java.util.Collection<V> values(){ return null; }
public java.util.Set<K> keySet(){ return null; }
public java.util.Set<Map.Entry<K, V>> entrySet(){ return null; }
public void clear(){}
public void ensureCapacity(int p0){}
public void putAll(ArrayMap<? extends K, ? extends V> p0){}
public void putAll(java.util.Map<? extends K, ? extends V> p0){}
}