50     ASSERT_FALSE(concurrentTimes->active.empty());  in TEST()
55     ASSERT_EQ(concurrentTimes->active.size(), policyEntries);  in TEST()
68         ASSERT_LE(concurrentTime.active[i], policySum);  in TestConcurrentTimesConsistent()
69         policySum -= concurrentTime.active[i];  in TestConcurrentTimesConsistent()
72     for (size_t i = 0; i < concurrentTime.active.size(); ++i) {  in TestConcurrentTimesConsistent()
76         auto activeSum = concurrentTime.active[concurrentTime.active.size() - 1 - i];  in TestConcurrentTimesConsistent()
102     uint64_t activeSum = std::accumulate(concurrentTime.active.begin(), concurrentTime.active.end(),  in TestUidTimesConsistent()
220             ASSERT_EQ(kv.second.active.size(), firstEntry.active.size());  in TEST()
259         ASSERT_NO_FATAL_FAILURE(TestCheckUpdate({(*map1)[uid].active},{newTimes.active}));  in TEST()
274             for (uint32_t i = 0; i < times1.active.size(); ++i) {  in TEST()
275                 ASSERT_LE(times2->active[i] - times1.active[i], NSEC_PER_SEC);  in TEST()
327         for (uint32_t i = 0; i < times.active.size(); ++i) {  in TEST()
328             auto before = times.active[i];  in TEST()
329             auto after = (*map2)[uid].active[i];  in TEST()
372             for (const auto &time : kv.second.active) {  in TEST()
446     ASSERT_FALSE(concurrentTimes->active.empty());  in TEST()
456     for (size_t i = 0; i < concurrentTimes->active.size(); ++i) {  in TEST()
457         activeSum += concurrentTimes->active[i];  in TEST()