Home
last modified time | relevance | path

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

12345678910>>...186

/aosp_15_r20/external/sdv/vsomeip/third_party/boost/thread/test/sync/mutual_exclusion/sync_bounded_queue/
Dsingle_thread_pass.cpp44 boost::sync_bounded_queue<int> q(2); in main() local
54 boost::sync_bounded_queue<int> q(2); in main() local
64 boost::sync_bounded_queue<int> q(2); in main() local
73 boost::sync_bounded_queue<int> q(2); in main() local
82 boost::sync_bounded_queue<non_copyable> q(2); in main() local
92 boost::sync_bounded_queue<int> q(3); in main() local
105 boost::sync_bounded_queue<int> q(2); in main() local
115 boost::sync_bounded_queue<int> q(2); in main() local
124 boost::sync_bounded_queue<non_copyable> q(2); in main() local
134 boost::sync_bounded_queue<int> q(2); in main() local
[all …]
/aosp_15_r20/libcore/jsr166-tests/src/test/java/jsr166/
H A DLinkedBlockingDequeTest.java58 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 …]
H A DConcurrentLinkedDequeTest.java40 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 …]
H A DArrayDequeTest.java37 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 …]
H A DLinkedListTest.java36 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 …]
H A DConcurrentSkipListSubSetTest.java41 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 …]
H A DLinkedTransferQueueTest.java117 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 …]
H A DTreeSubSetTest.java42 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 …]
H A DLinkedBlockingQueueTest.java61 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 …]
H A DArrayBlockingQueueTest.java61 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 …]
H A DPriorityBlockingQueueTest.java69 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 …]
/aosp_15_r20/libcore/ojluni/src/test/java/util/concurrent/tck/
H A DLinkedBlockingDequeTest.java109 LinkedBlockingDeque<Integer> q = in populatedDeque() local
127 LinkedBlockingDeque q = new LinkedBlockingDeque(); in testEmpty() local
142 LinkedBlockingDeque q = populatedDeque(SIZE); in testSize() local
158 LinkedBlockingDeque q = new LinkedBlockingDeque(); in testOfferFirstNull() local
170 LinkedBlockingDeque q = new LinkedBlockingDeque(); in testOfferLastNull() local
182 LinkedBlockingDeque q = new LinkedBlockingDeque(); in testOfferFirst() local
192 LinkedBlockingDeque q = new LinkedBlockingDeque(); in testOfferLast() local
202 LinkedBlockingDeque q = populatedDeque(SIZE); in testPollFirst() local
214 LinkedBlockingDeque q = populatedDeque(SIZE); in testPollLast() local
226 LinkedBlockingDeque q = populatedDeque(SIZE); in testPeekFirst() local
[all …]
H A DConcurrentLinkedDequeTest.java85 ConcurrentLinkedDeque<Integer> q = new ConcurrentLinkedDeque<>(); in populatedDeque() local
149 ConcurrentLinkedDeque q = new ConcurrentLinkedDeque(Arrays.asList(ints)); in testConstructor6() local
159 ConcurrentLinkedDeque q = new ConcurrentLinkedDeque(); in testEmpty() local
174 ConcurrentLinkedDeque q = populatedDeque(SIZE); in testSize() local
190 ConcurrentLinkedDeque q = new ConcurrentLinkedDeque(); in testPushNull() local
202 ConcurrentLinkedDeque q = populatedDeque(3); in testPush() local
213 ConcurrentLinkedDeque q = populatedDeque(SIZE); in testPop() local
228 ConcurrentLinkedDeque q = new ConcurrentLinkedDeque(); in testOfferNull() local
240 ConcurrentLinkedDeque q = new ConcurrentLinkedDeque(); in testOfferFirstNull() local
252 ConcurrentLinkedDeque q = new ConcurrentLinkedDeque(); in testOfferLastNull() local
[all …]
H A DArrayDequeTest.java88 final ArrayDeque<Integer> q; in populatedDeque() local
179 ArrayDeque q = new ArrayDeque(Arrays.asList(ints)); in testConstructor6() local
189 ArrayDeque q = new ArrayDeque(); in testEmpty() local
204 ArrayDeque q = populatedDeque(SIZE); in testSize() local
220 ArrayDeque q = new ArrayDeque(1); in testPushNull() local
232 ArrayDeque q = populatedDeque(3); in testPush() local
243 ArrayDeque q = populatedDeque(SIZE); in testPop() local
258 ArrayDeque q = new ArrayDeque(); in testOfferNull() local
270 ArrayDeque q = new ArrayDeque(); in testOfferFirstNull() local
282 ArrayDeque q = new ArrayDeque(); in testOfferLastNull() local
[all …]
H A DLinkedListTest.java89 LinkedList<Integer> q = new LinkedList<>(); in populatedQueue() local
127 LinkedList q = new LinkedList(Arrays.asList(ints)); in testConstructor6() local
137 LinkedList q = new LinkedList(); in testEmpty() local
152 LinkedList q = populatedQueue(SIZE); in testSize() local
168 LinkedList q = new LinkedList(); in testOfferNull() local
179 LinkedList q = new LinkedList(); in testOffer() local
189 LinkedList q = new LinkedList(); in testAdd() local
201 LinkedList q = new LinkedList(); in testAddAll1() local
217 LinkedList q = new LinkedList(); in testAddAll5() local
259 LinkedList q = populatedQueue(SIZE); in testPoll() local
[all …]
H A DConcurrentSkipListSubSetTest.java78 ConcurrentSkipListSet<Integer> q = in populatedSet() local
98 ConcurrentSkipListSet q = new ConcurrentSkipListSet(); in set5() local
116 ConcurrentSkipListSet q = new ConcurrentSkipListSet(); in dset5() local
153 NavigableSet q = set0(); in testEmpty() local
168 NavigableSet q = populatedSet(SIZE); in testSize() local
184 NavigableSet q = set0(); in testAddNull() local
196 NavigableSet q = set0(); in testAdd() local
205 NavigableSet q = set0(); in testAddDup() local
215 NavigableSet q = set0(); in testAddNonComparable() local
228 NavigableSet q = set0(); in testAddAll1() local
[all …]
H A DLinkedTransferQueueTest.java156 LinkedTransferQueue q in testConstructor5() local
176 BlockingQueue q = populatedQueue(SIZE); in testRemainingCapacity() local
194 LinkedTransferQueue q = populatedQueue(SIZE); in testAddAllSelf() local
207 LinkedTransferQueue q = new LinkedTransferQueue(); in testAddAll3() local
227 LinkedTransferQueue q = new LinkedTransferQueue(); in testAddAll5() local
240 LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); in testPut() local
253 LinkedTransferQueue<Integer> q = populatedQueue(SIZE); in testTake() local
264 final BlockingQueue q = populatedQueue(SIZE); in testBlockingTake() local
298 LinkedTransferQueue<Integer> q = populatedQueue(SIZE); in testPoll() local
311 LinkedTransferQueue<Integer> q = populatedQueue(SIZE); in testTimedPoll0() local
[all …]
H A DTreeSubSetTest.java79 TreeSet<Integer> q = new TreeSet<>(); in populatedSet() local
98 TreeSet q = new TreeSet(); in set5() local
113 TreeSet q = new TreeSet(); in dset5() local
150 NavigableSet q = set0(); in testEmpty() local
165 NavigableSet q = populatedSet(SIZE); in testSize() local
181 NavigableSet q = set0(); in testAddNull() local
193 NavigableSet q = set0(); in testAdd() local
202 NavigableSet q = set0(); in testAddDup() local
212 NavigableSet q = set0(); in testAddNonComparable() local
225 NavigableSet q = set0(); in testAddAll1() local
[all …]
H A DLinkedBlockingQueueTest.java109 LinkedBlockingQueue<Integer> q = in populatedQueue() local
189 LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints)); in testConstructor6() local
199 LinkedBlockingQueue q = new LinkedBlockingQueue(2); in testEmptyFull() local
215 BlockingQueue q = populatedQueue(SIZE); in testRemainingCapacity() local
233 LinkedBlockingQueue q = new LinkedBlockingQueue(1); in testOffer() local
243 LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); in testAdd() local
258 LinkedBlockingQueue q = populatedQueue(SIZE); in testAddAllSelf() local
271 LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); in testAddAll3() local
287 LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE - 1); in testAddAll4() local
307 LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); in testAddAll5() local
[all …]
H A DDelayQueueTest.java162 DelayQueue<PDelay> q = new DelayQueue<>(); in populatedQueue() local
227 DelayQueue q = new DelayQueue(Arrays.asList(ints)); in testConstructor6() local
237 DelayQueue q = new DelayQueue(); in testEmpty() local
253 BlockingQueue q = populatedQueue(SIZE); in testRemainingCapacity() local
271 DelayQueue q = new DelayQueue(); in testOffer() local
281 DelayQueue q = new DelayQueue(); in testAdd() local
293 DelayQueue q = populatedQueue(SIZE); in testAddAllSelf() local
306 DelayQueue q = new DelayQueue(); in testAddAll3() local
325 DelayQueue q = new DelayQueue(); in testAddAll5() local
337 DelayQueue q = new DelayQueue(); in testPut() local
[all …]
H A DPriorityBlockingQueueTest.java117 PriorityBlockingQueue<Integer> q = in populatedQueue() local
197 PriorityBlockingQueue q = new PriorityBlockingQueue(Arrays.asList(ints)); in testConstructor6() local
208 PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE, cmp); in testConstructor7() local
223 PriorityBlockingQueue q = new PriorityBlockingQueue(2); in testEmpty() local
239 BlockingQueue q = populatedQueue(SIZE); in testRemainingCapacity() local
257 PriorityBlockingQueue q = new PriorityBlockingQueue(1); in testOffer() local
267 PriorityBlockingQueue q = new PriorityBlockingQueue(1); in testOfferNonComparable() local
283 PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE); in testAdd() local
295 PriorityBlockingQueue q = populatedQueue(SIZE); in testAddAllSelf() local
308 PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE); in testAddAll3() local
[all …]
H A DArrayBlockingQueueTest.java127 ArrayBlockingQueue<Integer> q = new ArrayBlockingQueue<>(capacity); in populatedQueue() local
234 ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, true, elements); in testConstructor7() local
244 BlockingQueue q = populatedQueue(0, 2, 2, false); in testEmptyFull() local
261 BlockingQueue q = populatedQueue(size, size, 2 * size, false); in testRemainingCapacity() local
281 ArrayBlockingQueue q = new ArrayBlockingQueue(1); in testOffer() local
291 ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); in testAdd() local
305 ArrayBlockingQueue q = populatedQueue(SIZE); in testAddAllSelf() local
318 ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); in testAddAll3() local
334 ArrayBlockingQueue q = populatedQueue(0, size, size, false); in testAddAll_insufficientSpace() local
356 ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); in testAddAll5() local
[all …]
/aosp_15_r20/external/pytorch/torch/distributions/
H A Dkl.py203 def _kl_bernoulli_bernoulli(p, q): argument
219 def _kl_beta_beta(p, q): argument
231 def _kl_binomial_binomial(p, q): argument
247 def _kl_categorical_categorical(p, q): argument
255 def _kl_continuous_bernoulli_continuous_bernoulli(p, q): argument
263 def _kl_dirichlet_dirichlet(p, q): argument
275 def _kl_exponential_exponential(p, q): argument
282 def _kl_expfamily_expfamily(p, q): argument
300 def _kl_gamma_gamma(p, q): argument
309 def _kl_gumbel_gumbel(p, q): argument
[all …]
/aosp_15_r20/external/sdv/vsomeip/third_party/boost/thread/test/sync/mutual_exclusion/sync_deque/
Dsingle_thread_pass.cpp43 boost::sync_deque<int> q; in main() local
51 boost::sync_deque<int> q; in main() local
61 boost::sync_deque<int> q; in main() local
70 boost::sync_deque<int> q; in main() local
82 boost::sync_deque<non_copyable> q; in main() local
92 boost::sync_deque<non_copyable> q; in main() local
103 boost::sync_deque<int> q; in main() local
113 boost::sync_deque<int> q; in main() local
123 boost::sync_deque<int> q; in main() local
132 boost::sync_deque<int> q; in main() local
[all …]
/aosp_15_r20/external/sdv/vsomeip/third_party/boost/thread/test/sync/mutual_exclusion/sync_queue/
Dsingle_thread_pass.cpp43 boost::sync_queue<int> q; in main() local
53 boost::sync_queue<non_copyable> q; in main() local
63 boost::sync_queue<non_copyable> q; in main() local
74 boost::sync_queue<int> q; in main() local
84 boost::sync_queue<int> q; in main() local
94 boost::sync_queue<int> q; in main() local
103 boost::sync_queue<int> q; in main() local
114 boost::sync_queue<non_copyable> q; in main() local
124 boost::sync_queue<non_copyable> q; in main() local
135 boost::sync_queue<int> q; in main() local
[all …]

12345678910>>...186