537   Sum.NumEntries += Counts.size();  in accumulateCounts()
538   for (uint64_t Count : Counts)  in accumulateCounts()
610   bool Mismatch = (Counts.size() != Other.Counts.size());  in overlap()
635   for (size_t I = 0, E = Other.Counts.size(); I < E; ++I) {  in overlap()
636     Score += OverlapStats::score(Counts[I], Other.Counts[I],  in overlap()
638     MaxCount = std::max(Other.Counts[I], MaxCount);  in overlap()
645     for (size_t I = 0, E = Other.Counts.size(); I < E; ++I)  in overlap()
646       FuncScore += OverlapStats::score(Counts[I], Other.Counts[I],  in overlap()
650     FuncLevelOverlap.Overlap.NumEntries = Other.Counts.size();  in overlap()
712   if (Counts.size() != Other.Counts.size()) {  in merge()
717   for (size_t I = 0, E = Other.Counts.size(); I < E; ++I) {  in merge()
719     Counts[I] =  in merge()
720         SaturatingMultiplyAdd(Other.Counts[I], Weight, Counts[I], &Overflowed);  in merge()
739   for (auto &Count : this->Counts) {  in scale()