Lines Matching full:auto

94   auto NodesRange = llvm::make_range(Nodes.begin(), Nodes.end());
95   auto BisectTask = [=, &TP]() {
105   llvm::stable_sort(NodesRange, [](const auto &L, const auto &R) {
120     llvm::sort(Nodes, [](const auto &L, const auto &R) {
123     for (auto &N : Nodes)
142   auto NodesMid =
143       llvm::partition(Nodes, [&](auto &N) { return N.Bucket == LeftBucket; });
146   auto LeftNodes = llvm::make_range(Nodes.begin(), NodesMid);
147   auto RightNodes = llvm::make_range(NodesMid, Nodes.end());
149   auto LeftRecTask = [=, &TP]() {
152   auto RightRecTask = [=, &TP]() {
171   for (auto &N : Nodes)
172     for (auto &UN : N.UtilityNodes)
176   for (auto &N : Nodes)
177     llvm::erase_if(N.UtilityNodes, [&](auto &UN) {
183   for (auto &N : Nodes)
184     for (auto &UN : N.UtilityNodes)
189   for (auto &N : Nodes) {
190     for (auto &UN : N.UtilityNodes) {
214   for (auto &Signature : Signatures) {
233   for (auto &N : Nodes) {
240   auto LeftEnd = llvm::partition(
241       Gains, [&](const auto &GP) { return GP.second->Bucket == LeftBucket; });
242   auto LeftRange = llvm::make_range(Gains.begin(), LeftEnd);
243   auto RightRange = llvm::make_range(LeftEnd, Gains.end());
246   auto LargerGain = [](const auto &L, const auto &R) {
253   for (auto [LeftPair, RightPair] : llvm::zip(LeftRange, RightRange)) {
254     auto &[LeftGain, LeftNode] = LeftPair;
255     auto &[RightGain, RightNode] = RightPair;
284     for (auto &UN : N.UtilityNodes) {
285       auto &Signature = Signatures[UN];
291     for (auto &UN : N.UtilityNodes) {
292       auto &Signature = Signatures[UN];
304   auto NodesMid = Nodes.begin() + (NumNodes + 1) / 2;
306   std::nth_element(Nodes.begin(), NodesMid, Nodes.end(), [](auto &L, auto &R) {
310   for (auto &N : llvm::make_range(Nodes.begin(), NodesMid))
312   for (auto &N : llvm::make_range(NodesMid, Nodes.end()))
320   for (auto &UN : N.UtilityNodes)