Home
last modified time | relevance | path

Searched refs:K (Results 1 – 25 of 39) sorted by relevance

12

/libcore/luni/src/main/java/java/util/
DNavigableMap.java66 public interface NavigableMap<K,V> extends SortedMap<K,V> {
80 Map.Entry<K,V> lowerEntry(K key); in lowerEntry()
94 K lowerKey(K key); in lowerKey()
109 Map.Entry<K,V> floorEntry(K key); in floorEntry()
123 K floorKey(K key); in floorKey()
138 Map.Entry<K,V> ceilingEntry(K key); in ceilingEntry()
152 K ceilingKey(K key); in ceilingKey()
167 Map.Entry<K,V> higherEntry(K key); in higherEntry()
181 K higherKey(K key); in higherKey()
187 Map.Entry<K,V> firstEntry(); in firstEntry()
[all …]
DTreeMap.java66 public class TreeMap<K, V> extends AbstractMap<K, V>
67 implements SortedMap<K, V>, NavigableMap<K, V>, Cloneable, Serializable {
76 Comparator<? super K> comparator;
77 Node<K, V> root;
87 this.comparator = (Comparator<? super K>) NATURAL_ORDER; in TreeMap()
105 public TreeMap(Map<? extends K, ? extends V> copyFrom) { in TreeMap() argument
107 for (Map.Entry<? extends K, ? extends V> entry : copyFrom.entrySet()) { in TreeMap()
120 public TreeMap(Comparator<? super K> comparator) { in TreeMap()
124 this.comparator = (Comparator<? super K>) NATURAL_ORDER; in TreeMap()
143 public TreeMap(SortedMap<K, ? extends V> copyFrom) { in TreeMap() argument
[all …]
DLinkedHashMap.java49 public class LinkedHashMap<K, V> extends HashMap<K, V> {
56 transient LinkedEntry<K, V> header;
131 public LinkedHashMap(Map<? extends K, ? extends V> map) { in LinkedHashMap() argument
137 header = new LinkedEntry<K, V>(); in init()
143 static class LinkedEntry<K, V> extends HashMapEntry<K, V> {
144 LinkedEntry<K, V> nxt;
145 LinkedEntry<K, V> prv;
154 LinkedEntry(K key, V value, int hash, HashMapEntry<K, V> next, in LinkedEntry() argument
155 LinkedEntry<K, V> nxt, LinkedEntry<K, V> prv) { in LinkedEntry() argument
166 public Entry<K, V> eldest() { in eldest()
[all …]
DSortedMap.java25 public interface SortedMap<K,V> extends Map<K,V> {
31 public Comparator<? super K> comparator(); in comparator()
39 public K firstKey(); in firstKey()
62 public SortedMap<K,V> headMap(K endKey); in headMap()
70 public K lastKey(); in lastKey()
97 public SortedMap<K,V> subMap(K startKey, K endKey); in subMap()
121 public SortedMap<K,V> tailMap(K startKey); in tailMap()
DHashMap.java53 public class HashMap<K, V> extends AbstractMap<K, V> implements Cloneable, Serializable {
90 transient HashMapEntry<K, V>[] table;
95 transient HashMapEntry<K, V> entryForNullKey;
117 private transient Set<K> keySet;
118 private transient Set<Entry<K, V>> entrySet;
126 table = (HashMapEntry<K, V>[]) EMPTY_TABLE; in HashMap()
145 HashMapEntry<K, V>[] tab = (HashMapEntry<K, V>[]) EMPTY_TABLE; in HashMap()
194 public HashMap(Map<? extends K, ? extends V> map) { in HashMap() argument
204 final void constructorPutAll(Map<? extends K, ? extends V> map) { in constructorPutAll() argument
208 for (Entry<? extends K, ? extends V> e : map.entrySet()) { in constructorPutAll()
[all …]
DWeakHashMap.java34 public class WeakHashMap<K, V> extends AbstractMap<K, V> implements Map<K, V> {
38 private final ReferenceQueue<K> referenceQueue;
42 Entry<K, V>[] elementData;
52 private static <K, V> Entry<K, V>[] newEntryArray(int size) { in newEntryArray()
56 private static final class Entry<K, V> extends WeakReference<K> implements
57 Map.Entry<K, V> {
64 Entry<K, V> next;
66 interface Type<R, K, V> {
67 R get(Map.Entry<K, V> entry); in get() argument
70 Entry(K key, V object, ReferenceQueue<K> queue) { in Entry()
[all …]
DHashtable.java37 public class Hashtable<K, V> extends Dictionary<K, V>
38 implements Map<K, V>, Cloneable, Serializable {
74 private transient HashtableEntry<K, V>[] table;
96 private transient Set<K> keySet;
97 private transient Set<Entry<K, V>> entrySet;
106 table = (HashtableEntry<K, V>[]) EMPTY_TABLE; in Hashtable()
124 HashtableEntry<K, V>[] tab = (HashtableEntry<K, V>[]) EMPTY_TABLE; in Hashtable()
170 public Hashtable(Map<? extends K, ? extends V> map) { in Hashtable() argument
180 private void constructorPutAll(Map<? extends K, ? extends V> map) { in constructorPutAll() argument
184 for (Entry<? extends K, ? extends V> e : map.entrySet()) { in constructorPutAll()
[all …]
DAbstractMap.java35 public abstract class AbstractMap<K, V> implements Map<K, V> {
37 Set<K> keySet;
48 public static class SimpleImmutableEntry<K, V>
49 implements Map.Entry<K, V>, Serializable {
52 private final K key;
55 public SimpleImmutableEntry(K theKey, V theValue) { in SimpleImmutableEntry()
63 public SimpleImmutableEntry(Map.Entry<? extends K, ? extends V> copyFrom) { in SimpleImmutableEntry() argument
68 public K getKey() { in getKey()
113 public static class SimpleEntry<K, V>
114 implements Map.Entry<K, V>, Serializable {
[all …]
DMap.java31 public interface Map<K,V> {
36 public static interface Entry<K,V> {
55 public K getKey(); in getKey()
121 public Set<Map.Entry<K,V>> entrySet(); in entrySet()
171 public Set<K> keySet(); in keySet()
193 public V put(K key, V value); in put()
211 public void putAll(Map<? extends K,? extends V> map); in putAll() argument
DCollections.java287 private static final class SingletonMap<K, V> extends AbstractMap<K, V>
291 final K k;
294 SingletonMap(K key, V value) { in SingletonMap()
318 @Override public Set<Map.Entry<K, V>> entrySet() { in entrySet()
319 return new AbstractSet<Map.Entry<K, V>>() { in entrySet()
333 @Override public Iterator<Map.Entry<K, V>> iterator() { in entrySet()
334 return new Iterator<Map.Entry<K, V>>() { in entrySet()
341 @Override public Map.Entry<K, V> next() { in entrySet()
347 return new MapEntry<K, V>(k, v) { in entrySet()
653 static class SynchronizedMap<K, V> implements Map<K, V>, Serializable {
[all …]
DIdentityHashMap.java43 public class IdentityHashMap<K, V> extends AbstractMap<K, V> implements
44 Map<K, V>, Serializable, Cloneable {
85 static class IdentityHashMapEntry<K, V> extends MapEntry<K, V> {
86 private final IdentityHashMap<K,V> map;
88 IdentityHashMapEntry(IdentityHashMap<K,V> map, K theKey, V theValue) { in IdentityHashMapEntry() argument
302 public IdentityHashMap(Map<? extends K, ? extends V> map) {
390 private IdentityHashMapEntry<K, V> getEntry(Object key) {
408 private IdentityHashMapEntry<K, V> getEntry(int index) {
419 return new IdentityHashMapEntry<K, V>(this, (K) key, (V) value);
458 public V put(K key, V value) {
[all …]
DMapEntry.java23 class MapEntry<K, V> implements Map.Entry<K, V>, Cloneable {
25 K key;
32 MapEntry(K theKey) { in MapEntry()
36 MapEntry(K theKey, V theValue) { in MapEntry()
65 public K getKey() { in getKey()
DEnumMap.java28 public class EnumMap<K extends Enum<K>, V> extends AbstractMap<K, V> implements
29 Serializable, Cloneable, Map<K, V> {
37 private Class<K> keyType;
49 private transient EnumMapEntrySet<K, V> entrySet = null;
403 public EnumMap(Class<K> keyType) {
416 public EnumMap(EnumMap<K, ? extends V> map) {
435 public EnumMap(Map<K, ? extends V> map) {
437 initialization((EnumMap<K, V>) map);
442 Iterator<K> iter = map.keySet().iterator();
443 K enumKey = iter.next();
[all …]
DDictionary.java30 public abstract class Dictionary<K, V> {
75 public abstract Enumeration<K> keys(); in keys()
92 public abstract V put(K key, V value); in put()
DProperties.java461 …private <K> void selectProperties(Hashtable<K, Object> selectProperties, final boolean isStringOnl… in selectProperties() argument
468 K key = (K) keys.nextElement(); in selectProperties()
/libcore/luni/src/main/java/java/util/concurrent/
DConcurrentNavigableMap.java23 public interface ConcurrentNavigableMap<K,V>
24 extends ConcurrentMap<K,V>, NavigableMap<K,V>
31 ConcurrentNavigableMap<K,V> subMap(K fromKey, boolean fromInclusive, in subMap()
32 K toKey, boolean toInclusive); in subMap()
39 ConcurrentNavigableMap<K,V> headMap(K toKey, boolean inclusive); in headMap()
46 ConcurrentNavigableMap<K,V> tailMap(K fromKey, boolean inclusive); in tailMap()
53 ConcurrentNavigableMap<K,V> subMap(K fromKey, K toKey); in subMap()
60 ConcurrentNavigableMap<K,V> headMap(K toKey); in headMap()
67 ConcurrentNavigableMap<K,V> tailMap(K fromKey); in tailMap()
81 ConcurrentNavigableMap<K,V> descendingMap(); in descendingMap()
[all …]
DConcurrentSkipListMap.java64 public class ConcurrentSkipListMap<K,V> extends AbstractMap<K,V>
65 implements ConcurrentNavigableMap<K,V>,
310 private transient volatile HeadIndex<K,V> head;
317 private final Comparator<? super K> comparator;
326 private transient KeySet<K> keySet;
328 private transient EntrySet<K,V> entrySet;
332 private transient ConcurrentNavigableMap<K,V> descendingMap;
345 head = new HeadIndex<K,V>(new Node<K,V>(null, BASE_HEADER, null), in initialize()
352 private boolean casHead(HeadIndex<K,V> cmp, HeadIndex<K,V> val) { in casHead() argument
365 static final class Node<K,V> {
[all …]
DConcurrentHashMap.java102 public class ConcurrentHashMap<K,V> extends java.util.AbstractMap<K,V>
103 implements ConcurrentMap<K,V>, Serializable {
424 static class Node<K,V> implements Map.Entry<K,V> {
426 final K key;
428 Node<K,V> next;
430 Node(int hash, K key, V val, Node<K,V> next) { in Node() argument
437 public final K getKey() { return key; } in getKey()
457 Node<K,V> find(int h, Object k) { in find()
458 Node<K,V> e = this; in find()
461 K ek; in find()
[all …]
DConcurrentMap.java30 public interface ConcurrentMap<K,V> extends Map<K,V> {
59 V putIfAbsent(K key, V value); in putIfAbsent()
112 boolean replace(K key, V oldValue, V newValue); in replace()
141 V replace(K key, V value); in replace()
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
DRefSortedMap.java36 public class RefSortedMap<K, V> extends java.util.AbstractMap<K, V>
37 implements SortedMap<K, V>, Cloneable, Serializable {
41 private static final class MapEntry<K, V> implements Map.Entry<K, V> {
43 final K key;
46 MapEntry(K key, V value) { in MapEntry()
51 public K getKey() { in getKey()
85 transient ArrayList<MapEntry<K, V>> entries = new ArrayList<MapEntry<K, V>>();
88 private final Comparator<? super K> comparator;
90 class SubMap extends java.util.AbstractMap<K, V>
91 implements SortedMap<K, V>, Cloneable {
[all …]
/libcore/luni/src/main/java/libcore/util/
DBasicLruCache.java26 public class BasicLruCache<K, V> {
27 private final LinkedHashMap<K, V> map;
35 this.map = new LinkedHashMap<K, V>(0, 0.75f, true); in BasicLruCache()
44 public synchronized final V get(K key) { in get()
70 public synchronized final V put(K key, V value) { in put()
84 Map.Entry<K, V> toEvict = map.eldest(); in trimToSize()
86 K key = toEvict.getKey(); in trimToSize()
98 protected void entryEvicted(K key, V value) {} in entryEvicted()
105 protected V create(K key) { in create()
113 public synchronized final Map<K, V> snapshot() { in snapshot()
[all …]
/libcore/luni/src/test/java/libcore/java/util/
DEvilMapTest.java31 public static class EvilMap<K,V> extends AbstractMap<K,V> {
32 private final Set<Entry<K,V>> entries = new HashSet<Entry<K,V>>();
41 @Override public Set<Entry<K, V>> entrySet() { return entries; } in entrySet()
45 @Override public V put(K key, V val) { return val; } in put()
DEnumSetTest.java102 H, HE, LI, BE, B, C, N, O, F, NE, NA, MG, AL, SI, P, S, CL, AR, K, CA, SC, TI, V, CR, MN, enumConstant
/libcore/luni/src/main/files/cacerts/
D418595b9.036 …\xBC - UEKAE, OU=Kamu Sertifikasyon Merkezi, CN=T\xC3\x9CB\xC4\xB0TAK UEKAE K\xC3\xB6k Sertifika H…
40 …\xBC - UEKAE, OU=Kamu Sertifikasyon Merkezi, CN=T\xC3\x9CB\xC4\xB0TAK UEKAE K\xC3\xB6k Sertifika H…
/libcore/luni/src/test/java/libcore/java/lang/reflect/
DReflectionTest.java362 public static abstract class C<K> {
365 protected K[] fieldThree;
370 protected <T1 extends A> C(Map<? super A, T1> a, K s) {} in C()

12