HomeSort by relevance Sort by last modified time
    Searched refs:CAPACITY (Results 1 - 5 of 5) sorted by null

  /libcore/luni/src/test/java/tests/api/java/util/
AbstractQueueTest.java 41 static final int CAPACITY = 10;
45 private Object[] elements = new Object[CAPACITY];
85 if (size >= CAPACITY) {
144 for(int i = 0; i < MockAbstractQueue.CAPACITY; i++ ) {
  /libcore/luni/src/test/java/libcore/java/nio/channels/
OldFileChannelTest.java 55 private static final int CAPACITY = 100;
400 ByteBuffer readBuffer = ByteBuffer.allocate(CAPACITY);
721 readBuffers[0] = ByteBuffer.allocate(CAPACITY);
722 readBuffers[1] = ByteBuffer.allocate(CAPACITY);
795 readBuffers[0] = ByteBuffer.allocate(CAPACITY);
796 readBuffers[1] = ByteBuffer.allocate(CAPACITY);
814 readBuffers[0] = ByteBuffer.allocate(CAPACITY);
823 readBuffers[0] = ByteBuffer.allocate(CAPACITY);
874 ByteBuffer writeBuffer = ByteBuffer.allocate(CAPACITY);
    [all...]
  /libcore/luni/src/main/java/org/apache/harmony/security/x501/
AttributeTypeAndValue.java 109 // pool's capacity
110 private static final int CAPACITY;
134 CAPACITY = 10;
136 KNOWN_OIDS = new ObjectIdentifier[SIZE][CAPACITY];
497 int index = hashIntArray(oid) % CAPACITY;
514 int index = hashIntArray(newOid) % CAPACITY;
529 if (i == (CAPACITY - 1)) {
531 "small OID pool capacity");
  /libcore/luni/src/main/java/java/util/concurrent/
Exchanger.java 189 * The capacity of the arena. Set to a value that provides more
199 private static final int CAPACITY = 32;
203 * contention. When this value is less than CAPACITY, some
207 Math.max(0, Math.min(CAPACITY, NCPU / 2) - 1);
288 private volatile Slot[] arena = new Slot[CAPACITY];
ThreadPoolExecutor.java 146 * capacity) will cause new tasks to wait in the queue when all
179 * work queue capacity, and is saturated. In either case, the {@code
209 * capacity or queuing policies. </dd>
353 private static final int CAPACITY = (1 << COUNT_BITS) - 1;
363 private static int runStateOf(int c) { return c & ~CAPACITY; }
364 private static int workerCountOf(int c) { return c & CAPACITY; }
508 * bounded by CAPACITY.
    [all...]

Completed in 902 milliseconds