@Override <K, V> Map<K, Collection<V>> createMap() { return newLinkedHashMapWithExpectedSize(expectedKeys); } };
@Override public Map<C, V> get() { return Maps.newLinkedHashMapWithExpectedSize(expectedSize); }
private LinkedHashMultiset(int distinctElements) { super(Maps.<E, Count>newLinkedHashMapWithExpectedSize(distinctElements)); }
/** Returns an empty mutable map whose keys will respect this {@link ElementOrder}. */ <K extends T, V> Map<K, V> createMap(int expectedSize) { switch (type) { case UNORDERED: return Maps.newHashMapWithExpectedSize(expectedSize); case INSERTION: return Maps.newLinkedHashMapWithExpectedSize(expectedSize); case SORTED: return Maps.newTreeMap(comparator()); default: throw new AssertionError(); } }
/** * Creates an empty {@code HashBasedTable} with the specified map sizes. * * @param expectedRows the expected number of distinct row keys * @param expectedCellsPerRow the expected number of column key / value * mappings in each row * @throws IllegalArgumentException if {@code expectedRows} or {@code * expectedCellsPerRow} is negative */ public static <R, C, V> HashBasedTable<R, C, V> create( int expectedRows, int expectedCellsPerRow) { checkNonnegative(expectedCellsPerRow, "expectedCellsPerRow"); Map<R, Map<C, V>> backingMap = Maps.newLinkedHashMapWithExpectedSize(expectedRows); return new HashBasedTable<R, C, V>(backingMap, new Factory<C, V>(expectedCellsPerRow)); }