506   Sum.NumEntries += Counts.size();  in accumulateCounts()
507   for (size_t F = 0, E = Counts.size(); F < E; ++F)  in accumulateCounts()
508     FuncSum += Counts[F];  in accumulateCounts()
579   bool Mismatch = (Counts.size() != Other.Counts.size());  in overlap()
604   for (size_t I = 0, E = Other.Counts.size(); I < E; ++I) {  in overlap()
605     Score += OverlapStats::score(Counts[I], Other.Counts[I],  in overlap()
607     MaxCount = std::max(Other.Counts[I], MaxCount);  in overlap()
614     for (size_t I = 0, E = Other.Counts.size(); I < E; ++I)  in overlap()
615       FuncScore += OverlapStats::score(Counts[I], Other.Counts[I],  in overlap()
619     FuncLevelOverlap.Overlap.NumEntries = Other.Counts.size();  in overlap()
682   if (Counts.size() != Other.Counts.size()) {  in merge()
687   for (size_t I = 0, E = Other.Counts.size(); I < E; ++I) {  in merge()
689     Counts[I] =  in merge()
690         SaturatingMultiplyAdd(Other.Counts[I], Weight, Counts[I], &Overflowed);  in merge()
709   for (auto &Count : this->Counts) {  in scale()