156   std::vector<int> sorted(clusters.size());  in run()  local
160   std::iota(sorted.begin(), sorted.end(), 0);  in run()
161   llvm::stable_sort(sorted, [&](int a, int b) {  in run()
165   for (int l : sorted) {  in run()
190   sorted.clear();  in run()
193       sorted.push_back(i);  in run()
194   llvm::stable_sort(sorted, [&](int a, int b) {  in run()
199   // Sections will be sorted by increasing order. Absent sections will have  in run()
202   for (int leader : sorted) {  in run()
219     for (int leader : sorted)  in run()
244 // according to the C³ heuristic. All clusters are then sorted by a density