/** * Create a new {@link CopyOnWriteSortedMap} where the underlying map * instances are {@link TreeMap} and the sort uses the key's natural order. * * @deprecated use {@link CopyOnWriteSortedMap#newTreeMap()} instead. */ @Deprecated public static <K, V> CopyOnWriteSortedMap<K, V> newTreeMap() { return CopyOnWriteSortedMap.newTreeMap(); }
/** * Create a new {@link CopyOnWriteSortedMap} where the underlying map * instances are {@link TreeMap}, the sort uses the key's natural order and * the initial values are supplied. * * @param map the map to use as the initial values. * @deprecated use {@link CopyOnWriteSortedMap#newTreeMap(Map)} instead. */ @Deprecated public static <K, V> CopyOnWriteSortedMap<K, V> newTreeMap(final Map<? extends K, ? extends V> map) { return CopyOnWriteSortedMap.newTreeMap(map); }
/** * Create a new {@link CopyOnWriteSortedMap} where the underlying map * instances are {@link TreeMap}. * * @param comparator the Comparator to use for ordering the keys. * @deprecated use {@link CopyOnWriteSortedMap#newTreeMap(Comparator)} * instead. */ @Deprecated public static <K, V> CopyOnWriteSortedMap<K, V> newTreeMap(final Comparator<? super K> comparator) { return CopyOnWriteSortedMap.newTreeMap(comparator); }
/** * Create a new {@link CopyOnWriteSortedMap} where the underlying map * instances are {@link TreeMap}, the sort uses the key's natural order and * the initial values are supplied. * * @param map to use as the initial values. * @param comparator for ordering. * @deprecated use {@link CopyOnWriteSortedMap#newTreeMap(Map, Comparator)} * instead. */ @Deprecated public static <K, V> CopyOnWriteSortedMap<K, V> newTreeMap(final Map<? extends K, ? extends V> map, final Comparator<? super K> comparator) { return CopyOnWriteSortedMap.newTreeMap(map, comparator); } }