We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent e258558 commit b5c0102Copy full SHA for b5c0102
mlir/unittests/Analysis/Presburger/BarvinokTest.cpp
@@ -231,10 +231,10 @@ TEST(BarvinokTest, computeNumTermsCone) {
231
// We expect the answer to be
232
// (⌊M⌋ + 1)(⌊N⌋ + 1)(⌊P⌋ + 1) =
233
// ⌊M⌋⌊N⌋⌊P⌋ + ⌊M⌋⌊N⌋ + ⌊N⌋⌊P⌋ + ⌊M⌋⌊P⌋ + ⌊M⌋ + ⌊N⌋ + ⌊P⌋ + 1.
234
- for (unsigned i = 0; i < 2; i++)
+ for (auto &i : count)
235
for (unsigned j = 0; j < 2; j++)
236
for (unsigned k = 0; k < 2; k++)
237
- EXPECT_EQ(count[i][j][k], 1);
+ EXPECT_EQ(i[j][k], 1);
238
}
239
240
/// We define some simple polyhedra with unimodular tangent cones and verify
0 commit comments