/libcore/luni/src/main/java/java/util/ |
H A D | ArrayList.java | 46 * The minimum amount by which the capacity of an ArrayList will increase. 49 * RI's specified default initial capacity of 10: instead of 10, we start 66 * initial capacity. 68 * @param capacity 69 * the initial capacity of this {@code ArrayList}. 71 public ArrayList(int capacity) { argument 72 if (capacity < 0) { 73 throw new IllegalArgumentException("capacity < 0: " + capacity); 75 array = (capacity [all...] |
H A D | PriorityQueue.java | 52 * Constructs a priority queue with an initial capacity of 11 and natural 60 * Constructs a priority queue with the specified capacity and natural 64 * the specified capacity. 73 * Constructs a priority queue with the specified capacity and comparator. 76 * the specified capacity. 93 * The constructed priority queue has the initial capacity of 110% of the 118 * priority queue. The constructed priority queue has the initial capacity 132 * The constructed priority queue has the initial capacity of 110% of the 304 int capacity = in.readInt(); 305 elements = newElementArray(capacity); 312 newElementArray(int capacity) argument [all...] |
H A D | Vector.java | 64 * Constructs a new vector using the default capacity. 71 * Constructs a new vector using the specified capacity. 73 * @param capacity 74 * the initial capacity of the new vector. 76 * if {@code capacity} is negative. 78 public Vector(int capacity) { argument 79 this(capacity, 0); 83 * Constructs a new vector using the specified capacity and capacity 86 * @param capacity 93 Vector(int capacity, int capacityIncrement) argument 235 public synchronized int capacity() { method in class:Vector [all...] |
H A D | WeakHashMap.java | 193 * capacity. 195 * @param capacity 196 * the initial capacity of this map. 198 * if the capacity is less than zero. 200 public WeakHashMap(int capacity) { argument 201 if (capacity < 0) { 202 throw new IllegalArgumentException("capacity < 0: " + capacity); 205 elementData = newEntryArray(capacity == 0 ? 1 : capacity); 223 WeakHashMap(int capacity, float loadFactor) argument [all...] |
H A D | HashMap.java | 55 * Min capacity (other than zero) for a HashMap. Must be a power of two 61 * Max capacity for a HashMap. Must be a power of two >= MINIMUM_CAPACITY. 66 * An empty table shared by all zero-capacity maps (typically from default 110 * The value of this field is generally .75 * capacity, except when 111 * the capacity is zero, as described in the EMPTY_TABLE declaration 131 * Constructs a new {@code HashMap} instance with the specified capacity. 133 * @param capacity 134 * the initial capacity of this hash map. 136 * when the capacity is less than zero. 138 public HashMap(int capacity) { argument 173 HashMap(int capacity, float loadFactor) argument [all...] |
H A D | Hashtable.java | 40 * Min capacity (other than zero) for a Hashtable. Must be a power of two 46 * Max capacity for a Hashtable. Must be a power of two >= MINIMUM_CAPACITY. 51 * An empty table shared by all zero-capacity maps (typically from default 89 * The value of this field is generally .75 * capacity, except when 90 * the capacity is zero, as described in the EMPTY_TABLE declaration 101 * Constructs a new {@code Hashtable} using the default capacity and load 111 * Constructs a new {@code Hashtable} using the specified capacity and the 114 * @param capacity 115 * the initial capacity. 117 public Hashtable(int capacity) { argument 149 Hashtable(int capacity, float loadFactor) argument [all...] |
/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | LinkedBlockingQueue.java | 34 * <p>The optional capacity bound constructor argument serves as a 35 * way to prevent excessive queue expansion. The capacity, if unspecified, 38 * queue above capacity. 104 /** The capacity bound, or Integer.MAX_VALUE if none */ 105 private final int capacity; field in class:LinkedBlockingQueue 214 * Creates a {@code LinkedBlockingQueue} with a capacity of 222 * Creates a {@code LinkedBlockingQueue} with the given (fixed) capacity. 224 * @param capacity the capacity of this queue 225 * @throws IllegalArgumentException if {@code capacity} i 228 LinkedBlockingQueue(int capacity) argument [all...] |
H A D | LinkedBlockingDeque.java | 24 * <p>The optional capacity bound constructor argument serves as a 25 * way to prevent excessive expansion. The capacity, if unspecified, 28 * deque above capacity. 123 private final int capacity; field in class:LinkedBlockingDeque 135 * Creates a {@code LinkedBlockingDeque} with a capacity of 143 * Creates a {@code LinkedBlockingDeque} with the given (fixed) capacity. 145 * @param capacity the capacity of this deque 146 * @throws IllegalArgumentException if {@code capacity} is less than 1 148 public LinkedBlockingDeque(int capacity) { argument [all...] |
H A D | ArrayBlockingQueue.java | 31 * extracted by consumers. Once created, the capacity cannot be 203 * capacity and default access policy. 205 * @param capacity the capacity of this queue 206 * @throws IllegalArgumentException if {@code capacity < 1} 208 public ArrayBlockingQueue(int capacity) { argument 209 this(capacity, false); 214 * capacity and the specified access policy. 216 * @param capacity the capacity o 222 ArrayBlockingQueue(int capacity, boolean fair) argument 247 ArrayBlockingQueue(int capacity, boolean fair, Collection<? extends E> c) argument [all...] |
/libcore/luni/src/main/native/ |
H A D | org_apache_harmony_xml_ExpatParser.cpp | 63 StringStack() : array(new jstring[DEFAULT_CAPACITY]), capacity(DEFAULT_CAPACITY), size(0) { 71 if (size == capacity) { 72 int newCapacity = capacity * 2; 78 memcpy(newArray, array, capacity * sizeof(jstring)); 82 capacity = newCapacity; 96 int capacity; member in class:StringStack
|
/libcore/benchmarks/libs/ |
H A D | caliper.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/caliper/ com/google/caliper/AllocationMeasurer ... |