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

123

/libcore/luni/src/main/java/java/util/
H A DNavigableMap.java17 * and {@code higherEntry} return {@code Map.Entry} objects
43 * return {@code Map.Entry} pairs representing snapshots of mappings
45 * support the optional {@code Entry.setValue} method. Note however
80 Map.Entry<K,V> lowerEntry(K key);
109 Map.Entry<K,V> floorEntry(K key);
138 Map.Entry<K,V> ceilingEntry(K key);
167 Map.Entry<K,V> higherEntry(K key);
187 Map.Entry<K,V> firstEntry();
193 Map.Entry<K,V> lastEntry();
202 Map.Entry<
[all...]
H A DAbstractMap.java49 implements Map.Entry<K, V>, Serializable {
63 public SimpleImmutableEntry(Map.Entry<? extends K, ? extends V> copyFrom) {
88 if (object instanceof Map.Entry) {
89 Map.Entry<?, ?> entry = (Map.Entry<?, ?>) object;
114 implements Map.Entry<K, V>, Serializable {
128 public SimpleEntry(Map.Entry<? extends K, ? extends V> copyFrom) {
151 if (object instanceof Map.Entry) {
152 Map.Entry<?, ?> entry = (Map.Entry<
[all...]
H A DWeakHashMap.java42 Entry<K, V>[] elementData;
52 private static <K, V> Entry<K, V>[] newEntryArray(int size) {
53 return new Entry[size];
56 private static final class Entry<K, V> extends WeakReference<K> implements class in class:WeakHashMap
57 Map.Entry<K, V> {
64 Entry<K, V> next;
67 R get(Map.Entry<K, V> entry);
70 Entry(K key, V object, ReferenceQueue<K> queue) { method in class:WeakHashMap.Entry
93 if (!(other instanceof Map.Entry)) {
96 Map.Entry<
[all...]
H A DMapEntry.java21 * MapEntry is an internal class which provides an implementation of Map.Entry.
23 class MapEntry<K, V> implements Map.Entry<K, V>, Cloneable {
55 if (object instanceof Map.Entry) {
56 Map.Entry<?, ?> entry = (Map.Entry<?, ?>) object;
H A DMap.java34 * {@code Map.Entry} is a key/value mapping contained in a {@code Map}.
36 public static interface Entry<K,V> { interface in interface:Map
38 * Compares the specified object to this {@code Map.Entry} and returns if they
39 * are equal. To be equal, the object must be an instance of {@code Map.Entry} and have the
45 * {@code Map.Entry}, {@code false} otherwise.
116 * an instance of {@link Map.Entry}. As the {@code Set} is backed by this {@code Map},
121 public Set<Map.Entry<K,V>> entrySet();
H A DTreeMap.java107 for (Map.Entry<? extends K, ? extends V> entry : copyFrom.entrySet()) {
150 for (Map.Entry<K, ? extends V> entry : copyFrom.entrySet()) {
177 Entry<K, V> entry = findByObject(key);
363 Node<K, V> findByEntry(Entry<?, ?> entry) {
583 private SimpleImmutableEntry<K, V> immutableCopy(Entry<K, V> entry) {
587 public Entry<K, V> firstEntry() {
591 private Entry<K, V> internalPollFirstEntry() {
600 public Entry<K, V> pollFirstEntry() {
611 public Entry<K, V> lastEntry() {
615 private Entry<
[all...]
H A DEnumMap.java51 private static class Entry<KT extends Enum<KT>, VT> extends class in class:EnumMap
57 Entry(KT theKey, VT theValue, EnumMap<KT, VT> em) { method in class:EnumMap.Entry
70 if (object instanceof Map.Entry) {
71 Map.Entry<KT, VT> entry = (Map.Entry<KT, VT>) object;
306 return type.get(new Entry<KT, VT>((KT) enumMap.keys[prePosition],
312 AbstractSet<Map.Entry<KT, VT>> {
327 if (object instanceof Map.Entry) {
328 Object enumKey = ((Map.Entry) object).getKey();
329 Object enumValue = ((Map.Entry) objec
[all...]
H A DHashtable.java56 private static final Entry[] EMPTY_TABLE
97 private transient Set<Entry<K, V>> entrySet;
184 for (Entry<? extends K, ? extends V> e : map.entrySet()) {
424 for (Entry<? extends K, ? extends V> e : map.entrySet()) {
613 * element in the set is a {@link Map.Entry}. The set is backed by this
619 public synchronized Set<Entry<K, V>> entrySet() {
620 Set<Entry<K, V>> es = entrySet;
659 private static class HashtableEntry<K, V> implements Entry<K, V> {
690 if (!(o instanceof Entry)) {
693 Entry<
[all...]
H A DHashMap.java71 private static final Entry[] EMPTY_TABLE
118 private transient Set<Entry<K, V>> entrySet;
208 for (Entry<? extends K, ? extends V> e : map.entrySet()) {
727 * an instance of {@link Map.Entry}. As the set is backed by this map,
732 public Set<Entry<K, V>> entrySet() {
733 Set<Entry<K, V>> es = entrySet;
737 static class HashMapEntry<K, V> implements Entry<K, V> {
765 if (!(o instanceof Entry)) {
768 Entry<?, ?> e = (Entry<
[all...]
H A DIdentityHashMap.java103 if (object instanceof Map.Entry) {
104 Map.Entry<?, ?> entry = (Map.Entry) object;
197 AbstractSet<Map.Entry<KT, VT>> {
221 associatedMap.remove(((Map.Entry) object).getKey());
229 if (object instanceof Map.Entry) {
231 .getEntry(((Map.Entry) object).getKey());
239 public Iterator<Map.Entry<KT, VT>> iterator() {
240 return new IdentityHashMapIterator<Map.Entry<KT, VT>, KT, VT>(
241 new MapEntry.Type<Map.Entry<K
[all...]
H A DLinkedHashMap.java166 public Entry<K, V> eldest() {
375 extends LinkedHashIterator<Map.Entry<K, V>> {
376 public final Map.Entry<K, V> next() { return nextEntry(); }
386 @Override Iterator<Map.Entry<K, V>> newEntryIterator() {
390 protected boolean removeEldestEntry(Map.Entry<K, V> eldest) {
/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 DTreeMapTest.java24 import java.util.Map.Entry;
42 Iterator<Entry<String, String>> iterator = map.entrySet().iterator();
43 Entry<String, String> entryA = iterator.next();
47 Entry<String, String> entryB = iterator.next();
49 Entry<String, String> entryC = iterator.next();
69 Iterator<Entry<String, String>> iterator = subMap.entrySet().iterator();
70 Entry<String, String> entryA = iterator.next();
75 Entry<String, String> entryB = iterator.next();
77 Entry<String, String> entryC = iterator.next();
88 * Test that an Entry give
[all...]
H A DEvilMapTest.java32 private final Set<Entry<K,V>> entries = new HashSet<Entry<K,V>>();
41 @Override public Set<Entry<K, V>> entrySet() { return entries; }
/libcore/luni/src/test/java/org/apache/harmony/security/tests/java/security/
H A DMessageDigest2Test.java33 import java.util.Map.Entry;
80 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) {
242 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) {
255 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) {
287 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) {
299 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) {
311 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) {
330 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) {
375 for (Entry<Provider, List<String>> e : digestAlgs.entrySet()) {
405 for (Entry<Provide
[all...]
/libcore/luni/src/test/java/libcore/java/security/
H A DProviderTest.java32 import java.util.Map.Entry;
51 for (Entry<String,Set<String>> entry : remaining.entrySet()) {
152 for (Entry<Object,Object> entry : provider.entrySet()) {
180 for (Entry<String,String> entry : implementations.entrySet()) {
196 for (Entry<String,String> entry : aliases.entrySet()) {
/libcore/luni/src/main/java/java/util/concurrent/
H A DConcurrentSkipListMap.java33 * <p>All {@code Map.Entry} pairs returned by methods in this class
35 * produced. They do <em>not</em> support the {@code Entry.setValue}
1116 Map.Entry<K,V> doRemoveFirstEntry() {
1243 Map.Entry<K,V> doRemoveLastEntry() {
1333 * @return Entry fitting relation, or null if no such
1447 Iterator<? extends Map.Entry<? extends K, ? extends V>> it =
1450 Map.Entry<? extends K, ? extends V> e = it.next();
1778 * <p>The {@code Map.Entry} elements returned by
1785 public Set<Map.Entry<K,V>> entrySet() {
1821 for (Map.Entry<
[all...]
/libcore/luni/src/test/java/tests/api/java/util/
H A DLinkedHashMapTest.java47 protected boolean removeEldestEntry(Map.Entry e) {
176 Map.Entry newest = null;
177 for (Map.Entry<String, String> e : m.entrySet()) {
225 Map.Entry m = (Map.Entry) i.next();
241 Set<Map.Entry<String, String>> s1 = m1.entrySet();
408 Map.Entry<String, String>[] set = new Map.Entry[3];
409 Iterator<Map.Entry<String,String>> iterator = hm1.entrySet().iterator();
443 protected boolean removeEldestEntry(Map.Entry
[all...]
/libcore/luni/src/main/java/org/apache/harmony/security/utils/
H A DAlgNameMapper.java30 import java.util.Map.Entry;
184 Set<Map.Entry<Object, Object>> entrySet = p.entrySet();
187 for (Entry<Object, Object> me : entrySet) {
/libcore/luni/src/main/java/org/apache/harmony/security/asn1/
H A DASN1Choice.java268 Iterator<Map.Entry<BigInteger, BigInteger>> it = map.entrySet().iterator();
271 Map.Entry<BigInteger, BigInteger> entry = it.next();
/libcore/support/src/test/java/tests/support/
H A DSupport_UnmodifiableMapTest.java65 Map.Entry<?, ?> me = (Map.Entry<?, ?>) entrySetIterator.next();
66 assertTrue("UnmodifiableMapTest - Incorrect Map.Entry returned",
/libcore/luni/src/main/java/java/security/
H A DSecurity.java28 import java.util.Map.Entry;
278 Set<Entry<String, String>> keys = filter.entrySet();
279 Map.Entry<String, String> entry;
280 for (Iterator<Entry<String, String>> it = keys.iterator(); it.hasNext();) {
H A DKeyStore.java617 * Returns the {@code Entry} with the given alias, using the specified
625 * @return he {@code Entry} with the given alias, using the specified
636 public final Entry getEntry(String alias, ProtectionParameter param)
648 * Stores the given {@code Entry} in this {@code KeyStore} and associates
666 public final void setEntry(String alias, Entry entry,
688 * @return {@code true} if the {@code Entry} for the alias is assignable to
694 Class<? extends KeyStore.Entry> entryClass)
730 * Entry} with the specified alias is requested. Before this method is
736 * Entry} with the specified alias is requested.
998 * Return: ProtectionParameter to get Entry whic
1078 public static interface Entry { interface in class:KeyStore
[all...]
/libcore/luni/src/main/java/libcore/util/
H A DBasicLruCache.java84 Map.Entry<K, V> toEvict = map.eldest();

Completed in 1393 milliseconds

123