96   std::vector<Cluster> clusters;  member in __anon8806e05c0111::CallGraphSort
119     auto res = secToCluster.try_emplace(isec, clusters.size());  in CallGraphSort()
122       clusters.emplace_back(clusters.size(), isec->getSize());  in CallGraphSort()
145     clusters[to].weight += weight;  in CallGraphSort()
151     Cluster &toC = clusters[to];  in CallGraphSort()
157   for (Cluster &c : clusters)  in CallGraphSort()
194   std::vector<int> sorted(clusters.size());  in run()
195   std::unique_ptr<int[]> leaders(new int[clusters.size()]);  in run()
197   std::iota(leaders.get(), leaders.get() + clusters.size(), 0);  in run()
200     return clusters[a].getDensity() > clusters[b].getDensity();  in run()
206     Cluster &c = clusters[l];  in run()
216     Cluster *predC = &clusters[predL];  in run()
224     mergeClusters(clusters, *predC, predL, c, l);  in run()
229   for (int i = 0, e = (int)clusters.size(); i != e; ++i)  in run()
230     if (clusters[i].size > 0)  in run()
233     return clusters[a].getDensity() > clusters[b].getDensity();  in run()
241       i = clusters[i].next;  in run()
265         i = clusters[i].next;  in run()