| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | ArrayBlockingQueue.java | 1038 private int lastRet; field in ArrayBlockingQueue.Itr
1059 lastRet = NONE; in Itr()
1139 if (invalidated(lastRet, prevTakeIndex, dequeues, len)) in incorporateDequeues()
1140 lastRet = REMOVED; in incorporateDequeues()
1146 if (cursor < 0 && nextIndex < 0 && lastRet < 0) in incorporateDequeues()
1199 if (lastRet >= 0) { in noNext()
1200 lastItem = itemAt(lastRet); in noNext()
1223 lastRet = nextIndex; in next()
1232 if (lastRet == REMOVED) detach(); in next()
1263 cursor = nextIndex = lastRet = NONE; in forEachRemaining()
[all …]
|
| D | DelayQueue.java | 511 int lastRet; // index of last element, or -1 if no such field in DelayQueue.Itr
514 lastRet = -1; in Itr()
526 return (E)array[lastRet = cursor++]; in next()
530 if (lastRet < 0) in remove()
532 removeEQ(array[lastRet]); in remove()
533 lastRet = -1; in remove()
|
| D | PriorityBlockingQueue.java | 853 int lastRet = -1; // index of last element, or -1 if no such field in PriorityBlockingQueue.Itr
866 return (E)array[lastRet = cursor++]; in next()
870 if (lastRet < 0) in remove()
872 removeEq(array[lastRet]); in remove()
873 lastRet = -1; in remove()
881 lastRet = -1; in forEachRemaining()
885 lastRet = es.length - 1; in forEachRemaining()
|
| D | LinkedTransferQueue.java | 868 private Node lastRet; // last returned node, to support remove field in LinkedTransferQueue.Itr
913 advance(lastRet = p); in next()
923 lastRet = q; in forEachRemaining()
927 final Node lastRet = this.lastRet; in remove() local
928 if (lastRet == null) in remove()
930 this.lastRet = null; in remove()
931 if (lastRet.item == null) // already deleted? in remove()
937 if (p == lastRet) { in remove()
|
| D | ScheduledThreadPoolExecutor.java | 1332 int lastRet = -1; // index of last element returned; -1 if no such field in ScheduledThreadPoolExecutor.DelayedWorkQueue.Itr
1345 return array[lastRet = cursor++]; in next()
1349 if (lastRet < 0) in remove()
1351 DelayedWorkQueue.this.remove(array[lastRet]); in remove()
1352 lastRet = -1; in remove()
|
| D | LinkedBlockingQueue.java | 772 private Node<E> lastRet; field in LinkedBlockingQueue.Itr
793 lastRet = p; in next()
813 lastRet = p; in forEachRemaining()
834 lastRet = p; in forEachRemaining()
848 Node<E> p = lastRet; in remove()
851 lastRet = null; in remove()
|
| D | LinkedBlockingDeque.java | 1059 private Node<E> lastRet; field in LinkedBlockingDeque.AbstractItr
1090 lastRet = p; in next()
1111 lastRet = p; in forEachRemaining()
1133 lastRet = p; in forEachRemaining()
1147 Node<E> n = lastRet; in remove()
1150 lastRet = null; in remove()
|
| D | ConcurrentLinkedQueue.java | 749 private Node<E> lastRet; field in ConcurrentLinkedQueue.Itr
779 lastRet = pred; in next()
798 Node<E> l = lastRet; in remove()
802 lastRet = null; in remove()
|
| D | ConcurrentLinkedDeque.java | 1377 private Node<E> lastRet; field in ConcurrentLinkedDeque.AbstractItr
1391 lastRet = nextNode; in advance()
1422 Node<E> l = lastRet; in remove()
1426 lastRet = null; in remove()
|
| /libcore/ojluni/src/main/java/java/util/ |
| D | AbstractList.java | 356 int lastRet = -1; field in AbstractList.Itr
374 lastRet = i; in next()
384 if (lastRet < 0) in remove()
389 AbstractList.this.remove(lastRet); in remove()
390 if (lastRet < cursor) in remove()
392 lastRet = -1; in remove()
419 lastRet = cursor = i; in previous()
436 if (lastRet < 0) in set()
441 AbstractList.this.set(lastRet, e); in set()
454 lastRet = -1; in add()
|
| D | ArrayList.java | 1052 int lastRet = -1; // index of last element returned; -1 if no such field in ArrayList.Itr
1072 return (E) elementData[lastRet = i]; in next()
1076 if (lastRet < 0) in remove()
1081 ArrayList.this.remove(lastRet); in remove()
1082 cursor = lastRet; in remove()
1083 lastRet = -1; in remove()
1104 lastRet = i - 1; in forEachRemaining()
1146 return (E) elementData[lastRet = i]; in previous()
1150 if (lastRet < 0) in set()
1155 ArrayList.this.set(lastRet, e); in set()
[all …]
|
| D | Vector.java | 1255 int lastRet = -1; // index of last element returned; -1 if no such field in Itr
1273 return elementData(lastRet = i); in next()
1278 if (lastRet == -1) in remove()
1282 Vector.this.remove(lastRet); in remove()
1287 cursor = lastRet; in remove()
1288 lastRet = -1; in remove()
1309 lastRet = i - 1; in forEachRemaining()
1348 return elementData(lastRet = i); in previous()
1353 if (lastRet == -1) in set()
1357 Vector.this.set(lastRet, e); in set()
[all …]
|
| D | ArrayDeque.java | 695 int lastRet = -1; field in ArrayDeque.DeqIterator
708 cursor = inc(lastRet = cursor, es.length); in next()
719 if (lastRet < 0) in remove()
721 postDelete(delete(lastRet)); in remove()
722 lastRet = -1; in remove()
742 lastRet = dec(end, es.length); in forEachRemaining()
757 cursor = dec(lastRet = cursor, es.length); in next()
784 lastRet = end; in forEachRemaining()
|
| D | PriorityQueue.java | 501 private int lastRet = -1;
540 return (E) queue[lastRet = cursor++];
542 lastRet = -1;
553 if (lastRet != -1) {
554 E moved = PriorityQueue.this.removeAt(lastRet);
555 lastRet = -1;
|
| /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
|