45   Neighbors.reserve(Points_.size() - 1); // The Q itself isn't a neighbor.  in rangeQuery()
46   const auto &QMeasurements = Points_[Q].Measurements;  in rangeQuery()
47   for (size_t P = 0, NumPoints = Points_.size(); P < NumPoints; ++P) {  in rangeQuery()
50     const auto &PMeasurements = Points_[P].Measurements;  in rangeQuery()
67     assert(P < Points_.size());  in areAllNeighbours()
68     ArrayRef<BenchmarkMeasure> Measurements = Points_[P].Measurements;  in areAllNeighbours()
82         assert(P < Points_.size());  in areAllNeighbours()
83         const auto &PMeasurements = Points_[P].Measurements;  in areAllNeighbours()
94     : Points_(Points),  in InstructionBenchmarkClustering()
99   ClusterIdForPoint_.resize(Points_.size());  in validateAndSetup()
103   for (size_t P = 0, NumPoints = Points_.size(); P < NumPoints; ++P) {  in validateAndSetup()
104     const auto &Point = Points_[P];  in validateAndSetup()
133   for (size_t P = 0, NumPoints = Points_.size(); P < NumPoints; ++P) {  in clusterizeDbScan()
181   for (size_t P = 0, NumPoints = Points_.size(); P < NumPoints; ++P) {  in clusterizeDbScan()
197   for (size_t P = 0, NumPoints = Points_.size(); P < NumPoints; ++P) {  in clusterizeNaive()
198     const InstructionBenchmark &Point = Points_[P];  in clusterizeNaive()
212   assert(NumClusters <= Points_.size() &&  in clusterizeNaive()
269   assert(ClusterIdForPoint_.size() == Points_.size() && "size mismatch");  in stabilize()
270   for (auto Point : zip(Points_, ClusterIdForPoint_)) {  in stabilize()
306             return OpcodeAndConfig(Points_[P]) != Key;  in stabilize()