/libcore/ojluni/src/main/java/java/util/ |
H A D | NavigableMap.java | 45 * and {@link #higherEntry} return {@code Map.Entry} objects 73 * return {@code Map.Entry} pairs representing snapshots of mappings 75 * support the optional {@code Entry.setValue} method. Note however 110 Map.Entry<K,V> lowerEntry(K key); 139 Map.Entry<K,V> floorEntry(K key); 168 Map.Entry<K,V> ceilingEntry(K key); 197 Map.Entry<K,V> higherEntry(K key); 220 Map.Entry<K,V> firstEntry(); 229 Map.Entry<K,V> lastEntry(); 238 Map.Entry< [all...] |
H A D | AbstractMap.java | 27 import java.util.Map.Entry; 109 Iterator<Entry<K,V>> i = entrySet().iterator(); 112 Entry<K,V> e = i.next(); 118 Entry<K,V> e = i.next(); 140 Iterator<Map.Entry<K,V>> i = entrySet().iterator(); 143 Entry<K,V> e = i.next(); 149 Entry<K,V> e = i.next(); 171 Iterator<Entry<K,V>> i = entrySet().iterator(); 174 Entry<K,V> e = i.next(); 180 Entry< [all...] |
H A D | WeakHashMap.java | 159 Entry<K,V>[] table; 193 private Entry<K,V>[] newTable(int n) { 194 return (Entry<K,V>[]) new Entry[n]; 303 Entry<K,V> e = (Entry<K,V>) x; 306 Entry<K,V> prev = table[i]; 307 Entry<K,V> p = prev; 309 Entry<K,V> next = p.next; 331 private Entry< 684 private static class Entry<K,V> extends WeakReference<Object> implements Map.Entry<K,V> { class in class:WeakHashMap 692 Entry(Object key, V value, method in class:WeakHashMap.Entry [all...] |
H A D | Map.java | 362 Set<Map.Entry<K, V>> entrySet(); 368 * iterator of this collection-view. These {@code Map.Entry} objects are 377 interface Entry<K, V> { interface in interface:Map 434 * different implementations of the {@code Map.Entry} interface. 461 * Returns a comparator that compares {@link Map.Entry} in natural order on key. 468 * @return a comparator that compares {@link Map.Entry} in natural order on key. 472 public static <K extends Comparable<? super K>, V> Comparator<Map.Entry<K, V>> comparingByKey() { 473 return (Comparator<Map.Entry<K, V>> & Serializable) 478 * Returns a comparator that compares {@link Map.Entry} in natural order on value. 485 * @return a comparator that compares {@link Map.Entry} i [all...] |
H A D | SortedMap.java | 283 Set<Map.Entry<K, V>> entrySet();
|
H A D | EnumMap.java | 29 import java.util.Map.Entry; 370 private transient Set<Map.Entry<K,V>> entrySet = null; 463 public Set<Map.Entry<K,V>> entrySet() { 464 Set<Map.Entry<K,V>> es = entrySet; 471 private class EntrySet extends AbstractSet<Map.Entry<K,V>> { 472 public Iterator<Map.Entry<K,V>> iterator() { 477 if (!(o instanceof Map.Entry)) 479 Map.Entry entry = (Map.Entry)o; 483 if (!(o instanceof Map.Entry)) 582 private class Entry implements Map.Entry<K,V> { class in class:EnumMap.EntryIterator 585 private Entry(int index) { method in class:EnumMap.EntryIterator.Entry [all...] |
H A D | LinkedHashMap.java | 79 * <p>The {@link #removeEldestEntry(Map.Entry)} method may be overridden to 409 Entry<K,V> nextEntry() { 429 private class EntryIterator extends LinkedHashIterator<Map.Entry<K,V>> { 430 public Map.Entry<K,V> next() { return nextEntry(); } 436 Iterator<Map.Entry<K,V>> newEntryIterator() { return new EntryIterator(); } 474 public Map.Entry<K, V> eldest() { 475 Entry<K, V> eldest = header.after; 510 * protected boolean removeEldestEntry(Map.Entry eldest) { 537 protected boolean removeEldestEntry(Map.Entry<K,V> eldest) {
|
H A D | IdentityHashMap.java | 510 for (Entry<? extends K, ? extends V> e : m.entrySet()) 677 * <tt>Map.Entry</tt> instances in the set returned by this map's 843 extends IdentityHashMapIterator<Map.Entry<K,V>> 845 private Entry lastReturnedEntry = null; 847 public Map.Entry<K,V> next() { 848 lastReturnedEntry = new Entry(nextIndex()); 860 private class Entry implements Map.Entry<K,V> { class in class:IdentityHashMap.EntryIterator 863 private Entry(int index) { method in class:IdentityHashMap.EntryIterator.Entry 894 if (!(o instanceof Map.Entry)) [all...] |
H A D | HashMap.java | 348 Entry<K,V> entry = getEntry(key); 388 final Entry<K,V> getEntry(Object key) { 485 for (Map.Entry<? extends K, ? extends V> e : m.entrySet()) 570 for (Map.Entry<? extends K, ? extends V> e : m.entrySet()) 584 Entry<K,V> e = removeEntryForKey(key); 593 final Entry<K,V> removeEntryForKey(Object key) { 624 * Special version of remove for EntrySet using {@code Map.Entry.equals()} 627 final Entry<K,V> removeMapping(Object o) { 628 if (size == 0 || !(o instanceof Map.Entry)) 631 Map.Entry< [all...] |
/libcore/jsr166-tests/src/test/java/jsr166/ |
H A D | EntryTest.java | 35 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 D | TreeSubMapTest.java | 209 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 D | ConcurrentSkipListSubMapTest.java | 252 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/ojluni/src/main/java/java/io/ |
H A D | ExpiringCache.java | 44 static class Entry { class in class:ExpiringCache 48 Entry(long timestamp, String val) { method in class:ExpiringCache.Entry 67 protected boolean removeEldestEntry(Map.Entry eldest) { 77 Entry entry = entryFor(key); 88 Entry entry = entryFor(key); 93 map.put(key, new Entry(System.currentTimeMillis(), val)); 101 private Entry entryFor(String key) { 102 Entry entry = (Entry) map.get(key);
|
/libcore/ojluni/src/main/java/java/lang/ |
H A D | ThreadLocal.java | 146 ThreadLocalMap.Entry e = map.getEntry(this); 271 static class Entry extends WeakReference<ThreadLocal> { class in class:ThreadLocal.ThreadLocalMap 275 Entry(ThreadLocal k, Object v) { method in class:ThreadLocal.ThreadLocalMap.Entry 290 private Entry[] table; 329 table = new Entry[INITIAL_CAPACITY]; 331 table[i] = new Entry(firstKey, firstValue); 343 Entry[] parentTable = parentMap.table; 346 table = new Entry[len]; 349 Entry e = parentTable[j]; 354 Entry [all...] |
H A D | ProcessEnvironment.java | 250 public Set<Map.Entry<String,String>> entrySet() { 271 for (Map.Entry<Variable,Value> entry : m.entrySet()) { 279 for (Map.Entry<Variable,Value> entry : m.entrySet()) { 302 implements Map.Entry<String,String> 304 private final Map.Entry<Variable,Value> e; 305 public StringEntry(Map.Entry<Variable,Value> e) {this.e = e;} 320 extends AbstractSet<Map.Entry<String,String>> 322 private final Set<Map.Entry<Variable,Value>> s; 323 public StringEntrySet(Set<Map.Entry<Variable,Value>> s) {this.s = s;} 327 public Iterator<Map.Entry<Strin [all...] |
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
H A D | SimpleEntryTest.java | 25 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 D | SimpleImmutableEntryTest.java | 26 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...] |
H A D | RefSortedMap.java | 41 private static final class MapEntry<K, V> implements Map.Entry<K, V> { 74 if (object instanceof Map.Entry) { 75 Map.Entry<?, ?> entry = (Map.Entry<?, ?>) object; 107 public Set<java.util.Map.Entry<K, V>> entrySet() { 108 return new AbstractSet<Entry<K, V>>() { 111 public Iterator<java.util.Map.Entry<K, V>> iterator() { 112 return new Iterator<Entry<K, V>>() { 126 public Map.Entry<K, V> next() { 270 public Set<Map.Entry< [all...] |
/libcore/luni/src/test/java/libcore/java/util/ |
H A D | LinkedHashMapTest.java | 38 Map.Entry<String, String> newest = null; 39 for (Map.Entry<String, String> e : m.entrySet()) { 59 Map.Entry<String, String> newest = null; 60 for (Map.Entry<String, String> e : m.entrySet()) { 68 for (Map.Entry<String, String> e : m.entrySet()) { 91 Map.Entry<String, String> newest = null; 92 for (Map.Entry<String, String> e : m.entrySet()) { 101 for (Map.Entry<String, String> e : m.entrySet()) { 118 Map.Entry<String, String> newest = null; 119 for (Map.Entry<Strin [all...] |
H A D | OldMapEntryTest.java | 28 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 D | OldAbstractMapTest.java | 102 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() {
|
/libcore/ojluni/src/main/java/sun/misc/ |
H A D | SoftCache.java | 351 private class Entry implements Map.Entry { class in class:SoftCache 352 private Map.Entry ent; 354 from flushing the value while this Entry 357 Entry(Map.Entry ent, Object value) { method in class:SoftCache.Entry 375 if (! (o instanceof Map.Entry)) return false; 376 Map.Entry e = (Map.Entry)o; 398 Entry nex [all...] |
/libcore/ojluni/src/main/java/java/security/ |
H A D | UnresolvedPermissionCollection.java | 168 Set<Map.Entry<String, List<UnresolvedPermission>>> set = perms.entrySet(); 169 for (Map.Entry<String, List<UnresolvedPermission>> e : set) { 205 Set<Map.Entry<String, Vector<UnresolvedPermission>>> set = permissions.entrySet(); 206 for (Map.Entry<String, Vector<UnresolvedPermission>> e : set) {
|
/libcore/ojluni/src/main/java/java/security/cert/ |
H A D | PKIXRevocationChecker.java | 34 import java.util.Map.Entry; 194 for (Map.Entry<X509Certificate, byte[]> e : responses.entrySet()) { 213 for (Map.Entry<X509Certificate, byte[]> e : ocspResponses.entrySet()) { 263 for (Map.Entry<X509Certificate, byte[]> entry :
|
/libcore/ojluni/src/main/java/sun/security/util/ |
H A D | ManifestDigester.java | 43 private HashMap<String, Entry> entries; // key is a UTF-8 string 111 entries = new HashMap<String, Entry>(); 122 new Entry(0, pos.endOfSection + 1, pos.startOfNext, rawBytes)); 169 new Entry(start, sectionLen, sectionLenWithBlank, 192 public static class Entry { class in class:ManifestDigester 199 public Entry(int offset, int length, method in class:ManifestDigester.Entry 255 public Entry get(String name, boolean oldStyle) { 256 Entry e = entries.get(name);
|