Lines Matching defs:Entry

505         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> {
857 private Entry(int index) {
888 if (!(o instanceof Map.Entry))
890 Map.Entry<?,?> e = (Map.Entry<?,?>)o;
913 throw new IllegalStateException("Entry was removed");
925 private transient Set<Map.Entry<K,V>> entrySet;
1141 * <tt>Map.Entry</tt>. The set is backed by the map, so changes
1151 * <p>Like the backing map, the <tt>Map.Entry</tt> objects in the set
1155 * <tt>Map.Entry</tt> objects. A reference-equality based <tt>Map.Entry
1157 * <tt>Map.Entry</tt> and <tt>e.getKey()==o.getKey() &amp;&amp;
1164 * <tt>Map.Entry</tt> instances in the set returned by this method,
1176 public Set<Map.Entry<K,V>> entrySet() {
1177 Set<Map.Entry<K,V>> es = entrySet;
1184 private class EntrySet extends AbstractSet<Map.Entry<K,V>> {
1185 public Iterator<Map.Entry<K,V>> iterator() {
1189 if (!(o instanceof Map.Entry))
1191 Map.Entry<?,?> entry = (Map.Entry<?,?>)o;
1195 if (!(o instanceof Map.Entry))
1197 Map.Entry<?,?> entry = (Map.Entry<?,?>)o;
1214 for (Iterator<Map.Entry<K,V>> i = iterator(); i.hasNext(); ) {
1256 public Spliterator<Map.Entry<K,V>> spliterator() {
1533 implements Spliterator<Map.Entry<K,V>> {
1546 public void forEachRemaining(Consumer<? super Map.Entry<K, V>> action) {
1570 public boolean tryAdvance(Consumer<? super Map.Entry<K,V>> action) {