/libcore/ojluni/src/main/java/java/util/concurrent/ |
D | ArrayBlockingQueue.java | 990 private int lastRet; field in ArrayBlockingQueue.Itr 1012 lastRet = NONE; in Itr() 1092 if (invalidated(lastRet, prevTakeIndex, dequeues, len)) in incorporateDequeues() 1093 lastRet = REMOVED; in incorporateDequeues() 1099 if (cursor < 0 && nextIndex < 0 && lastRet < 0) in incorporateDequeues() 1153 if (lastRet >= 0) { in noNext() 1154 lastItem = itemAt(lastRet); in noNext() 1178 lastRet = nextIndex; in next() 1201 final int lastRet = this.lastRet; in remove() local 1202 this.lastRet = NONE; in remove() [all …]
|
D | DelayQueue.java | 535 int lastRet; // index of last element, or -1 if no such field in DelayQueue.Itr 538 lastRet = -1; in Itr() 550 lastRet = cursor; in next() 555 if (lastRet < 0) in remove() 557 removeEQ(array[lastRet]); in remove() 558 lastRet = -1; in remove()
|
D | LinkedTransferQueue.java | 929 private Node lastRet; // last returned node, to support remove field in LinkedTransferQueue.Itr 947 if ((r = lastRet) != null && !r.isMatched()) in advance() 959 this.lastRet = prev; in advance() 1011 final Node lastRet = this.lastRet; in remove() local 1012 if (lastRet == null) in remove() 1014 this.lastRet = null; in remove() 1015 if (lastRet.tryMatchData()) in remove() 1016 unsplice(lastPred, lastRet); in remove()
|
D | PriorityBlockingQueue.java | 864 int lastRet; // index of last element, or -1 if no such field in PriorityBlockingQueue.Itr 867 lastRet = -1; in Itr() 878 lastRet = cursor; in next() 883 if (lastRet < 0) in remove() 885 removeEQ(array[lastRet]); in remove() 886 lastRet = -1; in remove()
|
D | LinkedBlockingQueue.java | 764 private Node<E> lastRet; field in LinkedBlockingQueue.Itr 787 lastRet = current; in next() 808 if (lastRet == null) in remove() 812 Node<E> node = lastRet; in remove() 813 lastRet = null; in remove()
|
D | ScheduledThreadPoolExecutor.java | 1297 int lastRet = -1; // index of last element returned; -1 if no such field in ScheduledThreadPoolExecutor.DelayedWorkQueue.Itr 1310 lastRet = cursor; in next() 1315 if (lastRet < 0) in remove() 1317 DelayedWorkQueue.this.remove(array[lastRet]); in remove() 1318 lastRet = -1; in remove()
|
D | ConcurrentLinkedQueue.java | 705 private Node<E> lastRet; field in ConcurrentLinkedQueue.Itr 735 lastRet = pred; in next() 752 Node<E> l = lastRet; in remove() 756 lastRet = null; in remove()
|
D | LinkedBlockingDeque.java | 1036 private Node<E> lastRet; field in LinkedBlockingDeque.AbstractItr 1095 lastRet = next; in next() 1102 Node<E> n = lastRet; in remove() 1105 lastRet = null; in remove()
|
D | ConcurrentLinkedDeque.java | 1374 private Node<E> lastRet; field in ConcurrentLinkedDeque.AbstractItr 1388 lastRet = nextNode; in advance() 1419 Node<E> l = lastRet; in remove() 1423 lastRet = null; in remove()
|
/libcore/ojluni/src/main/java/java/util/ |
D | ArrayList.java | 850 int lastRet = -1; // index of last element returned; -1 if no such field in ArrayList.Itr 868 return (E) elementData[lastRet = i]; in next() 872 if (lastRet < 0) in remove() 878 ArrayList.this.remove(lastRet); in remove() 879 cursor = lastRet; in remove() 880 lastRet = -1; in remove() 906 lastRet = i - 1; in forEachRemaining() 945 return (E) elementData[lastRet = i]; in previous() 949 if (lastRet < 0) in set() 955 ArrayList.this.set(lastRet, e); in set() [all …]
|
D | AbstractList.java | 354 int lastRet = -1; field in AbstractList.Itr 372 lastRet = i; in next() 382 if (lastRet < 0) in remove() 387 AbstractList.this.remove(lastRet); in remove() 388 if (lastRet < cursor) in remove() 390 lastRet = -1; in remove() 417 lastRet = cursor = i; in previous() 434 if (lastRet < 0) in set() 439 AbstractList.this.set(lastRet, e); in set() 452 lastRet = -1; in add()
|
D | ArrayDeque.java | 617 private int lastRet = -1; field in ArrayDeque.DeqIterator 632 lastRet = cursor; in next() 638 if (lastRet < 0) in remove() 640 if (delete(lastRet)) { // if left-shifted, undo increment in next() in remove() 644 lastRet = -1; in remove() 674 private int lastRet = -1; field in ArrayDeque.DescendingIterator 688 lastRet = cursor; in next() 693 if (lastRet < 0) in remove() 695 if (!delete(lastRet)) { in remove() 699 lastRet = -1; in remove()
|
D | Vector.java | 1136 int lastRet = -1; // index of last element returned; -1 if no such field in Itr 1154 return elementData(lastRet = i); in next() 1159 if (lastRet == -1) in remove() 1163 Vector.this.remove(lastRet); in remove() 1168 cursor = lastRet; in remove() 1169 lastRet = -1; in remove() 1193 lastRet = i - 1; in forEachRemaining() 1232 return elementData(lastRet = i); in previous() 1237 if (lastRet == -1) in set() 1241 Vector.this.set(lastRet, e); in set() [all …]
|
D | PriorityQueue.java | 499 private int lastRet = -1; field in PriorityQueue.Itr 537 return (E) queue[lastRet = cursor++]; in next() 539 lastRet = -1; in next() 550 if (lastRet != -1) { in remove() 551 E moved = PriorityQueue.this.removeAt(lastRet); in remove() 552 lastRet = -1; in remove()
|
/libcore/ojluni/annotations/hiddenapi/java/util/ |
D | ArrayDeque.java | 252 private int lastRet = -1; // 0xffffffff field in ArrayDeque.DeqIterator 320 private int lastRet = -1; // 0xffffffff field in ArrayDeque.DescendingIterator
|
D | PriorityQueue.java | 228 private int lastRet = -1; // 0xffffffff field in PriorityQueue.Itr
|
D | Vector.java | 315 int lastRet = -1; // 0xffffffff field in Vector.Itr
|
D | ArrayList.java | 311 int lastRet = -1; // 0xffffffff field in ArrayList.Itr
|
/libcore/ojluni/annotations/hiddenapi/java/util/concurrent/ |
D | LinkedBlockingQueue.java | 242 private java.util.concurrent.LinkedBlockingQueue.Node<E> lastRet; field in LinkedBlockingQueue.Itr
|
D | PriorityBlockingQueue.java | 266 int lastRet; field in PriorityBlockingQueue.Itr
|
D | LinkedBlockingDeque.java | 346 private Node<E> lastRet; field in LinkedBlockingDeque.AbstractItr
|