Searched refs:lastRet (Results 1 - 10 of 10) sorted by relevance
/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | ArrayBlockingQueue.java | 1002 private int lastRet; field in class:ArrayBlockingQueue.Itr 1024 lastRet = NONE; 1105 if (invalidated(lastRet, prevTakeIndex, dequeues, len)) 1106 lastRet = REMOVED; 1112 if (cursor < 0 && nextIndex < 0 && lastRet < 0) 1124 * nextIndex < 0 && lastRet < 0) or as a special exception, when 1125 * lastRet >= 0, because hasNext() is about to return false for the 1133 // assert lastRet < 0 || nextItem == null; 1134 // assert lastRet < 0 ^ lastItem != null; 1164 // assert lastRet > [all...] |
H A D | DelayQueue.java | 505 int lastRet; // index of last element, or -1 if no such field in class:DelayQueue.Itr 508 lastRet = -1; 520 lastRet = cursor; 525 if (lastRet < 0) 527 removeEQ(array[lastRet]); 528 lastRet = -1;
|
H A D | LinkedTransferQueue.java | 794 private Node lastRet; // last returned node, to support remove field in class:LinkedTransferQueue.Itr 795 private Node lastPred; // predecessor to unlink lastRet 811 Node r, b; // reset lastPred upon possible deletion of lastRet 812 if ((r = lastRet) != null && !r.isMatched()) 813 lastPred = r; // next lastPred is old lastRet 824 this.lastRet = prev; 875 final Node lastRet = this.lastRet; 876 if (lastRet == null) 878 this.lastRet [all...] |
H A D | LinkedBlockingQueue.java | 758 private Node<E> lastRet; field in class:LinkedBlockingQueue.Itr 800 lastRet = current; 810 if (lastRet == null) 814 Node<E> node = lastRet; 815 lastRet = null;
|
H A D | PriorityBlockingQueue.java | 847 int lastRet; // index of last element, or -1 if no such field in class:PriorityBlockingQueue.Itr 850 lastRet = -1; 861 lastRet = cursor; 866 if (lastRet < 0) 868 removeEQ(array[lastRet]); 869 lastRet = -1;
|
H A D | ConcurrentLinkedQueue.java | 655 private Node<E> lastRet; field in class:ConcurrentLinkedQueue.Itr 666 lastRet = nextNode; 709 Node<E> l = lastRet; 713 lastRet = null;
|
H A D | ScheduledThreadPoolExecutor.java | 1225 int lastRet = -1; // index of last element, or -1 if no such field in class:ScheduledThreadPoolExecutor.DelayedWorkQueue.Itr 1238 lastRet = cursor; 1243 if (lastRet < 0) 1245 DelayedWorkQueue.this.remove(array[lastRet]); 1246 lastRet = -1;
|
H A D | LinkedBlockingDeque.java | 1032 private Node<E> lastRet; field in class:LinkedBlockingDeque.AbstractItr 1091 lastRet = next; 1098 Node<E> n = lastRet; 1101 lastRet = null;
|
H A D | ConcurrentLinkedDeque.java | 1294 private Node<E> lastRet; field in class:ConcurrentLinkedDeque.AbstractItr 1308 lastRet = nextNode; 1339 Node<E> l = lastRet; 1343 lastRet = null;
|
/libcore/luni/src/main/java/java/util/ |
H A D | ArrayDeque.java | 595 private int lastRet = -1; field in class:ArrayDeque.DeqIterator 609 lastRet = cursor; 615 if (lastRet < 0) 617 if (delete(lastRet)) { // if left-shifted, undo increment in next() 621 lastRet = -1; 633 private int lastRet = -1; field in class:ArrayDeque.DescendingIterator 646 lastRet = cursor; 651 if (lastRet < 0) 653 if (!delete(lastRet)) { 657 lastRet [all...] |
Completed in 1210 milliseconds