@Override Iterator<Entry<K, V>> descendingEntryIterator() { return descendingMap().entrySet().iterator(); }
public static <K, V> NavigableMap<K, V> asMap( NavigableSet<K> set, Function<? super K, V> function) { return new NavigableAsMapView<K, V>(set, function);
public static <K, V> NavigableMap<K, V> asMap( NavigableSet<K> set, Function<? super K, V> function) { return new NavigableAsMapView<K, V>(set, function);
public static <K, V> NavigableMap<K, V> asMap( NavigableSet<K> set, Function<? super K, V> function) { return new NavigableAsMapView<K, V>(set, function);
public static <K, V> NavigableMap<K, V> asMap( NavigableSet<K> set, Function<? super K, V> function) { return new NavigableAsMapView<K, V>(set, function);
public static <K, V> NavigableMap<K, V> asMap( NavigableSet<K> set, Function<? super K, V> function) { return new NavigableAsMapView<K, V>(set, function);
public static <K, V> NavigableMap<K, V> asMap( NavigableSet<K> set, Function<? super K, V> function) { return new NavigableAsMapView<K, V>(set, function);
public static <K, V> NavigableMap<K, V> asMap( NavigableSet<K> set, Function<? super K, V> function) { return new NavigableAsMapView<K, V>(set, function);
/** * Returns a view of the navigable set as a map, mapping keys from the set according to the * specified function. * * <p>Specifically, for each {@code k} in the backing set, the returned map has an entry mapping * {@code k} to {@code function.apply(k)}. The {@code keySet}, {@code values}, and {@code * entrySet} views of the returned map iterate in the same order as the backing set. * * <p>Modifications to the backing set are read through to the returned map. The returned map * supports removal operations if the backing set does. Removal operations write through to the * backing set. The returned map does not support put operations. * * <p><b>Warning:</b> If the function rejects {@code null}, caution is required to make sure the * set does not contain {@code null}, because the view cannot stop {@code null} from being added * to the set. * * <p><b>Warning:</b> This method assumes that for any instance {@code k} of key type {@code K}, * {@code k.equals(k2)} implies that {@code k2} is also of type {@code K}. Using a key type for * which this may not hold, such as {@code ArrayList}, may risk a {@code ClassCastException} when * calling methods on the resulting map view. * * @since 14.0 */ @GwtIncompatible // NavigableMap public static <K, V> NavigableMap<K, V> asMap( NavigableSet<K> set, Function<? super K, V> function) { return new NavigableAsMapView<>(set, function); }
/** * Returns a view of the navigable set as a map, mapping keys from the set according to the * specified function. * * <p>Specifically, for each {@code k} in the backing set, the returned map has an entry mapping * {@code k} to {@code function.apply(k)}. The {@code keySet}, {@code values}, and {@code * entrySet} views of the returned map iterate in the same order as the backing set. * * <p>Modifications to the backing set are read through to the returned map. The returned map * supports removal operations if the backing set does. Removal operations write through to the * backing set. The returned map does not support put operations. * * <p><b>Warning:</b> If the function rejects {@code null}, caution is required to make sure the * set does not contain {@code null}, because the view cannot stop {@code null} from being added * to the set. * * <p><b>Warning:</b> This method assumes that for any instance {@code k} of key type {@code K}, * {@code k.equals(k2)} implies that {@code k2} is also of type {@code K}. Using a key type for * which this may not hold, such as {@code ArrayList}, may risk a {@code ClassCastException} when * calling methods on the resulting map view. * * @since 14.0 */ @GwtIncompatible // NavigableMap public static <K, V> NavigableMap<K, V> asMap( NavigableSet<K> set, Function<? super K, V> function) { return new NavigableAsMapView<>(set, function); }
@Override Iterator<Entry<K, V>> descendingEntryIterator() { return descendingMap().entrySet().iterator(); }
@Override Iterator<Entry<K, V>> descendingEntryIterator() { return descendingMap().entrySet().iterator(); }
@Override Iterator<Entry<K, V>> descendingEntryIterator() { return descendingMap().entrySet().iterator(); }
@Override Iterator<Entry<K, V>> descendingEntryIterator() { return descendingMap().entrySet().iterator(); }
@Override Iterator<Entry<K, V>> descendingEntryIterator() { return descendingMap().entrySet().iterator(); }
@Override Iterator<Entry<K, V>> descendingEntryIterator() { return descendingMap().entrySet().iterator(); }
@Override Iterator<Entry<K, V>> descendingEntryIterator() { return descendingMap().entrySet().iterator(); }
@Override Iterator<Entry<K, V>> descendingEntryIterator() { return descendingMap().entrySet().iterator(); }
@Override public @Nullable V get(@Nullable Object key) { return getOrDefault(key, null); }
@Override Iterator<Entry<K, V>> descendingEntryIterator() { return descendingMap().entrySet().iterator(); }