/libcore/ojluni/src/main/java/java/util/concurrent/ |
H A D | BlockingQueue.java | 100 * time it may have a {@code remainingCapacity} beyond which no 287 * an element will succeed by inspecting {@code remainingCapacity} 293 int remainingCapacity(); method in interface:BlockingQueue
|
H A D | DelayQueue.java | 411 public int remainingCapacity() { method in class:DelayQueue
|
H A D | ArrayBlockingQueue.java | 446 * an element will succeed by inspecting {@code remainingCapacity} 450 public int remainingCapacity() { method in class:ArrayBlockingQueue 1342 // "remainingCapacity()=" + remainingCapacity());
|
H A D | LinkedBlockingQueue.java | 316 * an element will succeed by inspecting {@code remainingCapacity} 320 public int remainingCapacity() { method in class:LinkedBlockingQueue
|
H A D | PriorityBlockingQueue.java | 607 public int remainingCapacity() { method in class:PriorityBlockingQueue
|
H A D | ScheduledThreadPoolExecutor.java | 1031 public int remainingCapacity() { method in class:ScheduledThreadPoolExecutor.DelayedWorkQueue
|
H A D | SynchronousQueue.java | 980 public int remainingCapacity() { method in class:SynchronousQueue
|
H A D | LinkedBlockingDeque.java | 712 * an element will succeed by inspecting {@code remainingCapacity} 716 public int remainingCapacity() { method in class:LinkedBlockingDeque
|
H A D | LinkedTransferQueue.java | 1521 * {@link java.util.concurrent.BlockingQueue#remainingCapacity() 1522 * BlockingQueue.remainingCapacity}) 1524 public int remainingCapacity() { method in class:LinkedTransferQueue
|
/libcore/jsr166-tests/src/test/java/jsr166/ |
H A D | ArrayBlockingQueueTest.java | 66 assertEquals(0, q.remainingCapacity()); 75 assertEquals(SIZE, new ArrayBlockingQueue(SIZE).remainingCapacity()); 156 assertEquals(2, q.remainingCapacity()); 161 assertEquals(0, q.remainingCapacity()); 166 * remainingCapacity decreases on add, increases on remove 171 assertEquals(i, q.remainingCapacity()); 172 assertEquals(SIZE, q.size() + q.remainingCapacity()); 176 assertEquals(SIZE - i, q.remainingCapacity()); 177 assertEquals(SIZE, q.size() + q.remainingCapacity()); 199 assertEquals(0, q.remainingCapacity()); [all...] |
H A D | LinkedBlockingQueueTest.java | 67 assertEquals(0, q.remainingCapacity()); 77 assertEquals(SIZE, new LinkedBlockingQueue(SIZE).remainingCapacity()); 78 assertEquals(Integer.MAX_VALUE, new LinkedBlockingQueue().remainingCapacity()); 145 assertEquals("should have room for 2", 2, q.remainingCapacity()); 150 assertEquals(0, q.remainingCapacity()); 155 * remainingCapacity decreases on add, increases on remove 160 assertEquals(i, q.remainingCapacity()); 161 assertEquals(SIZE, q.size() + q.remainingCapacity()); 165 assertEquals(SIZE - i, q.remainingCapacity()); 166 assertEquals(SIZE, q.size() + q.remainingCapacity()); [all...] |
H A D | LinkedBlockingDequeTest.java | 64 assertEquals(0, q.remainingCapacity()); 333 assertEquals(SIZE, new LinkedBlockingDeque(SIZE).remainingCapacity()); 334 assertEquals(Integer.MAX_VALUE, new LinkedBlockingDeque().remainingCapacity()); 401 assertEquals("should have room for 2", 2, q.remainingCapacity()); 406 assertEquals(0, q.remainingCapacity()); 411 * remainingCapacity decreases on add, increases on remove 416 assertEquals(i, q.remainingCapacity()); 417 assertEquals(SIZE, q.size() + q.remainingCapacity()); 421 assertEquals(SIZE - i, q.remainingCapacity()); 422 assertEquals(SIZE, q.size() + q.remainingCapacity()); [all...] |
H A D | SynchronousQueueTest.java | 64 assertEquals(0, q.remainingCapacity()); 85 assertEquals(0, q.remainingCapacity()); 151 assertEquals(0, q.remainingCapacity()); 177 assertEquals(0, q.remainingCapacity()); 185 assertEquals(0, q.remainingCapacity()); 489 assertEquals(0, q.remainingCapacity()); 542 assertEquals(0, clone.remainingCapacity());
|
H A D | PriorityBlockingQueueTest.java | 77 assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); 87 new PriorityBlockingQueue(SIZE).remainingCapacity()); 168 assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); 178 * remainingCapacity() always returns Integer.MAX_VALUE 183 assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); 188 assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
|
H A D | BlockingQueueTest.java | 198 if (q.remainingCapacity() > 0) { 345 final int size = Math.min(q.remainingCapacity(), SIZE);
|
H A D | DelayQueueTest.java | 147 assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); 156 assertEquals(Integer.MAX_VALUE, new DelayQueue().remainingCapacity()); 210 assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); 220 * remainingCapacity() always returns Integer.MAX_VALUE 225 assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); 230 assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); 527 assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
|
H A D | LinkedTransferQueueTest.java | 133 * remainingCapacity() always returns Integer.MAX_VALUE 138 assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); 143 assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); 415 assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); 560 assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); 564 assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); 1053 assertEquals(Integer.MAX_VALUE, q.remainingCapacity());
|