| /libcore/ojluni/src/test/java/util/Collections/ |
| D | RacingCollections.java | 38 import java.util.Deque;
129 else if (elLoco instanceof Deque) { in realRun()
130 Deque<Integer> q = (Deque<Integer>) elLoco; in realRun()
290 private static List<Deque<Integer>> newConcurrentDeques() { in newConcurrentDeques()
291 List<Deque<Integer>> list = new ArrayList<>(); in newConcurrentDeques()
297 private static List<Deque<Integer>> newDeques() { in newDeques()
298 List<Deque<Integer>> list = newConcurrentDeques(); in newDeques()
355 for (Deque<Integer> x : newDeques()) in realMain()
356 for (Deque<Integer> y : newConcurrentDeques()) { in realMain()
357 describe(Deque.class, x, y); in realMain()
|
| D | AsLifoQueue.java | 40 Deque<String> deq = new ArrayDeque<String>(); in realMain()
|
| /libcore/ojluni/src/main/java/java/util/ |
| D | ReverseOrderDequeView.java | 37 class ReverseOrderDequeView<E> implements Deque<E> {
38 final Deque<E> base;
40 private ReverseOrderDequeView(Deque<E> deque) { in ReverseOrderDequeView()
44 public static <T> Deque<T> of(Deque<T> deque) { in of()
|
| D | Deque.java | 201 public interface Deque<E> extends Queue<E>, SequencedCollection<E> { interface
631 default Deque<E> reversed() { in reversed()
|
| D | LinkedList.java | 92 implements List<E>, Deque<E>, Cloneable, java.io.Serializable
1286 return new ReverseOrderLinkedListView<>(this, super.reversed(), Deque.super.reversed()); in reversed()
1295 final Deque<E> rdeque;
1297 ReverseOrderLinkedListView(LinkedList<E> list, List<E> rlist, Deque<E> rdeque) { in ReverseOrderLinkedListView()
|
| /libcore/ojluni/src/test/java/util/concurrent/tck/ |
| D | Collection8Test.java | 44 import java.util.Deque;
171 if (c instanceof Deque) {
172 Deque d = (Deque) c;
219 if (!impl.permitsNulls() && c instanceof Deque) {
220 Deque d = (Deque) c;
285 if (c instanceof Deque) {
286 Deque d = (Deque) c;
522 if (c instanceof List || c instanceof Deque)
544 if (c instanceof Deque) {
545 Deque d = (Deque) c;
[all …]
|
| D | ArrayDequeTest.java | 40 import java.util.Deque;
603 Deque<Integer> q = populatedDeque(SIZE); in testRemoveFirstOccurrence()
627 Deque<Integer> q = populatedDeque(SIZE); in testRemoveLastOccurrence()
816 Deque c = new ArrayDeque(); in testEmptyIterator()
985 Deque<?>[] qs = { in testNeverContainsNull()
990 for (Deque<?> q : qs) { in testNeverContainsNull()
|
| D | ConcurrentLinkedDequeTest.java | 39 import java.util.Deque;
747 Deque c = new ConcurrentLinkedDeque(); in testEmptyIterator()
916 Deque<?>[] qs = { in testNeverContainsNull()
921 for (Deque<?> q : qs) { in testNeverContainsNull()
|
| D | LinkedBlockingDequeTest.java | 40 import java.util.Deque;
1583 Deque c = new LinkedBlockingDeque();
1846 Deque<?>[] qs = {
1851 for (Deque<?> q : qs) {
|
| /libcore/ojluni/annotations/flagged_api/java/util/ |
| D | Deque.annotated.java | 40 public interface Deque<E> extends java.util.Queue<E>, java.util.SequencedCollection<E> { interface
100 public default java.util.Deque<E> reversed() { throw new RuntimeException("Stub!"); } in reversed()
|
| D | LinkedList.annotated.java | 30 …va.util.AbstractSequentialList<E> implements java.util.List<E>, java.util.Deque<E>, java.lang.Clon…
|
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | BlockingDeque.java | 38 import java.util.Deque;
198 public interface BlockingDeque<E> extends BlockingQueue<E>, Deque<E> {
|
| /libcore/ojluni/annotations/sdk/nullability/java/util/ |
| D | Deque.annotated.java | 41 public interface Deque<E> extends java.util.Queue<E> { interface
97 @libcore.util.NonNull public default java.util.Deque<E> reversed() { throw new RuntimeException("St… in reversed()
|
| D | ArrayDeque.annotated.java | 40 …l.NonNull E> extends java.util.AbstractCollection<E> implements java.util.Deque<E>, java.lang.Clon…
|
| D | LinkedList.annotated.java | 31 …va.util.AbstractSequentialList<E> implements java.util.List<E>, java.util.Deque<E>, java.lang.Clon…
|
| /libcore/ojluni/src/test/java/util/SequencedCollection/ |
| D | SimpleDeque.java | 33 public class SimpleDeque<E> implements Deque<E> {
35 final Deque<E> deque;
|
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| D | ConcurrentLinkedDequeTest.java | 13 import java.util.Deque;
713 Deque c = new ConcurrentLinkedDeque(); in testEmptyIterator()
882 Deque<?>[] qs = { in testNeverContainsNull()
887 for (Deque<?> q : qs) { in testNeverContainsNull()
|
| D | ArrayDequeTest.java | 12 import java.util.Deque;
759 Deque c = new ArrayDeque(); in testEmptyIterator()
909 Deque<?>[] qs = { in testNeverContainsNull()
914 for (Deque<?> q : qs) { in testNeverContainsNull()
|
| D | LinkedBlockingDequeTest.java | 14 import java.util.Deque;
1549 Deque c = new LinkedBlockingDeque();
1812 Deque<?>[] qs = {
1817 for (Deque<?> q : qs) {
|
| /libcore/ojluni/annotations/hiddenapi/java/util/ |
| D | ArrayDeque.java | 41 implements java.util.Deque<E>, java.lang.Cloneable, java.io.Serializable {
|
| D | LinkedList.java | 33 java.util.Deque<E>,
|
| /libcore/ojluni/src/main/java/java/util/stream/ |
| D | Nodes.java | 30 import java.util.Deque;
957 Deque<N> tryAdvanceStack;
968 protected final Deque<N> initStack() { in initStack()
971 Deque<N> stack = new ArrayDeque<>(8); in initStack()
982 protected final N findNextLeafNode(Deque<N> stack) { in findNextLeafNode()
1102 Deque<Node<T>> stack = initStack(); in forEachRemaining()
1156 Deque<N> stack = initStack(); in forEachRemaining()
|
| /libcore/ojluni/annotations/hiddenapi/java/util/zip/ |
| D | ZipFile.java | 193 private java.util.Deque<java.util.zip.Inflater> inflaterCache;
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| D | Collections2Test.java | 31 import java.util.Deque;
574 Deque<Integer> deque = new ArrayDeque<Integer>(); in test_Queue_forEach()
|
| /libcore/ojluni/src/main/java/java/util/zip/ |
| D | ZipFile.java | 48 import java.util.Deque;
753 Deque<Inflater> inflaterCache;
794 Deque<Inflater> inflaters = this.inflaterCache; in releaseInflater()
813 Deque<Inflater> inflaters = this.inflaterCache; in run()
|