[Mlir-commits] [mlir] b5c0102 - [MLIR] Apply clang-tidy fixes for modernize-loop-convert in BarvinokTest.cpp (NFC)

[Mehdi Amini]

Author: Mehdi Amini
Date: 2025-09-25T08:45:46-07:00
New Revision: b5c01029eddea97b86af80c75d8ad60be67bd546

URL: https://github.com/llvm/llvm-project/commit/b5c01029eddea97b86af80c75d8ad60be67bd546
DIFF: https://github.com/llvm/llvm-project/commit/b5c01029eddea97b86af80c75d8ad60be67bd546.diff

LOG: [MLIR] Apply clang-tidy fixes for modernize-loop-convert in BarvinokTest.cpp (NFC)

Added: 
    

Modified: 
    mlir/unittests/Analysis/Presburger/BarvinokTest.cpp

Removed: 
    


################################################################################
diff  --git a/mlir/unittests/Analysis/Presburger/BarvinokTest.cpp b/mlir/unittests/Analysis/Presburger/BarvinokTest.cpp
index 5e279b542fdf9..eaf04379cb529 100644
--- a/mlir/unittests/Analysis/Presburger/BarvinokTest.cpp
+++ b/mlir/unittests/Analysis/Presburger/BarvinokTest.cpp
@@ -231,10 +231,10 @@ TEST(BarvinokTest, computeNumTermsCone) {
   // We expect the answer to be
   // (⌊M⌋ + 1)(⌊N⌋ + 1)(⌊P⌋ + 1) =
   // ⌊M⌋⌊N⌋⌊P⌋ + ⌊M⌋⌊N⌋ + ⌊N⌋⌊P⌋ + ⌊M⌋⌊P⌋ + ⌊M⌋ + ⌊N⌋ + ⌊P⌋ + 1.
-  for (unsigned i = 0; i < 2; i++)
+  for (auto &i : count)
     for (unsigned j = 0; j < 2; j++)
       for (unsigned k = 0; k < 2; k++)
-        EXPECT_EQ(count[i][j][k], 1);
+        EXPECT_EQ(i[j][k], 1);
 }
 
 /// We define some simple polyhedra with unimodular tangent cones and verify