Home
last modified time | relevance | path

Searched defs:q (Results 1 – 25 of 57) sorted by relevance

123

/libcore/jsr166-tests/src/test/java/jsr166/
DConcurrentLinkedDequeTest.java27 ConcurrentLinkedDeque<Integer> q = new ConcurrentLinkedDeque<Integer>(); in populatedDeque() local
49 ConcurrentLinkedDeque q = new ConcurrentLinkedDeque((Collection)null); in testConstructor3() local
60 ConcurrentLinkedDeque q = new ConcurrentLinkedDeque(Arrays.asList(ints)); in testConstructor4() local
73 ConcurrentLinkedDeque q = new ConcurrentLinkedDeque(Arrays.asList(ints)); in testConstructor5() local
85 ConcurrentLinkedDeque q = new ConcurrentLinkedDeque(Arrays.asList(ints)); in testConstructor6() local
94 ConcurrentLinkedDeque q = new ConcurrentLinkedDeque(); in testEmpty() local
108 ConcurrentLinkedDeque q = populatedDeque(SIZE); in testSize() local
124 ConcurrentLinkedDeque q = new ConcurrentLinkedDeque(); in testPushNull() local
134 ConcurrentLinkedDeque q = populatedDeque(3); in testPush() local
144 ConcurrentLinkedDeque q = populatedDeque(SIZE); in testPop() local
[all …]
DArrayDequeTest.java26 ArrayDeque<Integer> q = new ArrayDeque<Integer>(); in populatedDeque() local
47 ArrayDeque q = new ArrayDeque((Collection)null); in testConstructor3() local
58 ArrayDeque q = new ArrayDeque(Arrays.asList(ints)); in testConstructor4() local
71 ArrayDeque q = new ArrayDeque(Arrays.asList(ints)); in testConstructor5() local
83 ArrayDeque q = new ArrayDeque(Arrays.asList(ints)); in testConstructor6() local
92 ArrayDeque q = new ArrayDeque(); in testEmpty() local
106 ArrayDeque q = populatedDeque(SIZE); in testSize() local
122 ArrayDeque q = new ArrayDeque(1); in testPushNull() local
132 ArrayDeque q = populatedDeque(3); in testPush() local
142 ArrayDeque q = populatedDeque(SIZE); in testPop() local
[all …]
DLinkedListTest.java25 LinkedList<Integer> q = new LinkedList<Integer>(); in populatedQueue() local
46 LinkedList q = new LinkedList((Collection)null); in testConstructor3() local
58 LinkedList q = new LinkedList(Arrays.asList(ints)); in testConstructor6() local
67 LinkedList q = new LinkedList(); in testEmpty() local
81 LinkedList q = populatedQueue(SIZE); in testSize() local
96 LinkedList q = new LinkedList(); in testOfferNull() local
104 LinkedList q = new LinkedList(); in testOffer() local
113 LinkedList q = new LinkedList(); in testAdd() local
125 LinkedList q = new LinkedList(); in testAddAll1() local
139 LinkedList q = new LinkedList(); in testAddAll5() local
[all …]
DLinkedBlockingDequeTest.java31 LinkedBlockingDeque<Integer> q = in populatedDeque() local
46 LinkedBlockingDeque q = new LinkedBlockingDeque(); in testEmpty() local
60 LinkedBlockingDeque q = populatedDeque(SIZE); in testSize() local
75 LinkedBlockingDeque q = new LinkedBlockingDeque(); in testOfferFirstNull() local
86 LinkedBlockingDeque q = new LinkedBlockingDeque(); in testOfferLastNull() local
97 LinkedBlockingDeque q = new LinkedBlockingDeque(); in testOfferFirst() local
106 LinkedBlockingDeque q = new LinkedBlockingDeque(); in testOfferLast() local
115 LinkedBlockingDeque q = populatedDeque(SIZE); in testPollFirst() local
126 LinkedBlockingDeque q = populatedDeque(SIZE); in testPollLast() local
137 LinkedBlockingDeque q = populatedDeque(SIZE); in testPeekFirst() local
[all …]
DConcurrentLinkedQueueTest.java26 ConcurrentLinkedQueue<Integer> q = new ConcurrentLinkedQueue<Integer>(); in populatedQueue() local
47 ConcurrentLinkedQueue q = new ConcurrentLinkedQueue((Collection)null); in testConstructor3() local
58 ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(Arrays.asList(ints)); in testConstructor4() local
71 ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(Arrays.asList(ints)); in testConstructor5() local
83 ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(Arrays.asList(ints)); in testConstructor6() local
92 ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(); in testEmpty() local
106 ConcurrentLinkedQueue q = populatedQueue(SIZE); in testSize() local
122 ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(); in testOfferNull() local
133 ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(); in testAddNull() local
143 ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(); in testOffer() local
[all …]
DLinkedTransferQueueTest.java89 LinkedTransferQueue q in testConstructor5() local
108 LinkedTransferQueue<Integer> q = populatedQueue(SIZE); in testRemainingCapacity() local
126 LinkedTransferQueue q = populatedQueue(SIZE); in testAddAllSelf() local
138 LinkedTransferQueue q = new LinkedTransferQueue(); in testAddAll3() local
157 LinkedTransferQueue q = new LinkedTransferQueue(); in testAddAll5() local
169 LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>(); in testPut() local
181 LinkedTransferQueue<Integer> q = populatedQueue(SIZE); in testTake() local
191 final BlockingQueue q = populatedQueue(SIZE); in testBlockingTake() local
224 LinkedTransferQueue<Integer> q = populatedQueue(SIZE); in testPoll() local
236 LinkedTransferQueue<Integer> q = populatedQueue(SIZE); in testTimedPoll0() local
[all …]
DPriorityQueueTest.java33 PriorityQueue<Integer> q = new PriorityQueue<Integer>(n); in populatedQueue() local
56 PriorityQueue q = new PriorityQueue(0); in testConstructor2() local
66 PriorityQueue q = new PriorityQueue((Collection)null); in testConstructor3() local
77 PriorityQueue q = new PriorityQueue(Arrays.asList(ints)); in testConstructor4() local
90 PriorityQueue q = new PriorityQueue(Arrays.asList(ints)); in testConstructor5() local
102 PriorityQueue q = new PriorityQueue(Arrays.asList(ints)); in testConstructor6() local
112 PriorityQueue q = new PriorityQueue(SIZE, cmp); in testConstructor7() local
126 PriorityQueue q = new PriorityQueue(2); in testEmpty() local
140 PriorityQueue q = populatedQueue(SIZE); in testSize() local
156 PriorityQueue q = new PriorityQueue(1); in testOfferNull() local
[all …]
DLinkedBlockingQueueTest.java32 LinkedBlockingQueue<Integer> q = in populatedQueue() local
105 LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints)); in testConstructor6() local
114 LinkedBlockingQueue q = new LinkedBlockingQueue(2); in testEmptyFull() local
129 LinkedBlockingQueue q = populatedQueue(SIZE); in testRemainingCapacity() local
146 LinkedBlockingQueue q = new LinkedBlockingQueue(1); in testOffer() local
155 LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); in testAdd() local
169 LinkedBlockingQueue q = populatedQueue(SIZE); in testAddAllSelf() local
181 LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); in testAddAll3() local
196 LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE - 1); in testAddAll4() local
215 LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); in testAddAll5() local
[all …]
DPriorityBlockingQueueTest.java42 PriorityBlockingQueue<Integer> q = in populatedQueue() local
114 PriorityBlockingQueue q = new PriorityBlockingQueue(Arrays.asList(ints)); in testConstructor6() local
124 PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE, cmp); in testConstructor7() local
138 PriorityBlockingQueue q = new PriorityBlockingQueue(2); in testEmpty() local
154 PriorityBlockingQueue q = populatedQueue(SIZE); in testRemainingCapacity() local
171 PriorityBlockingQueue q = new PriorityBlockingQueue(1); in testOffer() local
181 PriorityBlockingQueue q = new PriorityBlockingQueue(1); in testOfferNonComparable() local
193 PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE); in testAdd() local
205 PriorityBlockingQueue q = populatedQueue(SIZE); in testAddAllSelf() local
217 PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE); in testAddAll3() local
[all …]
DArrayBlockingQueueTest.java32 ArrayBlockingQueue<Integer> q = new ArrayBlockingQueue<Integer>(n); in populatedQueue() local
116 ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, true, elements); in testConstructor7() local
125 ArrayBlockingQueue q = new ArrayBlockingQueue(2); in testEmptyFull() local
140 ArrayBlockingQueue q = populatedQueue(SIZE); in testRemainingCapacity() local
157 ArrayBlockingQueue q = new ArrayBlockingQueue(1); in testOffer() local
167 ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); in testAdd() local
182 ArrayBlockingQueue q = populatedQueue(SIZE); in testAddAllSelf() local
194 ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); in testAddAll3() local
208 ArrayBlockingQueue q = new ArrayBlockingQueue(1); in testAddAll4() local
225 ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); in testAddAll5() local
[all …]
DDelayQueueTest.java116 DelayQueue<PDelay> q = new DelayQueue<PDelay>(); in populatedQueue() local
140 DelayQueue q = new DelayQueue(null); in testConstructor3() local
151 DelayQueue q = new DelayQueue(Arrays.asList(ints)); in testConstructor4() local
164 DelayQueue q = new DelayQueue(Arrays.asList(ints)); in testConstructor5() local
176 DelayQueue q = new DelayQueue(Arrays.asList(ints)); in testConstructor6() local
185 DelayQueue q = new DelayQueue(); in testEmpty() local
201 DelayQueue q = populatedQueue(SIZE); in testRemainingCapacity() local
218 DelayQueue q = new DelayQueue(); in testOffer() local
227 DelayQueue q = new DelayQueue(); in testAdd() local
239 DelayQueue q = populatedQueue(SIZE); in testAddAllSelf() local
[all …]
DConcurrentSkipListSubSetTest.java35 ConcurrentSkipListSet<Integer> q = in populatedSet() local
55 ConcurrentSkipListSet q = new ConcurrentSkipListSet(); in set5() local
73 ConcurrentSkipListSet q = new ConcurrentSkipListSet(); in dset5() local
108 NavigableSet q = set0(); in testEmpty() local
122 NavigableSet q = populatedSet(SIZE); in testSize() local
138 NavigableSet q = set0(); in testAddNull() local
148 NavigableSet q = set0(); in testAdd() local
156 NavigableSet q = set0(); in testAddDup() local
166 NavigableSet q = set0(); in testAddNonComparable() local
179 NavigableSet q = set0(); in testAddAll1() local
[all …]
DTreeSubSetTest.java31 TreeSet<Integer> q = new TreeSet<Integer>(); in populatedSet() local
50 TreeSet q = new TreeSet(); in set5() local
65 TreeSet q = new TreeSet(); in dset5() local
100 NavigableSet q = set0(); in testEmpty() local
114 NavigableSet q = populatedSet(SIZE); in testSize() local
130 NavigableSet q = set0(); in testAddNull() local
140 NavigableSet q = set0(); in testAdd() local
148 NavigableSet q = set0(); in testAddDup() local
158 NavigableSet q = set0(); in testAddNonComparable() local
171 NavigableSet q = set0(); in testAddAll1() local
[all …]
DAbstractQueueTest.java45 Succeed q = new Succeed(); in testAddS() local
53 Fail q = new Fail(); in testAddF() local
64 Succeed q = new Succeed(); in testAddNPE() local
75 Succeed q = new Succeed(); in testRemoveS() local
83 Fail q = new Fail(); in testRemoveF() local
94 Succeed q = new Succeed(); in testElementS() local
102 Fail q = new Fail(); in testElementF() local
114 Succeed q = new Succeed(); in testAddAll1() local
125 Succeed q = new Succeed(); in testAddAllSelf() local
136 Succeed q = new Succeed(); in testAddAll2() local
[all …]
DTreeSetTest.java40 TreeSet<Integer> q = new TreeSet<Integer>(); in populatedSet() local
55 TreeSet q = new TreeSet(); in set5() local
78 TreeSet q = new TreeSet((Collection)null); in testConstructor3() local
89 TreeSet q = new TreeSet(Arrays.asList(ints)); in testConstructor4() local
102 TreeSet q = new TreeSet(Arrays.asList(ints)); in testConstructor5() local
114 TreeSet q = new TreeSet(Arrays.asList(ints)); in testConstructor6() local
124 TreeSet q = new TreeSet(cmp); in testConstructor7() local
138 TreeSet q = new TreeSet(); in testEmpty() local
152 TreeSet q = populatedSet(SIZE); in testSize() local
168 TreeSet q = populatedSet(SIZE); in testAddNull() local
[all …]
DConcurrentSkipListSetTest.java35 ConcurrentSkipListSet<Integer> q = in populatedSet() local
51 ConcurrentSkipListSet q = new ConcurrentSkipListSet(); in set5() local
74 ConcurrentSkipListSet q = new ConcurrentSkipListSet((Collection)null); in testConstructor3() local
85 ConcurrentSkipListSet q = new ConcurrentSkipListSet(Arrays.asList(ints)); in testConstructor4() local
98 ConcurrentSkipListSet q = new ConcurrentSkipListSet(Arrays.asList(ints)); in testConstructor5() local
110 ConcurrentSkipListSet q = new ConcurrentSkipListSet(Arrays.asList(ints)); in testConstructor6() local
120 ConcurrentSkipListSet q = new ConcurrentSkipListSet(cmp); in testConstructor7() local
134 ConcurrentSkipListSet q = new ConcurrentSkipListSet(); in testEmpty() local
148 ConcurrentSkipListSet q = populatedSet(SIZE); in testSize() local
164 ConcurrentSkipListSet q = new ConcurrentSkipListSet(); in testAddNull() local
[all …]
DSynchronousQueueTest.java33 final SynchronousQueue q = new SynchronousQueue(fair); in testEmptyFull() local
46 SynchronousQueue q = new SynchronousQueue(fair); in testOffer() local
56 SynchronousQueue q = new SynchronousQueue(fair); in testAdd() local
70 SynchronousQueue q = new SynchronousQueue(fair); in testAddAll_self() local
83 SynchronousQueue q = new SynchronousQueue(fair); in testAddAll_ISE() local
100 final SynchronousQueue q = new SynchronousQueue(fair); in testBlockingPut() local
132 final SynchronousQueue q = new SynchronousQueue(fair); in testPutWithTake() local
166 final SynchronousQueue q = new SynchronousQueue(fair); in testTimedOffer() local
192 final SynchronousQueue q = new SynchronousQueue(fair); in testPoll() local
202 final SynchronousQueue q = new SynchronousQueue(fair); in testTimedPoll0() local
[all …]
DBlockingQueueTest.java58 final Queue q = emptyCollection(); in testOfferNull() local
69 final Collection q = emptyCollection(); in testAddNull() local
80 final BlockingQueue q = emptyCollection(); in testTimedOfferNull() local
204 final BlockingQueue q = emptyCollection(); in testTimedPollWithOffer() local
/libcore/support/src/test/java/tests/resources/Package/
Dhyts_pq.jar ... /MANIFEST.MF META-INF/ p/q/ p/q/C.class C. ...
/libcore/luni/src/main/java/java/security/spec/
DDSAParameterSpec.java30 private final BigInteger q; field in DSAParameterSpec
45 public DSAParameterSpec(BigInteger p, BigInteger q, BigInteger g) { in DSAParameterSpec()
DDSAPrivateKeySpec.java31 private final BigInteger q; field in DSAPrivateKeySpec
49 BigInteger q, BigInteger g) { in DSAPrivateKeySpec()
DDSAPublicKeySpec.java31 private final BigInteger q; field in DSAPublicKeySpec
49 BigInteger q, BigInteger g) { in DSAPublicKeySpec()
/libcore/luni/src/main/java/java/lang/ref/
DPhantomReference.java59 public PhantomReference(T r, ReferenceQueue<? super T> q) { in PhantomReference()
DSoftReference.java99 public SoftReference(T r, ReferenceQueue<? super T> q) { in SoftReference()
DWeakReference.java107 public WeakReference(T r, ReferenceQueue<? super T> q) { in WeakReference()

123