Lines Matching refs:clusters
56 std::vector<Cluster> clusters; member in __anon96df30a20111::CallGraphSort
78 auto res = secToCluster.try_emplace(isec, clusters.size()); in CallGraphSort()
81 clusters.emplace_back(clusters.size(), isec->getSize()); in CallGraphSort()
104 clusters[to].weight += weight; in CallGraphSort()
110 Cluster &toC = clusters[to]; in CallGraphSort()
116 for (Cluster &c : clusters) in CallGraphSort()
153 std::vector<int> sorted(clusters.size()); in run()
154 std::vector<int> leaders(clusters.size()); in run()
159 return clusters[a].getDensity() > clusters[b].getDensity(); in run()
165 Cluster &c = clusters[l]; in run()
175 Cluster *predC = &clusters[predL]; in run()
183 mergeClusters(clusters, *predC, predL, c, l); in run()
188 for (int i = 0, e = (int)clusters.size(); i != e; ++i) in run()
189 if (clusters[i].size > 0) in run()
192 return clusters[a].getDensity() > clusters[b].getDensity(); in run()
202 i = clusters[i].next; in run()
229 i = clusters[i].next; in run()