Searched refs:Entry (Results 1 - 25 of 120) sorted by relevance

12345

/libcore/ojluni/src/main/java/java/io/
H A DExpiringCache.java38 private Map<String,Entry> map;
44 static class Entry { class in class:ExpiringCache
48 Entry(long timestamp, String val) { method in class:ExpiringCache.Entry
67 map = new LinkedHashMap<String,Entry>() {
68 // Android-changed: Qualified ExpiringCache.Entry to distinguish from Map.Entry.
70 // Map.Entry<String,Entry> doesn't work on jack since the latter "Entry" gets
71 // interpreted as referring to Map.Entry rathe
[all...]
/libcore/ojluni/src/main/java/java/util/
H A DNavigableMap.java46 * and {@link #higherEntry} return {@code Map.Entry} objects
74 * return {@code Map.Entry} pairs representing snapshots of mappings
76 * support the optional {@code Entry.setValue} method. Note however
111 Map.Entry<K,V> lowerEntry(K key);
140 Map.Entry<K,V> floorEntry(K key);
169 Map.Entry<K,V> ceilingEntry(K key);
198 Map.Entry<K,V> higherEntry(K key);
221 Map.Entry<K,V> firstEntry();
230 Map.Entry<K,V> lastEntry();
239 Map.Entry<
[all...]
H A DAbstractMap.java27 import java.util.Map.Entry;
112 Iterator<Entry<K,V>> i = entrySet().iterator();
115 Entry<K,V> e = i.next();
121 Entry<K,V> e = i.next();
144 Iterator<Map.Entry<K,V>> i = entrySet().iterator();
147 Entry<K,V> e = i.next();
153 Entry<K,V> e = i.next();
176 Iterator<Entry<K,V>> i = entrySet().iterator();
179 Entry<K,V> e = i.next();
185 Entry<
[all...]
H A DWeakHashMap.java160 Entry<K,V>[] table;
194 private Entry<K,V>[] newTable(int n) {
195 return (Entry<K,V>[]) new Entry<?,?>[n];
321 Entry<K,V> e = (Entry<K,V>) x;
324 Entry<K,V> prev = table[i];
325 Entry<K,V> p = prev;
327 Entry<K,V> next = p.next;
349 private Entry<
702 private static class Entry<K,V> extends WeakReference<Object> implements Map.Entry<K,V> { class in class:WeakHashMap
710 Entry(Object key, V value, method in class:WeakHashMap.Entry
[all...]
H A DMap.java360 Set<Map.Entry<K, V>> entrySet();
366 * iterator of this collection-view. These {@code Map.Entry} objects are
375 interface Entry<K, V> { interface in interface:Map
432 * different implementations of the {@code Map.Entry} interface.
459 * Returns a comparator that compares {@link Map.Entry} in natural order on key.
466 * @return a comparator that compares {@link Map.Entry} in natural order on key.
470 public static <K extends Comparable<? super K>, V> Comparator<Map.Entry<K, V>> comparingByKey() {
471 return (Comparator<Map.Entry<K, V>> & Serializable)
476 * Returns a comparator that compares {@link Map.Entry} in natural order on value.
483 * @return a comparator that compares {@link Map.Entry} i
[all...]
H A DSortedMap.java283 Set<Map.Entry<K, V>> entrySet();
H A DEnumMap.java29 import java.util.Map.Entry;
370 private transient Set<Map.Entry<K,V>> entrySet;
465 public Set<Map.Entry<K,V>> entrySet() {
466 Set<Map.Entry<K,V>> es = entrySet;
473 private class EntrySet extends AbstractSet<Map.Entry<K,V>> {
474 public Iterator<Map.Entry<K,V>> iterator() {
479 if (!(o instanceof Map.Entry))
481 Map.Entry<?,?> entry = (Map.Entry<?,?>)o;
485 if (!(o instanceof Map.Entry))
584 private class Entry implements Map.Entry<K,V> { class in class:EnumMap.EntryIterator
587 private Entry(int index) { method in class:EnumMap.EntryIterator.Entry
[all...]
/libcore/jsr166-tests/src/test/java/jsr166/
H A DEntryTest.java35 Map.Entry e = new AbstractMap.SimpleEntry(k1, v1);
44 Map.Entry s = new AbstractMap.SimpleImmutableEntry(k1, v1);
53 Map.Entry e2 = new AbstractMap.SimpleEntry(k1, v1);
54 Map.Entry e = new AbstractMap.SimpleEntry(e2);
63 Map.Entry s2 = new AbstractMap.SimpleImmutableEntry(k1, v1);
64 Map.Entry s = new AbstractMap.SimpleImmutableEntry(s2);
74 Map.Entry e2 = new AbstractMap.SimpleEntry(k1, v1);
75 Map.Entry e = new AbstractMap.SimpleEntry(e2);
76 Map.Entry s2 = new AbstractMap.SimpleImmutableEntry(k1, v1);
77 Map.Entry
[all...]
H A DTreeSubMapTest.java209 Map.Entry e = (Map.Entry) it.next();
249 Map.Entry e1 = map.lowerEntry(three);
252 Map.Entry e2 = map.lowerEntry(six);
255 Map.Entry e3 = map.lowerEntry(one);
258 Map.Entry e4 = map.lowerEntry(zero);
267 Map.Entry e1 = map.higherEntry(three);
270 Map.Entry e2 = map.higherEntry(zero);
273 Map.Entry e3 = map.higherEntry(five);
276 Map.Entry e
[all...]
H A DConcurrentSkipListSubMapTest.java252 Map.Entry e = (Map.Entry) it.next();
362 Map.Entry e1 = map.lowerEntry(three);
365 Map.Entry e2 = map.lowerEntry(six);
368 Map.Entry e3 = map.lowerEntry(one);
371 Map.Entry e4 = map.lowerEntry(zero);
380 Map.Entry e1 = map.higherEntry(three);
383 Map.Entry e2 = map.higherEntry(zero);
386 Map.Entry e3 = map.higherEntry(five);
389 Map.Entry e
[all...]
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
H A DSimpleEntryTest.java25 import java.util.Map.Entry;
34 static class NullEntry implements Entry {
52 Entry entryToPut = (Entry) map.entrySet().iterator().next();
53 Entry testEntry = new AbstractMap.SimpleEntry(entryToPut);
71 Entry entry = new AbstractMap.SimpleEntry<Integer, String>(1, "test");
78 Entry entry = new AbstractMap.SimpleEntry<Integer, String>(1, "test");
85 Entry entry = new AbstractMap.SimpleEntry<Integer, String>(1, "test");
94 Entry entry = new AbstractMap.SimpleEntry<Integer, String>(1, "test");
97 Entry entryToPu
[all...]
H A DSimpleImmutableEntryTest.java26 import java.util.Map.Entry;
35 static class NullEntry implements Entry {
53 Entry entryToPut = (Entry) map.entrySet().iterator().next();
54 Entry testEntry = new AbstractMap.SimpleImmutableEntry(entryToPut);
72 Entry entry = new AbstractMap.SimpleImmutableEntry<Integer, String>(1, "test");
79 Entry entry = new AbstractMap.SimpleImmutableEntry<Integer, String>(1, "test");
86 Entry entry = new AbstractMap.SimpleImmutableEntry<Integer, String>(1, "test");
104 Entry entry = new AbstractMap.SimpleImmutableEntry<Integer, String>(1, "test");
107 Entry entryToPu
[all...]
/libcore/ojluni/src/main/java/java/lang/
H A DThreadLocal.java163 ThreadLocalMap.Entry e = map.getEntry(this);
308 static class Entry extends WeakReference<ThreadLocal<?>> { class in class:ThreadLocal.ThreadLocalMap
312 Entry(ThreadLocal<?> k, Object v) { method in class:ThreadLocal.ThreadLocalMap.Entry
327 private Entry[] table;
366 table = new Entry[INITIAL_CAPACITY];
368 table[i] = new Entry(firstKey, firstValue);
380 Entry[] parentTable = parentMap.table;
383 table = new Entry[len];
386 Entry e = parentTable[j];
392 Entry
[all...]
H A DProcessEnvironment.java251 public Set<Map.Entry<String,String>> entrySet() {
272 for (Map.Entry<Variable,Value> entry : m.entrySet()) {
280 for (Map.Entry<Variable,Value> entry : m.entrySet()) {
303 implements Map.Entry<String,String>
305 private final Map.Entry<Variable,Value> e;
306 public StringEntry(Map.Entry<Variable,Value> e) {this.e = e;}
321 extends AbstractSet<Map.Entry<String,String>>
323 private final Set<Map.Entry<Variable,Value>> s;
324 public StringEntrySet(Set<Map.Entry<Variable,Value>> s) {this.s = s;}
328 public Iterator<Map.Entry<Strin
[all...]
/libcore/luni/src/test/java/libcore/java/util/
H A DOldMapEntryTest.java28 Map.Entry me = null;
75 me = (Map.Entry)i.next();
89 Map.Entry me1 = (Map.Entry)i.next();
97 Map.Entry me1 = (Map.Entry)i.next();
108 me = (Map.Entry)i.next();
H A DOldAbstractMapTest.java102 private final List<Entry<String, String>> entries = new ArrayList<Entry<String, String>>();
110 @Override public Set<Entry<String, String>> entrySet() {
111 return new AbstractSet<Entry<String, String>>() {
112 @Override public Iterator<Entry<String, String>> iterator() {
H A DLinkedHashMapTest.java51 Map.Entry<String, String> newest = null;
52 for (Map.Entry<String, String> e : m.entrySet()) {
72 Map.Entry<String, String> newest = null;
73 for (Map.Entry<String, String> e : m.entrySet()) {
81 for (Map.Entry<String, String> e : m.entrySet()) {
104 Map.Entry<String, String> newest = null;
105 for (Map.Entry<String, String> e : m.entrySet()) {
114 for (Map.Entry<String, String> e : m.entrySet()) {
131 Map.Entry<String, String> newest = null;
132 for (Map.Entry<Strin
[all...]
H A DTreeMapTest.java31 import java.util.Map.Entry;
50 Iterator<Entry<String, String>> iterator = map.entrySet().iterator();
51 Entry<String, String> entryA = iterator.next();
55 Entry<String, String> entryB = iterator.next();
57 Entry<String, String> entryC = iterator.next();
77 Iterator<Entry<String, String>> iterator = subMap.entrySet().iterator();
78 Entry<String, String> entryA = iterator.next();
83 Entry<String, String> entryB = iterator.next();
85 Entry<String, String> entryC = iterator.next();
96 * Test that an Entry give
[all...]
/libcore/luni/src/test/java/org/apache/harmony/security/tests/java/security/
H A DKSSecretKeyEntryTest.java94 KeyStore.Entry.Attribute myAttribute = new KeyStore.Entry.Attribute() {
105 Set<KeyStore.Entry.Attribute> attributeSet = new HashSet<KeyStore.Entry.Attribute>();
109 Set<KeyStore.Entry.Attribute> returnedAttributeSet = ksSKE.getAttributes();
H A DKSTrustedCertificateEntryTest.java97 KeyStore.Entry.Attribute myAttribute = new KeyStore.Entry.Attribute() {
108 Set<KeyStore.Entry.Attribute> attributeSet = new HashSet<KeyStore.Entry.Attribute>();
113 Set<KeyStore.Entry.Attribute> returnedAttributeSet = ksTCE.getAttributes();
H A DKSPrivateKeyEntryTest.java189 KeyStore.Entry.Attribute myAttribute = new KeyStore.Entry.Attribute() {
200 Set<KeyStore.Entry.Attribute> attributeSet = new HashSet<KeyStore.Entry.Attribute>();
205 Set<KeyStore.Entry.Attribute> returnedAttributeSet = ksPKE.getAttributes();
/libcore/ojluni/src/main/java/java/time/format/
H A DDateTimeTextProvider.java89 import java.util.Map.Entry;
107 private static final ConcurrentMap<Entry<TemporalField, Locale>, Object> CACHE = new ConcurrentHashMap<>(16, 0.75f, 2);
109 private static final Comparator<Entry<String, Long>> COMPARATOR = new Comparator<Entry<String, Long>>() {
111 public int compare(Entry<String, Long> obj1, Entry<String, Long> obj2) {
219 public Iterator<Entry<String, Long>> getTextIterator(TemporalField field, TextStyle style, Locale locale) {
244 public Iterator<Entry<String, Long>> getTextIterator(Chronology chrono, TemporalField field,
275 List<Entry<String, Long>> list = new ArrayList<>(map.size());
278 for (Map.Entry<Strin
[all...]
/libcore/ojluni/src/main/java/java/security/
H A DUnresolvedPermissionCollection.java168 Set<Map.Entry<String, List<UnresolvedPermission>>> set = perms.entrySet();
169 for (Map.Entry<String, List<UnresolvedPermission>> e : set) {
209 Set<Map.Entry<String, Vector<UnresolvedPermission>>> set = permissions.entrySet();
210 for (Map.Entry<String, Vector<UnresolvedPermission>> e : set) {
/libcore/ojluni/src/main/java/java/security/cert/
H A DPKIXRevocationChecker.java34 import java.util.Map.Entry;
200 for (Map.Entry<X509Certificate, byte[]> e : responses.entrySet()) {
219 for (Map.Entry<X509Certificate, byte[]> e : ocspResponses.entrySet()) {
269 for (Map.Entry<X509Certificate, byte[]> entry :
/libcore/ojluni/src/main/java/sun/security/util/
H A DManifestDigester.java43 private HashMap<String, Entry> entries; // key is a UTF-8 string
113 entries = new HashMap<String, Entry>();
124 new Entry(0, pos.endOfSection + 1, pos.startOfNext, rawBytes));
171 new Entry(start, sectionLen, sectionLenWithBlank,
194 public static class Entry { class in class:ManifestDigester
201 public Entry(int offset, int length, method in class:ManifestDigester.Entry
257 public Entry get(String name, boolean oldStyle) {
258 Entry e = entries.get(name);

Completed in 758 milliseconds

12345