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

/libcore/ojluni/src/main/java/java/util/
H A DLinkedHashSet.java128 * @param initialCapacity the initial capacity of the linked hash set
133 public LinkedHashSet(int initialCapacity, float loadFactor) { argument
134 super(initialCapacity, loadFactor, true);
141 * @param initialCapacity the initial capacity of the LinkedHashSet
145 public LinkedHashSet(int initialCapacity) { argument
146 super(initialCapacity, .75f, true);
H A DHashSet.java126 * @param initialCapacity the initial capacity of the hash map
131 public HashSet(int initialCapacity, float loadFactor) { argument
132 map = new HashMap<>(initialCapacity, loadFactor);
139 * @param initialCapacity the initial capacity of the hash table
143 public HashSet(int initialCapacity) { argument
144 map = new HashMap<>(initialCapacity);
153 * @param initialCapacity the initial capacity of the hash map
160 HashSet(int initialCapacity, float loadFactor, boolean dummy) { argument
161 map = new LinkedHashMap<>(initialCapacity, loadFactor);
H A DLinkedHashMap.java365 * @param initialCapacity the initial capacity
370 public LinkedHashMap(int initialCapacity, float loadFactor) { argument
371 super(initialCapacity, loadFactor);
379 * @param initialCapacity the initial capacity
382 public LinkedHashMap(int initialCapacity) { argument
383 super(initialCapacity);
415 * @param initialCapacity the initial capacity
422 public LinkedHashMap(int initialCapacity, argument
425 super(initialCapacity, loadFactor);
H A DPriorityQueue.java130 * @param initialCapacity the initial capacity for this priority queue
131 * @throws IllegalArgumentException if {@code initialCapacity} is less
134 public PriorityQueue(int initialCapacity) { argument
135 this(initialCapacity, null);
155 * @param initialCapacity the initial capacity for this priority queue
159 * @throws IllegalArgumentException if {@code initialCapacity} is
162 public PriorityQueue(int initialCapacity, argument
166 if (initialCapacity < 1)
168 this.queue = new Object[initialCapacity];
H A DArrayList.java160 * @param initialCapacity the initial capacity of the list
164 public ArrayList(int initialCapacity) { argument
165 if (initialCapacity > 0) {
166 this.elementData = new Object[initialCapacity];
167 } else if (initialCapacity == 0) {
171 initialCapacity);
H A DHashtable.java175 * @param initialCapacity the initial capacity of the hashtable.
180 public Hashtable(int initialCapacity, float loadFactor) { argument
181 if (initialCapacity < 0)
183 initialCapacity);
187 if (initialCapacity==0)
188 initialCapacity = 1;
190 table = new HashtableEntry<?,?>[initialCapacity];
191 // Android-changed: Ignore loadFactor when calculating threshold from initialCapacity
192 // threshold = (int)Math.min(initialCapacity * loadFactor, MAX_ARRAY_SIZE + 1);
193 threshold = (int)Math.min(initialCapacity, MAX_ARRAY_SIZ
204 Hashtable(int initialCapacity) argument
[all...]
H A DVector.java124 * @param initialCapacity the initial capacity of the vector
130 public Vector(int initialCapacity, int capacityIncrement) { argument
132 if (initialCapacity < 0)
134 initialCapacity);
135 this.elementData = new Object[initialCapacity];
143 * @param initialCapacity the initial capacity of the vector
147 public Vector(int initialCapacity) { argument
148 this(initialCapacity, 0);
H A DWeakHashMap.java202 * @param initialCapacity The initial capacity of the <tt>WeakHashMap</tt>
207 public WeakHashMap(int initialCapacity, float loadFactor) { argument
208 if (initialCapacity < 0)
210 initialCapacity);
211 if (initialCapacity > MAXIMUM_CAPACITY)
212 initialCapacity = MAXIMUM_CAPACITY;
218 while (capacity < initialCapacity)
229 * @param initialCapacity The initial capacity of the <tt>WeakHashMap</tt>
232 public WeakHashMap(int initialCapacity) { argument
233 this(initialCapacity, DEFAULT_LOAD_FACTO
[all...]
H A DHashMap.java441 * @param initialCapacity the initial capacity
446 public HashMap(int initialCapacity, float loadFactor) { argument
447 if (initialCapacity < 0)
449 initialCapacity);
450 if (initialCapacity > MAXIMUM_CAPACITY)
451 initialCapacity = MAXIMUM_CAPACITY;
456 this.threshold = tableSizeFor(initialCapacity);
463 * @param initialCapacity the initial capacity.
466 public HashMap(int initialCapacity) { argument
467 this(initialCapacity, DEFAULT_LOAD_FACTO
[all...]
/libcore/ojluni/src/main/java/java/util/stream/
H A DAbstractSpinedBuffer.java87 * @param initialCapacity The minimum expected number of elements
89 protected AbstractSpinedBuffer(int initialCapacity) { argument
90 if (initialCapacity < 0)
91 throw new IllegalArgumentException("Illegal Capacity: "+ initialCapacity);
94 Integer.SIZE - Integer.numberOfLeadingZeros(initialCapacity - 1));
H A DSpinedBuffer.java92 * @param initialCapacity the initial capacity of the list
97 public SpinedBuffer(int initialCapacity) { argument
98 super(initialCapacity);
449 * @param initialCapacity the initial capacity of the list
453 OfPrimitive(int initialCapacity) { argument
454 super(initialCapacity);
730 public OfInt(int initialCapacity) { argument
731 super(initialCapacity);
844 public OfLong(int initialCapacity) { argument
845 super(initialCapacity);
960 OfDouble(int initialCapacity) argument
[all...]
H A DStreamSpliterators.java1126 protected abstract T_BUFF bufferCreate(int initialCapacity); argument
1154 protected ArrayBuffer.OfInt bufferCreate(int initialCapacity) { argument
1155 return new ArrayBuffer.OfInt(initialCapacity);
1189 protected ArrayBuffer.OfLong bufferCreate(int initialCapacity) { argument
1190 return new ArrayBuffer.OfLong(initialCapacity);
1224 protected ArrayBuffer.OfDouble bufferCreate(int initialCapacity) { argument
1225 return new ArrayBuffer.OfDouble(initialCapacity);
/libcore/ojluni/src/main/java/sun/util/locale/
H A DLocaleObjectCache.java47 public LocaleObjectCache(int initialCapacity, float loadFactor, int concurrencyLevel) { argument
48 map = new ConcurrentHashMap<>(initialCapacity, loadFactor, concurrencyLevel);
/libcore/ojluni/src/main/java/java/util/concurrent/
H A DPriorityBlockingQueue.java199 * @param initialCapacity the initial capacity for this priority queue
200 * @throws IllegalArgumentException if {@code initialCapacity} is less
203 public PriorityBlockingQueue(int initialCapacity) { argument
204 this(initialCapacity, null);
212 * @param initialCapacity the initial capacity for this priority queue
216 * @throws IllegalArgumentException if {@code initialCapacity} is less
219 public PriorityBlockingQueue(int initialCapacity, argument
221 if (initialCapacity < 1)
226 this.queue = new Object[initialCapacity];
H A DConcurrentHashMap.java119 * initialCapacity} constructor argument. An additional optional
839 * @param initialCapacity The implementation performs internal
844 public ConcurrentHashMap(int initialCapacity) { argument
845 if (initialCapacity < 0)
847 int cap = ((initialCapacity >= (MAXIMUM_CAPACITY >>> 1)) ?
849 tableSizeFor(initialCapacity + (initialCapacity >>> 1) + 1));
865 * the given number of elements ({@code initialCapacity}) and
868 * @param initialCapacity the initial capacity. The implementation
878 public ConcurrentHashMap(int initialCapacity, floa argument
900 ConcurrentHashMap(int initialCapacity, float loadFactor, int concurrencyLevel) argument
2204 newKeySet(int initialCapacity) argument
[all...]
/libcore/ojluni/src/main/java/java/io/
H A DObjectOutputStream.java2345 HandleTable(int initialCapacity, float loadFactor) { argument
2347 spine = new int[initialCapacity];
2348 next = new int[initialCapacity];
2349 objs = new Object[initialCapacity];
2350 threshold = (int) (initialCapacity * loadFactor);
2462 ReplaceTable(int initialCapacity, float loadFactor) { argument
2463 htab = new HandleTable(initialCapacity, loadFactor);
2464 reps = new Object[initialCapacity];
H A DObjectInputStream.java3275 HandleTable(int initialCapacity) { argument
3276 status = new byte[initialCapacity];
3277 entries = new Object[initialCapacity];
3278 deps = new HandleList[initialCapacity];

Completed in 507 milliseconds