/** * Constructs a new (empty) Counter. */ public IntCounter() { this(MapFactory.<E,MutableInteger>hashMapFactory()); }
/** * Creates a new empty TwoDimensionalCollectionValuedMap which uses a HashMap as the * underlying Map. Does not treat Collections as immutable. * * @param cf a CollectionFactory which will be used to generate the * Collections in each mapping */ public TwoDimensionalCollectionValuedMap(CollectionFactory<V> cf) { this(MapFactory.<K2,Collection<V>>hashMapFactory(), cf, false); }
@SuppressWarnings("unchecked") public DeltaMap(Map<K,V> originalMap) { this(originalMap, MapFactory.hashMapFactory()); }
/** * Creates a new empty CollectionValuedMap which uses a HashMap as the * underlying Map. Does not treat Collections as immutable. * * @param cf A CollectionFactory which will be used to generate the Collections * in each mapping */ public CollectionValuedMap(CollectionFactory<V> cf) { this(MapFactory.hashMapFactory(), cf, false); }
public TwoDimensionalIntCounter(int initialCapacity) { this(MapFactory.<K1,IntCounter<K2>>hashMapFactory(), MapFactory.<K2,MutableInteger>hashMapFactory(), initialCapacity); }
public BinaryHeapPriorityQueue() { this(MapFactory.<E,Entry<E>>hashMapFactory()); }
/** * Constructs a new (empty) Counter backed by a HashMap. */ public ClassicCounter() { this(MapFactory.hashMapFactory()); }
public ClassicCounter(int initialCapacity) { this(MapFactory.hashMapFactory(), initialCapacity); }
public TwoDimensionalCounter() { this(MapFactory.<K1, ClassicCounter<K2>> hashMapFactory(), MapFactory.<K2, MutableDouble> hashMapFactory()); }
public TwoDimensionalMap() { this(MapFactory.<K1, Map<K2, V>>hashMapFactory(), MapFactory.<K2, V>hashMapFactory()); }
public DirectedMultiGraph() { this(MapFactory.<V, Map<V, List<E>>>hashMapFactory(), MapFactory.<V, List<E>>hashMapFactory()); }
public TwoDimensionalIntCounter() { this(MapFactory.<K1,IntCounter<K2>>hashMapFactory(), MapFactory.<K2,MutableInteger>hashMapFactory()); }
public BinaryHeapPriorityQueue(int initCapacity) { this(MapFactory.<E,Entry<E>>hashMapFactory(),initCapacity); }
public static <K1, K2, V> TwoDimensionalMap<K1, K2, V> hashMap() { return new TwoDimensionalMap<>(MapFactory.<K1, Map<K2, V>>hashMapFactory(), MapFactory.<K2, V>hashMapFactory()); }
/** * Creates a new empty TwoDimensionalCollectionValuedMap which uses a HashMap as the * underlying Map, and HashSets as the Collections in each mapping. Does not * treat Collections as immutable. */ public TwoDimensionalCollectionValuedMap() { this(MapFactory.<K2,Collection<V>>hashMapFactory(), CollectionFactory.<V>hashSetFactory(), false); }
/** * Creates a new empty CollectionValuedMap which uses a HashMap as the * underlying Map, and HashSets as the Collections in each mapping. Does not * treat Collections as immutable. */ public CollectionValuedMap() { this(MapFactory.hashMapFactory(), CollectionFactory.hashSetFactory(), false); }
public BinaryHeapPriorityQueue<E> deepCopy() { return deepCopy(MapFactory.<E,Entry<E>>hashMapFactory()); }
/** * Creates a new empty CollectionValuedMap which uses a HashMap as the * underlying Map. Does not treat Collections as immutable. * * @param cf A CollectionFactory which will be used to generate the Collections * in each mapping */ public CollectionValuedMap(CollectionFactory<V> cf) { this(MapFactory.hashMapFactory(), cf, false); }
/** * Constructs a new (empty) Counter. */ public IntCounter() { this(MapFactory.<E,MutableInteger>hashMapFactory()); }
/** * Creates a new empty CollectionValuedMap which uses a HashMap as the * underlying Map, and HashSets as the Collections in each mapping. Does not * treat Collections as immutable. */ public CollectionValuedMap() { this(MapFactory.<K, Collection<V>> hashMapFactory(), CollectionFactory.<V> hashSetFactory(), false); }