43   Neighbors.reserve(Points_.size() - 1); // The Q itself isn't a neighbor.  in rangeQuery()
44   const auto &QMeasurements = Points_[Q].Measurements;  in rangeQuery()
45   for (size_t P = 0, NumPoints = Points_.size(); P < NumPoints; ++P) {  in rangeQuery()
48     const auto &PMeasurements = Points_[P].Measurements;  in rangeQuery()
65     assert(P < Points_.size());  in areAllNeighbours()
66     ArrayRef<BenchmarkMeasure> Measurements = Points_[P].Measurements;  in areAllNeighbours()
80         assert(P < Points_.size());  in areAllNeighbours()
81         const auto &PMeasurements = Points_[P].Measurements;  in areAllNeighbours()
92     : Points_(Points),  in InstructionBenchmarkClustering()
97   ClusterIdForPoint_.resize(Points_.size());  in validateAndSetup()
101   for (size_t P = 0, NumPoints = Points_.size(); P < NumPoints; ++P) {  in validateAndSetup()
102     const auto &Point = Points_[P];  in validateAndSetup()
131   for (size_t P = 0, NumPoints = Points_.size(); P < NumPoints; ++P) {  in clusterizeDbScan()
179   for (size_t P = 0, NumPoints = Points_.size(); P < NumPoints; ++P) {  in clusterizeDbScan()
191   for (size_t P = 0, NumPoints = Points_.size(); P < NumPoints; ++P) {  in clusterizeNaive()
192     const InstructionBenchmark &Point = Points_[P];  in clusterizeNaive()
203   assert(NumOpcodesSeen <= Points_.size() &&  in clusterizeNaive()
255   assert(ClusterIdForPoint_.size() == Points_.size() && "size mismatch");  in stabilize()
256   for (auto Point : zip(Points_, ClusterIdForPoint_)) {  in stabilize()
292             return OpcodeAndConfig(Points_[P]) != Key;  in stabilize()