Searched refs:collectionInfo (Results 1 – 4 of 4) sorted by relevance
224 const CollectionInfo& collectionInfo = collectorPeer.getBoottimeCollectionInfo(); in TEST() local226 ASSERT_EQ(collectionInfo.maxCacheSize, std::numeric_limits<std::size_t>::max()); in TEST()227 ASSERT_EQ(collectionInfo.records.size(), 1); in TEST()228 ASSERT_TRUE(isEqual(collectionInfo.records[0], expected)) in TEST()231 << toString(collectionInfo.records[0]); in TEST()293 const CollectionInfo& collectionInfo = collectorPeer.getPeriodicCollectionInfo(); in TEST() local295 ASSERT_EQ(collectionInfo.maxCacheSize, in TEST()298 ASSERT_EQ(collectionInfo.records.size(), 1); in TEST()299 ASSERT_TRUE(isEqual(collectionInfo.records[0], expected)) in TEST()302 << toString(collectionInfo.records[0]); in TEST()[all …]
255 std::string toString(const CollectionInfo& collectionInfo) { in toString() argument256 if (collectionInfo.records.empty()) { in toString()261 difftime(collectionInfo.records.back().time, collectionInfo.records.front().time); in toString()263 duration, collectionInfo.records.size()); in toString()265 for (size_t i = 0; i < collectionInfo.records.size(); ++i) { in toString()266 const auto& record = collectionInfo.records[i]; in toString()397 CollectionInfo* collectionInfo) { in processLocked() argument398 if (collectionInfo->maxCacheSize == 0) { in processLocked()407 if (collectionInfo->records.size() > collectionInfo->maxCacheSize) { in processLocked()408 collectionInfo->records.erase(collectionInfo->records.begin()); // Erase the oldest record. in processLocked()[all …]
109 std::string toString(const CollectionInfo& collectionInfo);176 CollectionInfo* collectionInfo);
3363 collectionInfo = AccessibilityNodeInfo.CollectionInfo.obtain( in onInitializeAccessibilityNodeInfo() local3366 info.setCollectionInfo(collectionInfo); in onInitializeAccessibilityNodeInfo()