Skip to content

Commit 725bd64

Browse files
[pre-commit.ci lite] apply automatic fixes
1 parent 0a40350 commit 725bd64

File tree

2 files changed

+25
-16
lines changed

2 files changed

+25
-16
lines changed

source/module_base/test/opt_CG_test.cpp

Lines changed: 14 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -18,10 +18,10 @@ class CG_test : public testing::Test
1818
double residual = 10.;
1919
double tol = 1e-5;
2020
int final_iter = 0;
21-
char *task = NULL;
22-
double *Ap = NULL;
23-
double *p = NULL;
24-
double *x = NULL;
21+
char *task = nullptr;
22+
double *Ap = nullptr;
23+
double *p = nullptr;
24+
double *x = nullptr;
2525

2626
void SetUp()
2727
{
@@ -65,7 +65,8 @@ class CG_test : public testing::Test
6565
tools.le.get_Ap(tools.le.A, p, Ap);
6666
int ifPD = 0;
6767
step = cg.step_length(Ap, p, ifPD);
68-
for (int i = 0; i < 3; ++i) x[i] += step * p[i];
68+
for (int i = 0; i < 3; ++i) { x[i] += step * p[i];
69+
}
6970
residual = cg.get_residual();
7071
}
7172
}
@@ -102,14 +103,16 @@ class CG_test : public testing::Test
102103
{
103104
tools.dfuncdx(x, gradient, func_label);
104105
residual = 0;
105-
for (int i = 0; i<3 ;++i) residual += gradient[i] * gradient[i];
106+
for (int i = 0; i<3 ;++i) { residual += gradient[i] * gradient[i];
107+
}
106108
if (residual < tol)
107109
{
108110
final_iter = iter;
109111
break;
110112
}
111113
cg.next_direct(gradient, cg_label, p);
112-
for (int i = 0; i < 3; ++i) temp_x[i] = x[i];
114+
for (int i = 0; i < 3; ++i) { temp_x[i] = x[i];
115+
}
113116
task[0] = 'S'; task[1] = 'T'; task[2] = 'A'; task[3] = 'R'; task[4] = 'T';
114117
while (true)
115118
{
@@ -118,7 +121,8 @@ class CG_test : public testing::Test
118121
ds.dcSrch(f, g, step, task);
119122
if (task[0] == 'F' && task[1] == 'G')
120123
{
121-
for (int j = 0; j < 3; ++j) temp_x[j] = x[j] + step * p[j];
124+
for (int j = 0; j < 3; ++j) { temp_x[j] = x[j] + step * p[j];
125+
}
122126
continue;
123127
}
124128
else if (task[0] == 'C' && task[1] == 'O')
@@ -134,7 +138,8 @@ class CG_test : public testing::Test
134138
break;
135139
}
136140
}
137-
for (int i = 0; i < 3; ++i) x[i] += step * p[i];
141+
for (int i = 0; i < 3; ++i) { x[i] += step * p[i];
142+
}
138143
}
139144
delete[] temp_x;
140145
delete[] gradient;

source/module_base/test/opt_TN_test.cpp

Lines changed: 11 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -17,9 +17,9 @@ class TN_test : public testing::Test
1717
double tol = 1e-5;
1818
int final_iter = 0;
1919
int flag = 0;
20-
char *task = NULL;
21-
double *p = NULL;
22-
double *x = NULL;
20+
char *task = nullptr;
21+
double *p = nullptr;
22+
double *x = nullptr;
2323

2424
void SetUp()
2525
{
@@ -61,7 +61,8 @@ class TN_test : public testing::Test
6161
{
6262
tools.dfuncdx(x, gradient, func_label);
6363
residual = 0;
64-
for (int i = 0; i<3 ;++i) residual += gradient[i] * gradient[i];
64+
for (int i = 0; i<3 ;++i) { residual += gradient[i] * gradient[i];
65+
}
6566
if (residual < tol)
6667
{
6768
final_iter = iter;
@@ -75,7 +76,8 @@ class TN_test : public testing::Test
7576
{
7677
tn.next_direct(x, gradient, flag, p, &(tools.mf), &ModuleESolver::ESolver_OF::dfuncdx);
7778
}
78-
for (int i = 0; i < 3; ++i) temp_x[i] = x[i];
79+
for (int i = 0; i < 3; ++i) { temp_x[i] = x[i];
80+
}
7981
task[0] = 'S'; task[1] = 'T'; task[2] = 'A'; task[3] = 'R'; task[4] = 'T';
8082
while (true)
8183
{
@@ -84,7 +86,8 @@ class TN_test : public testing::Test
8486
ds.dcSrch(f, g, step, task);
8587
if (task[0] == 'F' && task[1] == 'G')
8688
{
87-
for (int j = 0; j < 3; ++j) temp_x[j] = x[j] + step * p[j];
89+
for (int j = 0; j < 3; ++j) { temp_x[j] = x[j] + step * p[j];
90+
}
8891
continue;
8992
}
9093
else if (task[0] == 'C' && task[1] == 'O')
@@ -100,7 +103,8 @@ class TN_test : public testing::Test
100103
break;
101104
}
102105
}
103-
for (int i = 0; i < 3; ++i) x[i] += step * p[i];
106+
for (int i = 0; i < 3; ++i) { x[i] += step * p[i];
107+
}
104108
}
105109
delete[] temp_x;
106110
delete[] gradient;

0 commit comments

Comments
 (0)