Lines Matching refs:Entry

50 import java.util.Map.Entry;
361 for (Entry<? extends K, ? extends V> entry : left.entrySet()) {
550 for (Entry<? extends K, ? extends V> entry : left.entrySet()) {
712 * Entry#setValue} operation throws an {@link UnsupportedOperationException}.
720 public static <K, V> Entry<K, V> immutableEntry(
727 * Entry#setValue} operation throws an {@link UnsupportedOperationException},
733 static <K, V> Set<Entry<K, V>> unmodifiableEntrySet(
734 Set<Entry<K, V>> entrySet) {
741 * Entry#setValue} operation throws an {@link UnsupportedOperationException}.
743 * the Entry contract, to avoid a possible nefarious implementation of equals.
748 static <K, V> Entry<K, V> unmodifiableEntry(final Entry<K, V> entry) {
763 extends ForwardingCollection<Entry<K, V>> {
764 private final Collection<Entry<K, V>> entries;
766 UnmodifiableEntries(Collection<Entry<K, V>> entries) {
770 @Override protected Collection<Entry<K, V>> delegate() {
774 @Override public Iterator<Entry<K, V>> iterator() {
775 final Iterator<Entry<K, V>> delegate = super.iterator();
776 return new ForwardingIterator<Entry<K, V>>() {
777 @Override public Entry<K, V> next() {
785 @Override protected Iterator<Entry<K, V>> delegate() {
793 @Override public boolean add(Entry<K, V> element) {
798 Collection<? extends Entry<K, V>> collection) {
829 extends UnmodifiableEntries<K, V> implements Set<Entry<K, V>> {
830 UnmodifiableEntrySet(Set<Entry<K, V>> entries) {
1202 Set<Entry<K, V2>> entrySet;
1204 @Override public Set<Entry<K, V2>> entrySet() {
1205 Set<Entry<K, V2>> result = entrySet;
1212 @Override public Iterator<Entry<K, V2>> iterator() {
1213 final Iterator<Entry<K, V1>> backingIterator =
1216 new Function<Entry<K, V1>, Entry<K, V2>>() {
1217 @Override public Entry<K, V2> apply(Entry<K, V1> entry) {
1318 Predicate<Entry<K, V>> entryPredicate =
1319 new Predicate<Entry<K, V>>() {
1321 public boolean apply(Entry<K, V> input) {
1367 Predicate<Entry<K, V>> entryPredicate = new Predicate<Entry<K, V>>() {
1369 public boolean apply(Entry<K, V> input) {
1385 * putAll()}, and {@link Entry#setValue} methods throw an {@link
1411 Predicate<Entry<K, V>> entryPredicate =
1412 new Predicate<Entry<K, V>>() {
1414 public boolean apply(Entry<K, V> input) {
1430 * putAll()}, and {@link Entry#setValue} methods throw an {@link
1456 Predicate<Entry<K, V>> entryPredicate =
1457 new Predicate<Entry<K, V>>() {
1459 public boolean apply(Entry<K, V> input) {
1476 * Similarly, the map's entries have a {@link Entry#setValue} method that
1496 Map<K, V> unfiltered, Predicate<? super Entry<K, V>> entryPredicate) {
1516 * Similarly, the map's entries have a {@link Entry#setValue} method that
1540 Predicate<? super Entry<K, V>> entryPredicate) {
1552 Predicate<? super Entry<K, V>> entryPredicate) {
1553 Predicate<Entry<K, V>> predicate =
1561 final Predicate<? super Entry<K, V>> predicate;
1564 Map<K, V> unfiltered, Predicate<? super Entry<K, V>> predicate) {
1583 for (Entry<? extends K, ? extends V> entry : map.entrySet()) {
1615 final Iterator<Entry<K, V>> entryIterator = entrySet().iterator();
1642 Iterator<Entry<K, V>> iterator = unfiltered.entrySet().iterator();
1644 Entry<K, V> entry = iterator.next();
1656 Iterator<Entry<K, V>> iterator = unfiltered.entrySet().iterator();
1658 Entry<K, V> entry = iterator.next();
1670 Iterator<Entry<K, V>> iterator = unfiltered.entrySet().iterator();
1672 Entry<K, V> entry = iterator.next();
1698 Predicate<? super Entry<K, V>> entryPredicate) {
1699 Predicate<Entry<K, V>> predicate
1708 Predicate<? super Entry<K, V>> entryPredicate) {
1756 Predicate<Entry<K, V>> entryPredicate) {
1761 Set<Entry<K, V>> entrySet;
1763 @Override public Set<Entry<K, V>> entrySet() {
1764 Set<Entry<K, V>> result = entrySet;
1791 * input to {@code Entry.setValue()}.
1793 final Set<Entry<K, V>> filteredEntrySet;
1796 Map<K, V> unfiltered, Predicate<? super Entry<K, V>> entryPredicate) {
1801 Set<Entry<K, V>> entrySet;
1803 @Override public Set<Entry<K, V>> entrySet() {
1804 Set<Entry<K, V>> result = entrySet;
1808 private class EntrySet extends ForwardingSet<Entry<K, V>> {
1809 @Override protected Set<Entry<K, V>> delegate() {
1813 @Override public Iterator<Entry<K, V>> iterator() {
1814 final Iterator<Entry<K, V>> iterator = filteredEntrySet.iterator();
1815 return new UnmodifiableIterator<Entry<K, V>>() {
1822 public Entry<K, V> next() {
1823 final Entry<K, V> entry = iterator.next();
1825 @Override protected Entry<K, V> delegate() {
1848 final Iterator<Entry<K, V>> iterator = filteredEntrySet.iterator();
1894 Iterator<Entry<K, V>> iterator = unfiltered.entrySet().iterator();
1896 Entry<K, V> entry = iterator.next();
1930 protected abstract Set<Entry<K, V>> createEntrySet();
1932 private Set<Entry<K, V>> entrySet;
1934 @Override public Set<Entry<K, V>> entrySet() {
1935 Set<Entry<K, V>> result = entrySet;
2011 * map entries. If {@code o} is an instance of {@code Map.Entry}, it is
2022 static <K, V> boolean containsEntryImpl(Collection<Entry<K, V>> c, Object o) {
2023 if (!(o instanceof Entry)) {
2026 return c.contains(unmodifiableEntry((Entry<?, ?>) o));
2031 * map entries. If {@code o} is an instance of {@code Map.Entry}, it is
2042 static <K, V> boolean removeEntryImpl(Collection<Entry<K, V>> c, Object o) {
2043 if (!(o instanceof Entry)) {
2046 return c.remove(unmodifiableEntry((Entry<?, ?>) o));
2085 for (Map.Entry<? extends K, ? extends V> entry : map.entrySet()) {
2094 for (Entry<?, ?> entry : map.entrySet()) {
2106 for (Entry<?, ?> entry : map.entrySet()) {
2119 new Function<Map.Entry<K, V>, K>() {
2120 @Override public K apply(Entry<K, V> entry) {
2162 new Function<Entry<K, V>, V>() {
2163 @Override public V apply(Entry<K, V> entry) {
2173 for (Entry<K, V> entry : map().entrySet()) {
2188 for (Entry<K, V> entry : map().entrySet()) {
2202 for (Entry<K, V> entry : map().entrySet()) {
2228 abstract static class EntrySet<K, V> extends AbstractSet<Entry<K, V>> {
2240 if (o instanceof Entry) {
2241 Entry<?, ?> entry = (Entry<?, ?>) o;
2256 Entry<?, ?> entry = (Entry<?, ?>) o;
2283 Entry<?, ?> entry = (Entry<?, ?>) o;