/** * Constructs a new, empty bimap with the specified expected size. * * @param expectedSize the expected number of entries * @throws IllegalArgumentException if the specified expected size is negative */ public static <K, V> HashBiMap<K, V> create(int expectedSize) { return new HashBiMap<>(expectedSize); }
/** * Constructs a new, empty bimap with the specified expected size. * * @param expectedSize the expected number of entries * @throws IllegalArgumentException if the specified expected size is negative */ public static <K, V> HashBiMap<K, V> create(int expectedSize) { return new HashBiMap<>(expectedSize); }
/** * Constructs a new, empty bimap with the specified expected size. * * @param expectedSize the expected number of entries * @throws IllegalArgumentException if the specified expected size is negative */ public static <K, V> HashBiMap<K, V> create(int expectedSize) { return new HashBiMap<>(expectedSize); }
/** * Returns a new, empty {@code HashBiMap} with the default initial capacity * (16). */ public static <K, V> HashBiMap<K, V> create() { return new HashBiMap<K, V>(); }
/** * Constructs a new, empty bimap with the specified expected size. * * @param expectedSize the expected number of entries * @throws IllegalArgumentException if the specified expected size is * negative */ public static <K, V> HashBiMap<K, V> create(int expectedSize) { return new HashBiMap<K, V>(expectedSize); }
/** * Constructs a new, empty bimap with the specified expected size. * * @param expectedSize the expected number of entries * @throws IllegalArgumentException if the specified expected size is * negative */ public static <K, V> HashBiMap<K, V> create(int expectedSize) { return new HashBiMap<K, V>(expectedSize); }
/** * Returns a new, empty {@code HashBiMap} with the default initial capacity * (16). */ public static <K, V> HashBiMap<K, V> create() { return new HashBiMap<K, V>(); }
/** * Returns a new, empty {@code HashBiMap} with the default initial capacity * (16). */ public static <K, V> HashBiMap<K, V> create() { return new HashBiMap<K, V>(); }
/** * Constructs a new, empty bimap with the specified expected size. * * @param expectedSize the expected number of entries * @throws IllegalArgumentException if the specified expected size is negative */ public static <K, V> HashBiMap<K, V> create(int expectedSize) { return new HashBiMap<K, V>(expectedSize); }
/** * Constructs a new, empty bimap with the specified expected size. * * @param expectedSize the expected number of entries * @throws IllegalArgumentException if the specified expected size is * negative */ public static <K, V> HashBiMap<K, V> create(int expectedSize) { return new HashBiMap<K, V>(expectedSize); }
/** * Constructs a new, empty bimap with the specified expected size. * * @param expectedSize the expected number of entries * @throws IllegalArgumentException if the specified expected size is * negative */ public static <K, V> HashBiMap<K, V> create(int expectedSize) { return new HashBiMap<K, V>(expectedSize); }
/** * Constructs a new, empty bimap with the specified expected size. * * @param expectedSize the expected number of entries * @throws IllegalArgumentException if the specified expected size is negative */ public static <K, V> HashBiMap<K, V> create(int expectedSize) { return new HashBiMap<K, V>(expectedSize); }
/** * Returns a new empty {@code HashBiMap} with the default initial capacity * (16). */ public static <K, V> HashBiMap<K, V> newHashBiMap() { return new HashBiMap<K, V>(); }
/** * Constructs a new, empty bimap with the specified expected size. * * @param expectedSize the expected number of entries * @throws IllegalArgumentException if the specified expected size is negative */ public static <K, V> HashBiMap<K, V> create(int expectedSize) { return new HashBiMap<>(expectedSize); }
/** * Returns a new, empty {@code HashBiMap} with the default initial capacity * (16). */ public static <K, V> HashBiMap<K, V> create() { return new HashBiMap<K, V>(); }
/** * Constructs a new, empty bimap with the specified expected size. * * @param expectedSize the expected number of entries * @throws IllegalArgumentException if the specified expected size is negative */ public static <K, V> HashBiMap<K, V> create(int expectedSize) { return new HashBiMap<K, V>(expectedSize); }
/** * Constructs a new, empty bimap with the specified expected size. * * @param expectedSize the expected number of entries * @throws IllegalArgumentException if the specified expected size is * negative */ public static <K, V> HashBiMap<K, V> create(int expectedSize) { return new HashBiMap<K, V>(expectedSize); }
/** * Returns a new, empty {@code HashBiMap} with the default initial capacity * (16). */ public static <K, V> HashBiMap<K, V> create() { return new HashBiMap<K, V>(); }
/** * Constructs a new, empty bimap with the specified expected size. * * @param expectedSize the expected number of entries * @throws IllegalArgumentException if the specified expected size is negative */ public static <K, V> HashBiMap<K, V> create(int expectedSize) { return new HashBiMap<K, V>(expectedSize); }
/** * Constructs a new, empty bimap with the specified expected size. * * @param expectedSize the expected number of entries * @throws IllegalArgumentException if the specified expected size is negative */ public static <K, V> HashBiMap<K, V> create(int expectedSize) { return new HashBiMap<K, V>(expectedSize); }