Searched defs:initialCapacity (Results 1 - 18 of 18) 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.java124 * @param initialCapacity the initial capacity of the hash map
129 public HashSet(int initialCapacity, float loadFactor) { argument
130 map = new HashMap<>(initialCapacity, loadFactor);
137 * @param initialCapacity the initial capacity of the hash table
141 public HashSet(int initialCapacity) { argument
142 map = new HashMap<>(initialCapacity);
151 * @param initialCapacity the initial capacity of the hash map
158 HashSet(int initialCapacity, float loadFactor, boolean dummy) { argument
159 map = new LinkedHashMap<>(initialCapacity, loadFactor);
H A DLinkedHashMap.java190 * @param initialCapacity the initial capacity
195 public LinkedHashMap(int initialCapacity, float loadFactor) { argument
196 super(initialCapacity, loadFactor);
204 * @param initialCapacity the initial capacity
207 public LinkedHashMap(int initialCapacity) { argument
208 super(initialCapacity);
239 * @param initialCapacity the initial capacity
246 public LinkedHashMap(int initialCapacity, argument
249 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.java142 * @param initialCapacity the initial capacity of the list
146 public ArrayList(int initialCapacity) { argument
148 if (initialCapacity < 0)
150 initialCapacity);
151 this.elementData = new Object[initialCapacity];
H A DHashtable.java179 * @param initialCapacity the initial capacity of the hashtable.
184 public Hashtable(int initialCapacity, float loadFactor) { argument
185 if (initialCapacity < 0)
187 initialCapacity);
191 if (initialCapacity==0)
192 initialCapacity = 1;
194 table = new HashtableEntry[initialCapacity];
195 threshold = (initialCapacity <= MAX_ARRAY_SIZE + 1) ? initialCapacity : MAX_ARRAY_SIZE + 1;
202 * @param initialCapacity th
206 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.java201 * @param initialCapacity The initial capacity of the <tt>WeakHashMap</tt>
206 public WeakHashMap(int initialCapacity, float loadFactor) { argument
207 if (initialCapacity < 0)
209 initialCapacity);
210 if (initialCapacity > MAXIMUM_CAPACITY)
211 initialCapacity = MAXIMUM_CAPACITY;
217 while (capacity < initialCapacity)
228 * @param initialCapacity The initial capacity of the <tt>WeakHashMap</tt>
231 public WeakHashMap(int initialCapacity) { argument
232 this(initialCapacity, DEFAULT_LOAD_FACTO
[all...]
H A DHashMap.java196 * @param initialCapacity the initial capacity
201 public HashMap(int initialCapacity, float loadFactor) { argument
202 if (initialCapacity < 0)
204 initialCapacity);
205 if (initialCapacity > MAXIMUM_CAPACITY) {
206 initialCapacity = MAXIMUM_CAPACITY;
207 } else if (initialCapacity < DEFAULT_INITIAL_CAPACITY) {
208 initialCapacity = DEFAULT_INITIAL_CAPACITY;
220 threshold = initialCapacity;
228 * @param initialCapacity th
231 HashMap(int initialCapacity) argument
[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/sun/misc/
H A DSoftCache.java183 * @param initialCapacity The initial capacity of the cache
191 public SoftCache(int initialCapacity, float loadFactor) { argument
192 hash = new HashMap(initialCapacity, loadFactor);
199 * @param initialCapacity The initial capacity of the cache
204 public SoftCache(int initialCapacity) { argument
205 hash = new HashMap(initialCapacity);
/libcore/luni/src/main/java/java/util/concurrent/
H A DPriorityBlockingQueue.java170 * @param initialCapacity the initial capacity for this priority queue
171 * @throws IllegalArgumentException if {@code initialCapacity} is less
174 public PriorityBlockingQueue(int initialCapacity) { argument
175 this(initialCapacity, null);
183 * @param initialCapacity the initial capacity for this priority queue
187 * @throws IllegalArgumentException if {@code initialCapacity} is less
190 public PriorityBlockingQueue(int initialCapacity, argument
192 if (initialCapacity < 1)
197 this.queue = new Object[initialCapacity];
H A DConcurrentHashMap.java90 * initialCapacity} constructor argument. An additional optional
810 * @param initialCapacity The implementation performs internal
815 public ConcurrentHashMap(int initialCapacity) { argument
816 if (initialCapacity < 0)
818 int cap = ((initialCapacity >= (MAXIMUM_CAPACITY >>> 1)) ?
820 tableSizeFor(initialCapacity + (initialCapacity >>> 1) + 1));
836 * the given number of elements ({@code initialCapacity}) and
839 * @param initialCapacity the initial capacity. The implementation
849 public ConcurrentHashMap(int initialCapacity, floa argument
871 ConcurrentHashMap(int initialCapacity, float loadFactor, int concurrencyLevel) argument
2175 newKeySet(int initialCapacity) argument
[all...]
/libcore/ojluni/src/main/java/java/io/
H A DObjectOutputStream.java2332 HandleTable(int initialCapacity, float loadFactor) { argument
2334 spine = new int[initialCapacity];
2335 next = new int[initialCapacity];
2336 objs = new Object[initialCapacity];
2337 threshold = (int) (initialCapacity * loadFactor);
2449 ReplaceTable(int initialCapacity, float loadFactor) { argument
2450 htab = new HandleTable(initialCapacity, loadFactor);
2451 reps = new Object[initialCapacity];
H A DObjectInputStream.java3263 HandleTable(int initialCapacity) { argument
3264 status = new byte[initialCapacity];
3265 entries = new Object[initialCapacity];
3266 deps = new HandleList[initialCapacity];

Completed in 879 milliseconds