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