Searched defs:initialCapacity (Results 1 - 6 of 6) sorted by relevance

/libcore/luni/src/main/java/java/util/
H A DUnsafeArrayList.java31 public UnsafeArrayList(Class<T> elementType, int initialCapacity) { argument
32 this.array = (T[]) Array.newInstance(elementType, initialCapacity);
H A DLinkedHashMap.java75 * @param initialCapacity
80 public LinkedHashMap(int initialCapacity) { argument
81 this(initialCapacity, DEFAULT_LOAD_FACTOR);
88 * @param initialCapacity
96 public LinkedHashMap(int initialCapacity, float loadFactor) { argument
97 this(initialCapacity, loadFactor, false);
104 * @param initialCapacity
118 int initialCapacity, float loadFactor, boolean accessOrder) {
119 super(initialCapacity, loadFactor);
117 LinkedHashMap( int initialCapacity, float loadFactor, boolean accessOrder) argument
H A DPriorityQueue.java63 * @param initialCapacity
66 * if the initialCapacity is less than 1.
68 public PriorityQueue(int initialCapacity) { argument
69 this(initialCapacity, null);
75 * @param initialCapacity
81 * if the initialCapacity is less than 1.
83 public PriorityQueue(int initialCapacity, Comparator<? super E> comparator) { argument
84 if (initialCapacity < 1) {
85 throw new IllegalArgumentException("initialCapacity < 1: " + initialCapacity);
[all...]
/libcore/luni/src/main/java/java/util/concurrent/
H A DPriorityBlockingQueue.java160 * @param initialCapacity the initial capacity for this priority queue
161 * @throws IllegalArgumentException if {@code initialCapacity} is less
164 public PriorityBlockingQueue(int initialCapacity) { argument
165 this(initialCapacity, null);
173 * @param initialCapacity the initial capacity for this priority queue
177 * @throws IllegalArgumentException if {@code initialCapacity} is less
180 public PriorityBlockingQueue(int initialCapacity, argument
182 if (initialCapacity < 1)
187 this.queue = new Object[initialCapacity];
H A DConcurrentHashMap.java78 * initialCapacity} constructor argument. An additional optional
641 * @param initialCapacity The implementation performs internal
646 public ConcurrentHashMap(int initialCapacity) { argument
647 if (initialCapacity < 0)
649 int cap = ((initialCapacity >= (MAXIMUM_CAPACITY >>> 1)) ?
651 tableSizeFor(initialCapacity + (initialCapacity >>> 1) + 1));
667 * the given number of elements ({@code initialCapacity}) and
670 * @param initialCapacity the initial capacity. The implementation
680 public ConcurrentHashMap(int initialCapacity, floa argument
702 ConcurrentHashMap(int initialCapacity, float loadFactor, int concurrencyLevel) argument
1468 newKeySet(int initialCapacity) argument
[all...]
/libcore/benchmarks/libs/
H A Dcaliper.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/caliper/ com/google/caliper/AllocationMeasurer ...

Completed in 1376 milliseconds