@@ -69,8 +69,7 @@ std::pair<std::vector<std::pair<int, int>>, size_t> cacheAwareSearch(const TileC
6969 std::vector<std::pair<int , int >> result;
7070 result.reserve (uncovered_tiles.size ());
7171 for (size_t idx : uncovered_tiles)
72- result.push_back ({static_cast <int >(idx % params.num_tiles_x ),
73- static_cast <int >(idx / params.num_tiles_x )});
72+ result.push_back ({static_cast <int >(idx % params.num_tiles_x ), static_cast <int >(idx / params.num_tiles_x )});
7473 return {std::move (result), 0 };
7574 }
7675
@@ -192,11 +191,11 @@ std::pair<std::vector<std::pair<int, int>>, size_t> cacheAwareSearch(const TileC
192191 std::vector<std::pair<int , int >> result;
193192 result.reserve (total);
194193 for (size_t tile_idx : best_order)
195- result.push_back ({ static_cast < int >(tile_idx % params. num_tiles_x ),
196- static_cast <int >(tile_idx / params.num_tiles_x )});
194+ result.push_back (
195+ { static_cast < int >(tile_idx % params. num_tiles_x ), static_cast <int >(tile_idx / params.num_tiles_x )});
197196 for (size_t tile_idx : uncovered_tiles)
198- result.push_back ({ static_cast < int >(tile_idx % params. num_tiles_x ),
199- static_cast <int >(tile_idx / params.num_tiles_x )});
197+ result.push_back (
198+ { static_cast < int >(tile_idx % params. num_tiles_x ), static_cast <int >(tile_idx / params.num_tiles_x )});
200199
201200 return {std::move (result), best_misses};
202201}
0 commit comments