clang-tidy

source/core/rendering/pixel_reveal.cpp

@@ -1,6 +1,6 @@
 #include "core/rendering/pixel_reveal.hpp"
 
-#include <algorithm>  // Para min
+#include <algorithm>  // Para min, ranges::all_of
 #include <numeric>    // Para iota
 #include <queue>      // Para queue (BFS en modo ORDERED)
 #include <random>     // Para mt19937, shuffle
@@ -30,7 +30,7 @@ PixelReveal::PixelReveal(int width, int height, float pixels_per_second, float s
         std::vector<int> offsets;
         offsets.push_back(0);
         std::queue<std::pair<int, int>> bq;
-        bq.push({0, num_steps_});
+        bq.emplace(0, num_steps_);
         while (static_cast<int>(offsets.size()) < num_steps_) {
             auto [lo, hi] = bq.front();
             bq.pop();
@@ -39,14 +39,14 @@ PixelReveal::PixelReveal(int width, int height, float pixels_per_second, float s
             }
             const int MID = (lo + hi) / 2;
             offsets.push_back(MID);
-            bq.push({lo, MID});
-            bq.push({MID, hi});
+            bq.emplace(lo, MID);
+            bq.emplace(MID, hi);
         }
         // Genera el orden: para cada offset, todas las columnas col = offset, offset+N, offset+2N, ...
         std::vector<int> ordered_cols;
         ordered_cols.reserve(width_);
-        for (const int off : offsets) {
-            for (int col = off; col < width_; col += num_steps_) {
+        for (const int OFF : offsets) {
+            for (int col = OFF; col < width_; col += num_steps_) {
                 ordered_cols.push_back(col);
             }
         }
@@ -105,11 +105,6 @@ void PixelReveal::render(int dst_x, int dst_y) const {
 }
 
 // Indica si el revelado ha completado todas las filas
-bool PixelReveal::isComplete() const {
-    for (const int step : row_step_) {
-        if (step < num_steps_) {
-            return false;
-        }
-    }
-    return true;
+auto PixelReveal::isComplete() const -> bool {
+    return std::ranges::all_of(row_step_, [this](int s) { return s >= num_steps_; });
 }