Lines Matching refs:pairs
20 // Initializes (ctor) and deletes (dtor) two vectors of pairs of
24 // Attempts to create up to |number_of_pairs| number of pairs. Call size()
25 // after construction to find out how many pairs were actually created.
256 NotificationsOwner pairs(kCount);
260 size_t repeats = pairs.size() * 1;
262 MultiNotifierWorker worker_1(&data[0], repeats, &pairs.a());
263 MultiNotifierWorker worker_2(&data[0], repeats, &pairs.b());
268 for (size_t i = 0; i < pairs.size(); ++i)
269 pairs.a()[i]->Signal();
274 size_t expected_total = pairs.size() * 2;
276 for (size_t i = 0; i < pairs.size(); ++i) {
279 EXPECT_EQ(expected_total / pairs.size(), data[i]);
329 // threads on Windows. This test assumes we can always create 64 pairs and
333 NotificationsOwner pairs(kCount);
334 ASSERT_TRUE(pairs.size() == kCount);
336 CrossProcessNotification::WaitForMultiple waiter(&pairs.b());
338 pairs.a()[i]->Signal();
345 // The test will create at most 1000 pairs, but on mac/linux bots the actual
353 NotificationsOwner pairs(kCount);
355 for (size_t i = 0; i < pairs.size(); ++i) {
356 pairs.a()[i]->Signal();
360 CrossProcessNotification::WaitForMultiple waiter(&pairs.b());
