/** * Creates a new map that guarantees insertion order on the key set and copies all elements from * the specified existing map. * * @since 1.0 */ static <K, V> EconomicMap<K, V> create(Equivalence strategy, UnmodifiableEconomicMap<K, V> m) { return EconomicMapImpl.create(strategy, m, false); }
/** * Creates a new map that guarantees insertion order on the key set and initializes with a * specified capacity. * * @since 1.0 */ static <K, V> EconomicMap<K, V> create(Equivalence strategy, int initialCapacity) { return EconomicMapImpl.create(strategy, initialCapacity, false); }
/** * Creates a new set guaranteeing insertion order when iterating over its elements and inserts * all elements of the specified collection. * * @since 1.0 */ static <E> EconomicSet<E> create(Equivalence strategy, UnmodifiableEconomicSet<E> c) { return EconomicMapImpl.create(strategy, c, true); } }
/** * Creates a new map that guarantees insertion order on the key set with the given comparison * strategy for keys. * * @since 1.0 */ static <K, V> EconomicMap<K, V> create(Equivalence strategy) { return EconomicMapImpl.create(strategy, false); }
/** * Creates a new set guaranteeing insertion order when iterating over its elements and inserts * all elements of the specified collection. * * @since 1.0 */ static <E> EconomicSet<E> create(Equivalence strategy, UnmodifiableEconomicSet<E> c) { return EconomicMapImpl.create(strategy, c, true); } }
/** * Creates a new set guaranteeing insertion order when iterating over its elements and * initializes with the given capacity. * * @since 1.0 */ static <E> EconomicSet<E> create(Equivalence strategy, int initialCapacity) { return EconomicMapImpl.create(strategy, initialCapacity, true); }
/** * Creates a new map that guarantees insertion order on the key set and copies all elements from * the specified existing map. * * @since 1.0 */ static <K, V> EconomicMap<K, V> create(Equivalence strategy, UnmodifiableEconomicMap<K, V> m) { return EconomicMapImpl.create(strategy, m, false); }
/** * Creates a new set guaranteeing insertion order when iterating over its elements and * initializes with the given capacity. * * @since 1.0 */ static <E> EconomicSet<E> create(Equivalence strategy, int initialCapacity) { return EconomicMapImpl.create(strategy, initialCapacity, true); }
/** * Creates a new map that guarantees insertion order on the key set and initializes with a * specified capacity. * * @since 1.0 */ static <K, V> EconomicMap<K, V> create(Equivalence strategy, int initialCapacity) { return EconomicMapImpl.create(strategy, initialCapacity, false); }
/** * Creates a new set guaranteeing insertion order when iterating over its elements. * * @since 1.0 */ static <E> EconomicSet<E> create(Equivalence strategy) { return EconomicMapImpl.create(strategy, true); }
/** * Creates a new map that guarantees insertion order on the key set with the given comparison * strategy for keys. * * @since 1.0 */ static <K, V> EconomicMap<K, V> create(Equivalence strategy) { return EconomicMapImpl.create(strategy, false); }
/** * Creates a new set guaranteeing insertion order when iterating over its elements. * * @since 1.0 */ static <E> EconomicSet<E> create(Equivalence strategy) { return EconomicMapImpl.create(strategy, true); }