| /libcore/jsr166-tests/src/test/java/jsr166/ |
| D | ConcurrentLinkedDequeTest.java | 40 ConcurrentLinkedDeque<Integer> q = new ConcurrentLinkedDeque<Integer>(); in populatedDeque() local
97 ConcurrentLinkedDeque q = new ConcurrentLinkedDeque(Arrays.asList(ints)); in testConstructor6() local
106 ConcurrentLinkedDeque q = new ConcurrentLinkedDeque(); in testEmpty() local
120 ConcurrentLinkedDeque q = populatedDeque(SIZE); in testSize() local
135 ConcurrentLinkedDeque q = new ConcurrentLinkedDeque(); in testPushNull() local
146 ConcurrentLinkedDeque q = populatedDeque(3); in testPush() local
156 ConcurrentLinkedDeque q = populatedDeque(SIZE); in testPop() local
170 ConcurrentLinkedDeque q = new ConcurrentLinkedDeque(); in testOfferNull() local
181 ConcurrentLinkedDeque q = new ConcurrentLinkedDeque(); in testOfferFirstNull() local
192 ConcurrentLinkedDeque q = new ConcurrentLinkedDeque(); in testOfferLastNull() local
[all …]
|
| D | ArrayDequeTest.java | 37 ArrayDeque<Integer> q = new ArrayDeque<Integer>(); in populatedDeque() local
93 ArrayDeque q = new ArrayDeque(Arrays.asList(ints)); in testConstructor6() local
102 ArrayDeque q = new ArrayDeque(); in testEmpty() local
116 ArrayDeque q = populatedDeque(SIZE); in testSize() local
131 ArrayDeque q = new ArrayDeque(1); in testPushNull() local
142 ArrayDeque q = populatedDeque(3); in testPush() local
152 ArrayDeque q = populatedDeque(SIZE); in testPop() local
166 ArrayDeque q = new ArrayDeque(); in testOfferNull() local
177 ArrayDeque q = new ArrayDeque(); in testOfferFirstNull() local
188 ArrayDeque q = new ArrayDeque(); in testOfferLastNull() local
[all …]
|
| D | LinkedBlockingDequeTest.java | 58 LinkedBlockingDeque<Integer> q = in populatedDeque() local
73 LinkedBlockingDeque q = new LinkedBlockingDeque(); in testEmpty() local
87 LinkedBlockingDeque q = populatedDeque(SIZE); in testSize() local
102 LinkedBlockingDeque q = new LinkedBlockingDeque(); in testOfferFirstNull() local
113 LinkedBlockingDeque q = new LinkedBlockingDeque(); in testOfferLastNull() local
124 LinkedBlockingDeque q = new LinkedBlockingDeque(); in testOfferFirst() local
133 LinkedBlockingDeque q = new LinkedBlockingDeque(); in testOfferLast() local
142 LinkedBlockingDeque q = populatedDeque(SIZE); in testPollFirst() local
153 LinkedBlockingDeque q = populatedDeque(SIZE); in testPollLast() local
164 LinkedBlockingDeque q = populatedDeque(SIZE); in testPeekFirst() local
[all …]
|
| D | LinkedListTest.java | 36 LinkedList<Integer> q = new LinkedList<Integer>(); in populatedQueue() local
69 LinkedList q = new LinkedList(Arrays.asList(ints)); in testConstructor6() local
78 LinkedList q = new LinkedList(); in testEmpty() local
92 LinkedList q = populatedQueue(SIZE); in testSize() local
107 LinkedList q = new LinkedList(); in testOfferNull() local
117 LinkedList q = new LinkedList(); in testOffer() local
126 LinkedList q = new LinkedList(); in testAdd() local
137 LinkedList q = new LinkedList(); in testAddAll1() local
152 LinkedList q = new LinkedList(); in testAddAll5() local
191 LinkedList q = populatedQueue(SIZE); in testPoll() local
[all …]
|
| D | ConcurrentLinkedQueueTest.java | 38 ConcurrentLinkedQueue<Integer> q = new ConcurrentLinkedQueue<Integer>(); in populatedQueue() local
94 ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(Arrays.asList(ints)); in testConstructor6() local
103 ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(); in testEmpty() local
117 ConcurrentLinkedQueue q = populatedQueue(SIZE); in testSize() local
132 ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(); in testOfferNull() local
143 ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(); in testAddNull() local
154 ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(); in testOffer() local
163 ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(); in testAdd() local
174 ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(); in testAddAll1() local
185 ConcurrentLinkedQueue q = populatedQueue(SIZE); in testAddAllSelf() local
[all …]
|
| D | PriorityQueueTest.java | 44 PriorityQueue<Integer> q = new PriorityQueue<Integer>(n); in populatedQueue() local
112 PriorityQueue q = new PriorityQueue(Arrays.asList(ints)); in testConstructor6() local
122 PriorityQueue q = new PriorityQueue(SIZE, cmp); in testConstructor7() local
136 PriorityQueue q = new PriorityQueue(2); in testEmpty() local
150 PriorityQueue q = populatedQueue(SIZE); in testSize() local
165 PriorityQueue q = new PriorityQueue(1); in testOfferNull() local
176 PriorityQueue q = new PriorityQueue(1); in testAddNull() local
187 PriorityQueue q = new PriorityQueue(1); in testOffer() local
196 PriorityQueue q = new PriorityQueue(1); in testOfferNonComparable() local
208 PriorityQueue q = new PriorityQueue(SIZE); in testAdd() local
[all …]
|
| D | PriorityBlockingQueueTest.java | 69 PriorityBlockingQueue<Integer> q = in populatedQueue() local
142 PriorityBlockingQueue q = new PriorityBlockingQueue(Arrays.asList(ints)); in testConstructor6() local
152 PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE, cmp); in testConstructor7() local
166 PriorityBlockingQueue q = new PriorityBlockingQueue(2); in testEmpty() local
181 BlockingQueue q = populatedQueue(SIZE); in testRemainingCapacity() local
198 PriorityBlockingQueue q = new PriorityBlockingQueue(1); in testOffer() local
207 PriorityBlockingQueue q = new PriorityBlockingQueue(1); in testOfferNonComparable() local
219 PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE); in testAdd() local
230 PriorityBlockingQueue q = populatedQueue(SIZE); in testAddAllSelf() local
242 PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE); in testAddAll3() local
[all …]
|
| D | LinkedBlockingQueueTest.java | 61 LinkedBlockingQueue<Integer> q = in populatedQueue() local
134 LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints)); in testConstructor6() local
143 LinkedBlockingQueue q = new LinkedBlockingQueue(2); in testEmptyFull() local
158 BlockingQueue q = populatedQueue(SIZE); in testRemainingCapacity() local
175 LinkedBlockingQueue q = new LinkedBlockingQueue(1); in testOffer() local
184 LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); in testAdd() local
198 LinkedBlockingQueue q = populatedQueue(SIZE); in testAddAllSelf() local
210 LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); in testAddAll3() local
225 LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE - 1); in testAddAll4() local
244 LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); in testAddAll5() local
[all …]
|
| D | LinkedTransferQueueTest.java | 117 LinkedTransferQueue q in testConstructor5() local
136 BlockingQueue q = populatedQueue(SIZE); in testRemainingCapacity() local
153 LinkedTransferQueue q = populatedQueue(SIZE); in testAddAllSelf() local
165 LinkedTransferQueue q = new LinkedTransferQueue(); in testAddAll3() local
184 LinkedTransferQueue q = new LinkedTransferQueue(); in testAddAll5() local
196 LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>(); in testPut() local
208 LinkedTransferQueue<Integer> q = populatedQueue(SIZE); in testTake() local
218 final BlockingQueue q = populatedQueue(SIZE); in testBlockingTake() local
251 LinkedTransferQueue<Integer> q = populatedQueue(SIZE); in testPoll() local
263 LinkedTransferQueue<Integer> q = populatedQueue(SIZE); in testTimedPoll0() local
[all …]
|
| D | ArrayBlockingQueueTest.java | 61 ArrayBlockingQueue<Integer> q = new ArrayBlockingQueue<Integer>(n); in populatedQueue() local
145 ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, true, elements); in testConstructor7() local
154 ArrayBlockingQueue q = new ArrayBlockingQueue(2); in testEmptyFull() local
169 BlockingQueue q = populatedQueue(SIZE); in testRemainingCapacity() local
186 ArrayBlockingQueue q = new ArrayBlockingQueue(1); in testOffer() local
195 ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); in testAdd() local
210 ArrayBlockingQueue q = populatedQueue(SIZE); in testAddAllSelf() local
222 ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); in testAddAll3() local
236 ArrayBlockingQueue q = new ArrayBlockingQueue(1); in testAddAll4() local
254 ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); in testAddAll5() local
[all …]
|
| D | DelayQueueTest.java | 140 DelayQueue<PDelay> q = new DelayQueue<PDelay>(); in populatedQueue() local
199 DelayQueue q = new DelayQueue(Arrays.asList(ints)); in testConstructor6() local
208 DelayQueue q = new DelayQueue(); in testEmpty() local
223 BlockingQueue q = populatedQueue(SIZE); in testRemainingCapacity() local
240 DelayQueue q = new DelayQueue(); in testOffer() local
249 DelayQueue q = new DelayQueue(); in testAdd() local
260 DelayQueue q = populatedQueue(SIZE); in testAddAllSelf() local
272 DelayQueue q = new DelayQueue(); in testAddAll3() local
290 DelayQueue q = new DelayQueue(); in testAddAll5() local
301 DelayQueue q = new DelayQueue(); in testPut() local
[all …]
|
| D | ConcurrentSkipListSubSetTest.java | 41 ConcurrentSkipListSet<Integer> q = in populatedSet() local
61 ConcurrentSkipListSet q = new ConcurrentSkipListSet(); in set5() local
79 ConcurrentSkipListSet q = new ConcurrentSkipListSet(); in dset5() local
114 NavigableSet q = set0(); in testEmpty() local
128 NavigableSet q = populatedSet(SIZE); in testSize() local
143 NavigableSet q = set0(); in testAddNull() local
154 NavigableSet q = set0(); in testAdd() local
162 NavigableSet q = set0(); in testAddDup() local
171 NavigableSet q = set0(); in testAddNonComparable() local
183 NavigableSet q = set0(); in testAddAll1() local
[all …]
|
| D | TreeSubSetTest.java | 42 TreeSet<Integer> q = new TreeSet<Integer>(); in populatedSet() local
61 TreeSet q = new TreeSet(); in set5() local
76 TreeSet q = new TreeSet(); in dset5() local
111 NavigableSet q = set0(); in testEmpty() local
125 NavigableSet q = populatedSet(SIZE); in testSize() local
140 NavigableSet q = set0(); in testAddNull() local
151 NavigableSet q = set0(); in testAdd() local
159 NavigableSet q = set0(); in testAddDup() local
168 NavigableSet q = set0(); in testAddNonComparable() local
180 NavigableSet q = set0(); in testAddAll1() local
[all …]
|
| D | AbstractQueueTest.java | 56 Succeed q = new Succeed(); in testAddS() local
64 Fail q = new Fail(); in testAddF() local
75 Succeed q = new Succeed(); in testAddNPE() local
86 Succeed q = new Succeed(); in testRemoveS() local
94 Fail q = new Fail(); in testRemoveF() local
105 Succeed q = new Succeed(); in testElementS() local
113 Fail q = new Fail(); in testElementF() local
124 Succeed q = new Succeed(); in testAddAll1() local
135 Succeed q = new Succeed(); in testAddAllSelf() local
146 Succeed q = new Succeed(); in testAddAll2() local
[all …]
|
| D | SynchronousQueueTest.java | 61 final SynchronousQueue q = new SynchronousQueue(fair); in testEmptyFull() local
74 SynchronousQueue q = new SynchronousQueue(fair); in testOffer() local
84 SynchronousQueue q = new SynchronousQueue(fair); in testAdd() local
98 SynchronousQueue q = new SynchronousQueue(fair); in testAddAll_self() local
111 SynchronousQueue q = new SynchronousQueue(fair); in testAddAll_ISE() local
128 final SynchronousQueue q = new SynchronousQueue(fair); in testBlockingPut() local
160 final SynchronousQueue q = new SynchronousQueue(fair); in testPutWithTake() local
194 final SynchronousQueue q = new SynchronousQueue(fair); in testTimedOffer() local
220 final SynchronousQueue q = new SynchronousQueue(fair); in testPoll() local
230 final SynchronousQueue q = new SynchronousQueue(fair); in testTimedPoll0() local
[all …]
|
| D | ConcurrentSkipListSetTest.java | 46 ConcurrentSkipListSet<Integer> q = in populatedSet() local
62 ConcurrentSkipListSet q = new ConcurrentSkipListSet(); in set5() local
120 ConcurrentSkipListSet q = new ConcurrentSkipListSet(Arrays.asList(ints)); in testConstructor6() local
130 ConcurrentSkipListSet q = new ConcurrentSkipListSet(cmp); in testConstructor7() local
144 ConcurrentSkipListSet q = new ConcurrentSkipListSet(); in testEmpty() local
158 ConcurrentSkipListSet q = populatedSet(SIZE); in testSize() local
173 ConcurrentSkipListSet q = new ConcurrentSkipListSet(); in testAddNull() local
184 ConcurrentSkipListSet q = new ConcurrentSkipListSet(); in testAdd() local
193 ConcurrentSkipListSet q = new ConcurrentSkipListSet(); in testAddDup() local
202 ConcurrentSkipListSet q = new ConcurrentSkipListSet(); in testAddNonComparable() local
[all …]
|
| D | TreeSetTest.java | 51 TreeSet<Integer> q = new TreeSet<Integer>(); in populatedSet() local
66 TreeSet q = new TreeSet(); in set5() local
124 TreeSet q = new TreeSet(Arrays.asList(ints)); in testConstructor6() local
134 TreeSet q = new TreeSet(cmp); in testConstructor7() local
148 TreeSet q = new TreeSet(); in testEmpty() local
162 TreeSet q = populatedSet(SIZE); in testSize() local
177 TreeSet q = populatedSet(SIZE); in testAddNull() local
188 TreeSet q = new TreeSet(); in testAdd() local
197 TreeSet q = new TreeSet(); in testAddDup() local
206 TreeSet q = new TreeSet(); in testAddNonComparable() local
[all …]
|
| D | BlockingQueueTest.java | 70 final Queue q = emptyCollection(); in testOfferNull() local
81 final Collection q = emptyCollection(); in testAddNull() local
92 final BlockingQueue q = emptyCollection(); in testTimedOfferNull() local
216 final BlockingQueue q = emptyCollection(); in testTimedPollWithOffer() local
|
| /libcore/ojluni/src/main/java/java/security/spec/ |
| D | DSAParameterSpec.java | 45 BigInteger q; field in DSAParameterSpec
57 public DSAParameterSpec(BigInteger p, BigInteger q, BigInteger g) { in DSAParameterSpec()
|
| D | DSAPrivateKeySpec.java | 49 private BigInteger q; field in DSAPrivateKeySpec
63 public DSAPrivateKeySpec(BigInteger x, BigInteger p, BigInteger q, in DSAPrivateKeySpec()
|
| D | DSAPublicKeySpec.java | 49 private BigInteger q; field in DSAPublicKeySpec
63 public DSAPublicKeySpec(BigInteger y, BigInteger p, BigInteger q, in DSAPublicKeySpec()
|
| /libcore/ojluni/src/main/java/java/lang/ref/ |
| D | PhantomReference.java | 79 public PhantomReference(T referent, ReferenceQueue<? super T> q) { in PhantomReference()
|
| D | WeakReference.java | 68 public WeakReference(T referent, ReferenceQueue<? super T> q) { in WeakReference()
|
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | ConcurrentLinkedDeque.java | 460 Node<E> q = p.prev; in unlink() local
481 Node<E> q = p.next; in unlink() local
602 Node<E> h, p, q; in updateHead() local
632 Node<E> t, p, q; in updateTail() local
665 Node<E> q = p.prev; in skipDeletedPredecessors() local
696 Node<E> q = p.next; in skipDeletedSuccessors() local
722 Node<E> q = p.next; in succ() local
732 Node<E> q = p.prev; in pred() local
1452 final ConcurrentLinkedDeque<E> q = this.queue; in trySplit() local
1485 final ConcurrentLinkedDeque<E> q = this.queue; in forEachRemaining() local
[all …]
|
| /libcore/ojluni/src/main/native/ |
| D | canonicalize_md.c | 113 char *q = ix[i]; in joinNames() local
134 char *p, *q; in collapse() local
|