Lines Matching refs:clusters
84 std::vector<Cluster> clusters; member in __anon1267b3fb0111::CallGraphSort
107 auto res = secToCluster.try_emplace(isec, clusters.size()); in CallGraphSort()
110 clusters.emplace_back(clusters.size(), isec->getSize()); in CallGraphSort()
133 clusters[to].weight += weight; in CallGraphSort()
139 Cluster &toC = clusters[to]; in CallGraphSort()
145 for (Cluster &c : clusters) in CallGraphSort()
182 std::vector<int> sorted(clusters.size()); in run()
183 std::vector<int> leaders(clusters.size()); in run()
188 return clusters[a].getDensity() > clusters[b].getDensity(); in run()
194 Cluster &c = clusters[l]; in run()
204 Cluster *predC = &clusters[predL]; in run()
212 mergeClusters(clusters, *predC, predL, c, l); in run()
217 for (int i = 0, e = (int)clusters.size(); i != e; ++i) in run()
218 if (clusters[i].size > 0) in run()
221 return clusters[a].getDensity() > clusters[b].getDensity(); in run()
229 i = clusters[i].next; in run()
253 i = clusters[i].next; in run()