Searched defs:Entry (Results 1 - 11 of 11) sorted by relevance

/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/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);
/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...]
/libcore/ojluni/src/main/java/java/util/
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...]
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 DIdentityHashMap.java505 for (Entry<? extends K, ? extends V> e : m.entrySet())
671 * <tt>Map.Entry</tt> instances in the set returned by this map's
837 extends IdentityHashMapIterator<Map.Entry<K,V>>
839 private Entry lastReturnedEntry;
841 public Map.Entry<K,V> next() {
842 lastReturnedEntry = new Entry(nextIndex());
854 private class Entry implements Map.Entry<K,V> { class in class:IdentityHashMap.EntryIterator
857 private Entry(int index) { method in class:IdentityHashMap.EntryIterator.Entry
888 if (!(o instanceof Map.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 DCollections.java1512 private transient Set<Map.Entry<K,V>> entrySet;
1521 public Set<Map.Entry<K,V>> entrySet() {
1607 extends UnmodifiableSet<Map.Entry<K,V>> {
1611 UnmodifiableEntrySet(Set<? extends Map.Entry<? extends K, ? extends V>> s) {
1616 static <K, V> Consumer<Map.Entry<K, V>> entryConsumer(Consumer<? super Entry<K, V>> action) { argument
1620 public void forEach(Consumer<? super Entry<K, V>> action) { argument
1626 implements Spliterator<Entry<K,V>> {
1627 final Spliterator<Map.Entry<K, V>> s;
1629 UnmodifiableEntrySetSpliterator(Spliterator<Entry<
1634 tryAdvance(Consumer<? super Entry<K, V>> action) argument
1640 forEachRemaining(Consumer<? super Entry<K, V>> action) argument
[all...]
/libcore/ojluni/src/main/java/java/security/
H A DKeyStore.java45 * Each type of entry implements the {@code KeyStore.Entry} interface.
46 * Three basic {@code KeyStore.Entry} implementations are provided:
450 public static interface Entry { interface in class:KeyStore
495 public static final class PrivateKeyEntry implements Entry {
671 public static final class SecretKeyEntry implements Entry {
755 public static final class TrustedCertificateEntry implements Entry {
1523 * Gets a keystore {@code Entry} for the specified alias
1526 * @param alias get the keystore {@code Entry} for this alias
1528 * used to protect the {@code Entry},
1531 * @return the keystore {@code Entry} fo
[all...]
/libcore/ojluni/src/main/java/java/util/concurrent/
H A DConcurrentSkipListMap.java85 * <p>All {@code Map.Entry} pairs returned by methods in this class
87 * produced. They do <em>not</em> support the {@code Entry.setValue}
1048 private Map.Entry<K,V> doRemoveFirstEntry() {
1093 private Map.Entry<K,V> doRemoveLastEntry() {
1258 * @return Entry fitting relation, or null if no such
1372 Iterator<? extends Map.Entry<? extends K, ? extends V>> it =
1375 Map.Entry<? extends K, ? extends V> e = it.next();
1883 * <p>The {@code Map.Entry} elements traversed by the {@code iterator}
1890 public Set<Map.Entry<K,V>> entrySet() {
1926 for (Map.Entry<
2537 removeIf(Predicate<? super Entry<K,V>> filter) argument
3255 removeEntryIf(Predicate<? super Entry<K,V>> function) argument
[all...]
H A DConcurrentHashMap.java165 * {@link java.util.Map.Entry} objects do not support method {@code
236 * <p>Methods accepting and/or returning Entry arguments maintain
238 * finding the key for the greatest value. Note that "plain" Entry
619 * user-mutable Map.Entry (i.e., one supporting setValue; see
625 static class Node<K,V> implements Map.Entry<K,V> {
649 Object k, v, u; Map.Entry<?,?> e;
650 return ((o instanceof Map.Entry) &&
651 (k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
1093 for (Map.Entry<? extends K, ? extends V> e : m.entrySet())
1290 public Set<Map.Entry<
1640 removeEntryIf(Predicate<? super Entry<K,V>> function) argument
4816 addAll(Collection<? extends Entry<K,V>> c) argument
4825 removeIf(Predicate<? super Entry<K,V>> filter) argument
5027 ForEachEntryTask(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t, Consumer<? super Entry<K,V>> action) argument
[all...]

Completed in 224 milliseconds