/** * A sensible definition of {@link #lastEntry} in terms of the {@code iterator()} of the {@link * #entrySet} of {@link #descendingMap}. If you override {@code descendingMap}, you may wish to * override {@code lastEntry} to forward to this implementation. */ protected Entry<K, V> standardLastEntry() { return Iterables.getFirst(descendingMap().entrySet(), null); }
/** * A sensible definition of {@link #pollFirstEntry} in terms of the {@code iterator} of the {@code * entrySet} of {@code descendingMap}. If you override {@code descendingMap}, you may wish to * override {@code pollFirstEntry} to forward to this implementation. */ protected Entry<K, V> standardPollLastEntry() { return Iterators.pollNext(descendingMap().entrySet().iterator()); }
/** * A sensible definition of {@link #descendingKeySet} as the {@code navigableKeySet} of {@link * #descendingMap}. (The {@link StandardDescendingMap} implementation implements {@code * navigableKeySet} on its own, so as not to cause an infinite loop.) If you override {@code * descendingMap}, you may wish to override {@code descendingKeySet} to forward to this * implementation. */ @Beta protected NavigableSet<K> standardDescendingKeySet() { return descendingMap().navigableKeySet(); }
/** * A sensible definition of {@link #lastEntry} in terms of the {@code iterator()} of the {@link * #entrySet} of {@link #descendingMap}. If you override {@code descendingMap}, you may wish to * override {@code lastEntry} to forward to this implementation. */ protected Entry<K, V> standardLastEntry() { return Iterables.getFirst(descendingMap().entrySet(), null); }
/** * A sensible definition of {@link #lastEntry} in terms of the {@code iterator()} of the {@link * #entrySet} of {@link #descendingMap}. If you override {@code descendingMap}, you may wish to * override {@code lastEntry} to forward to this implementation. */ protected Entry<K, V> standardLastEntry() { return Iterables.getFirst(descendingMap().entrySet(), null); }
/** * A sensible definition of {@link #pollFirstEntry} in terms of the {@code iterator} of the {@code * entrySet} of {@code descendingMap}. If you override {@code descendingMap}, you may wish to * override {@code pollFirstEntry} to forward to this implementation. */ protected Entry<K, V> standardPollLastEntry() { return Iterators.pollNext(descendingMap().entrySet().iterator()); }
/** * A sensible definition of {@link #descendingKeySet} as the {@code navigableKeySet} of {@link * #descendingMap}. (The {@link StandardDescendingMap} implementation implements {@code * navigableKeySet} on its own, so as not to cause an infinite loop.) If you override {@code * descendingMap}, you may wish to override {@code descendingKeySet} to forward to this * implementation. */ @Beta protected NavigableSet<K> standardDescendingKeySet() { return descendingMap().navigableKeySet(); }
/** * A sensible definition of {@link #descendingKeySet} as the {@code navigableKeySet} of {@link * #descendingMap}. (The {@link StandardDescendingMap} implementation implements {@code * navigableKeySet} on its own, so as not to cause an infinite loop.) If you override {@code * descendingMap}, you may wish to override {@code descendingKeySet} to forward to this * implementation. */ @Beta protected NavigableSet<K> standardDescendingKeySet() { return descendingMap().navigableKeySet(); }
/** * A sensible definition of {@link #pollFirstEntry} in terms of the {@code iterator} of the {@code * entrySet} of {@code descendingMap}. If you override {@code descendingMap}, you may wish to * override {@code pollFirstEntry} to forward to this implementation. */ protected Entry<K, V> standardPollLastEntry() { return Iterators.pollNext(descendingMap().entrySet().iterator()); }
/** * A sensible definition of {@link #lastEntry} in terms of the {@code iterator()} of the * {@link #entrySet} of {@link #descendingMap}. If you override {@code descendingMap}, you may * wish to override {@code lastEntry} to forward to this implementation. */ protected Entry<K, V> standardLastEntry() { return Iterables.getFirst(descendingMap().entrySet(), null); }
/** * A sensible definition of {@link #lastEntry} in terms of the {@code iterator()} of the * {@link #entrySet} of {@link #descendingMap}. If you override {@code descendingMap}, you may * wish to override {@code lastEntry} to forward to this implementation. */ protected Entry<K, V> standardLastEntry() { return Iterables.getFirst(descendingMap().entrySet(), null); }
/** * A sensible definition of {@link #lastEntry} in terms of the {@code iterator()} of the * {@link #entrySet} of {@link #descendingMap}. If you override {@code descendingMap}, you may * wish to override {@code lastEntry} to forward to this implementation. */ protected Entry<K, V> standardLastEntry() { return Iterables.getFirst(descendingMap().entrySet(), null); }
/** * A sensible definition of {@link #pollFirstEntry} in terms of the {@code iterator} of the * {@code entrySet} of {@code descendingMap}. If you override {@code descendingMap}, you may wish * to override {@code pollFirstEntry} to forward to this implementation. */ protected Entry<K, V> standardPollLastEntry() { return Iterators.pollNext(descendingMap().entrySet().iterator()); }
/** * A sensible definition of {@link #descendingKeySet} as the {@code navigableKeySet} of * {@link #descendingMap}. (The {@link StandardDescendingMap} implementation implements * {@code navigableKeySet} on its own, so as not to cause an infinite loop.) If you override * {@code descendingMap}, you may wish to override {@code descendingKeySet} to forward to this * implementation. */ @Beta protected NavigableSet<K> standardDescendingKeySet() { return descendingMap().navigableKeySet(); }
/** * A sensible definition of {@link #pollFirstEntry} in terms of the {@code iterator} of the * {@code entrySet} of {@code descendingMap}. If you override {@code descendingMap}, you may wish * to override {@code pollFirstEntry} to forward to this implementation. */ protected Entry<K, V> standardPollLastEntry() { return Iterators.pollNext(descendingMap().entrySet().iterator()); }
/** * A sensible definition of {@link #descendingKeySet} as the {@code navigableKeySet} of {@link * #descendingMap}. (The {@link StandardDescendingMap} implementation implements {@code * navigableKeySet} on its own, so as not to cause an infinite loop.) If you override {@code * descendingMap}, you may wish to override {@code descendingKeySet} to forward to this * implementation. */ @Beta protected NavigableSet<K> standardDescendingKeySet() { return descendingMap().navigableKeySet(); }
/** * A sensible definition of {@link #descendingKeySet} as the {@code navigableKeySet} of * {@link #descendingMap}. (The {@link StandardDescendingMap} implementation implements * {@code navigableKeySet} on its own, so as not to cause an infinite loop.) If you override * {@code descendingMap}, you may wish to override {@code descendingKeySet} to forward to this * implementation. */ @Beta protected NavigableSet<K> standardDescendingKeySet() { return descendingMap().navigableKeySet(); }
/** * A sensible definition of {@link #pollFirstEntry} in terms of the {@code iterator} of the * {@code entrySet} of {@code descendingMap}. If you override {@code descendingMap}, you may wish * to override {@code pollFirstEntry} to forward to this implementation. */ protected Entry<K, V> standardPollLastEntry() { return Iterators.pollNext(descendingMap().entrySet().iterator()); }
/** * A sensible definition of {@link #descendingKeySet} as the {@code navigableKeySet} of * {@link #descendingMap}. (The {@link StandardDescendingMap} implementation implements * {@code navigableKeySet} on its own, so as not to cause an infinite loop.) If you override * {@code descendingMap}, you may wish to override {@code descendingKeySet} to forward to this * implementation. */ @Beta protected NavigableSet<K> standardDescendingKeySet() { return descendingMap().navigableKeySet(); }
/** * A sensible definition of {@link #descendingKeySet} as the {@code navigableKeySet} of * {@link #descendingMap}. (The {@link StandardDescendingMap} implementation implements * {@code navigableKeySet} on its own, so as not to cause an infinite loop.) If you override * {@code descendingMap}, you may wish to override {@code descendingKeySet} to forward to this * implementation. */ @Beta protected NavigableSet<K> standardDescendingKeySet() { return descendingMap().navigableKeySet(); }