Skip to content

Commit 15774b2

Browse files
committed
fix build
1 parent b10e2c8 commit 15774b2

File tree

2 files changed

+15
-16
lines changed

2 files changed

+15
-16
lines changed

UnitTests/Common/containers/CLookupTable_tests.cpp

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -26,10 +26,8 @@
2626
*/
2727

2828
#include "catch.hpp"
29-
#include <sstream>
30-
#include <filesystem>
3129

32-
#include <dirent.h>
30+
#include <sstream>
3331
#include <stdio.h>
3432

3533
#include "../../../Common/include/CConfig.hpp"

UnitTests/Common/toolboxes/ndflattener_tests.cpp

Lines changed: 14 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -30,14 +30,15 @@
3030

3131
TEST_CASE("NdFlattener Test", "[NdFlattener]"){
3232

33-
int rank; SU2_MPI::Comm_rank(SU2_MPI::GetComm(), &rank);
34-
int size; SU2_MPI::Comm_size(SU2_MPI::GetComm(), &size);
33+
int rank_; SU2_MPI::Comm_rank(SU2_MPI::GetComm(), &rank_);
34+
int size_; SU2_MPI::Comm_size(SU2_MPI::GetComm(), &size_);
35+
const size_t rank = rank_, size = size_;
3536

3637
/*-- Provide non-flat array --*/
3738
su2double** A = new su2double*[2];
3839
A[0] = new su2double[2]; A[0][0] = 0.0; A[0][1] = 1.0;
3940
A[1] = new su2double[3+rank];
40-
for(int i=0; i<3+rank; i++)
41+
for(size_t i=0; i<3+rank; i++)
4142
A[1][i] = 2.0 + rank + i;
4243

4344
/*-- Accessor --*/
@@ -59,7 +60,7 @@ TEST_CASE("NdFlattener Test", "[NdFlattener]"){
5960
REQUIRE( nd2[0][0] == 0.0 );
6061
REQUIRE( nd2[0][1] == 1.0 );
6162
REQUIRE( nd2[1].size() == 3 + rank );
62-
for(int i=0; i<3+rank; i++){
63+
for(size_t i=0; i<3+rank; i++){
6364
REQUIRE( nd2[1][i] == 2.0 + rank + i );
6465
}
6566

@@ -72,25 +73,25 @@ TEST_CASE("NdFlattener Test", "[NdFlattener]"){
7273

7374
/*-- Check gathered structure, non-const look-up. --*/
7475
REQUIRE( nd3.size() == size );
75-
for(int r=0; r<size; r++){
76+
for(size_t r=0; r<size; r++){
7677
REQUIRE( nd3[r].size() == 2 );
7778
REQUIRE( nd3[r][0][0] == 0.7 );
7879
REQUIRE( nd3[r][0][1] == 1.7 );
7980
REQUIRE( nd3[r][1].size() == 3 + r );
80-
for(int i=0; i<3+r; i++){
81+
for(size_t i=0; i<3+r; i++){
8182
REQUIRE( nd3[r][1][i] == 2.0 + r + i );
8283
}
8384
}
8485

8586
/*-- Check gathered structure, const look-up. --*/
8687
const NdFlattener<3>& nd3_const = nd3;
8788
REQUIRE( nd3_const.size() == size );
88-
for(int r=0; r<size; r++){
89+
for(size_t r=0; r<size; r++){
8990
REQUIRE( nd3_const[r].size() == 2 );
9091
REQUIRE( nd3_const[r][0][0] == 0.7 );
9192
REQUIRE( nd3_const[r][0][1] == 1.7 );
9293
REQUIRE( nd3_const[r][1].size() == 3 + r );
93-
for(int i=0; i<3+r; i++){
94+
for(size_t i=0; i<3+r; i++){
9495
REQUIRE( nd3_const[r][1][i] == 2.0 + r + i );
9596
}
9697
}
@@ -100,12 +101,12 @@ TEST_CASE("NdFlattener Test", "[NdFlattener]"){
100101
nd2.initialize_or_refresh(f);
101102
nd3.refresh(Nd_MPI_Environment(), nd2);
102103
REQUIRE( nd3.size() == size );
103-
for(int r=0; r<size; r++){
104+
for(size_t r=0; r<size; r++){
104105
REQUIRE( nd3[r].size() == 2 );
105106
REQUIRE( nd3[r][0][0] == 0.5 );
106107
REQUIRE( nd3[r][0][1] == 1.0 );
107108
REQUIRE( nd3[r][1].size() == 3 + r );
108-
for(int i=0; i<3+r; i++){
109+
for(size_t i=0; i<3+r; i++){
109110
REQUIRE( nd3[r][1][i] == 2.0 + r + i );
110111
}
111112
}
@@ -118,7 +119,7 @@ TEST_CASE("NdFlattener Test", "[NdFlattener]"){
118119
);
119120
const NdFlattener<1, unsigned long>& a1_const = a1;
120121
REQUIRE( a1.size() == 3 + rank );
121-
for(int i=0; i<3+rank; i++){
122+
for(size_t i=0; i<3+rank; i++){
122123
REQUIRE( a1[i] == 2 + rank + i );
123124
REQUIRE( a1_const[i] == 2 + rank + i );
124125
}
@@ -128,9 +129,9 @@ TEST_CASE("NdFlattener Test", "[NdFlattener]"){
128129
REQUIRE( a1_const[0] == 2 + rank );
129130
const NdFlattener<2, unsigned long> a2_const(Nd_MPI_Environment(MPI_UNSIGNED_LONG), a1);
130131
REQUIRE( a2_const.size() == size );
131-
for(int r=0; r<size; r++){
132+
for(size_t r=0; r<size; r++){
132133
REQUIRE( a2_const[r].size() == 3 + r );
133-
for(int i=0; i<3+r; i++){
134+
for(size_t i=0; i<3+r; i++){
134135
REQUIRE( a2_const[r][i] == 2 + r + i );
135136
}
136137
}

0 commit comments

Comments
 (0)