[pre-commit.ci lite] apply automatic fixes

Author: pre-commit-ci-lite[bot]

source/module_base/test/opt_CG_test.cpp

@@ -21,10 +21,10 @@ class CG_test : public testing::Test
     double residual = 10.;
     double tol = 1e-5;
     int final_iter = 0;
-    char *task = NULL;
-    double *Ap = NULL;
-    double *p = NULL;
-    double *x = NULL;
+    char *task = nullptr;
+    double *Ap = nullptr;
+    double *p = nullptr;
+    double *x = nullptr;
 
     void SetUp()
     {
@@ -68,7 +68,8 @@ class CG_test : public testing::Test
             tools.le.get_Ap(tools.le.A, p, Ap);
             int ifPD = 0;
             step = cg.step_length(Ap, p, ifPD);
-            for (int i = 0; i < 3; ++i) x[i] += step * p[i]; 
+            for (int i = 0; i < 3; ++i) { x[i] += step * p[i]; 
+}
             residual = cg.get_residual();
         }
     }
@@ -105,14 +106,16 @@ class CG_test : public testing::Test
         {
             tools.dfuncdx(x, gradient, func_label);
             residual = 0;
-            for (int i = 0; i<3 ;++i) residual += gradient[i] * gradient[i];
+            for (int i = 0; i<3 ;++i) { residual += gradient[i] * gradient[i];
+}
             if (residual < tol) 
             {
                 final_iter = iter;
                 break;
             }
             cg.next_direct(gradient, cg_label, p);
-            for (int i = 0; i < 3; ++i) temp_x[i] = x[i];
+            for (int i = 0; i < 3; ++i) { temp_x[i] = x[i];
+}
             task[0] = 'S'; task[1] = 'T'; task[2] = 'A'; task[3] = 'R'; task[4] = 'T';
             while (true)
             {
@@ -121,7 +124,8 @@ class CG_test : public testing::Test
                 ds.dcSrch(f, g, step, task);
                 if (task[0] == 'F' && task[1] == 'G')
                 {
-                    for (int j = 0; j < 3; ++j) temp_x[j] = x[j] + step * p[j];
+                    for (int j = 0; j < 3; ++j) { temp_x[j] = x[j] + step * p[j];
+}
                     continue;
                 }
                 else if (task[0] == 'C' && task[1] == 'O')
@@ -137,7 +141,8 @@ class CG_test : public testing::Test
                     break;
                 }
             }
-            for (int i = 0; i < 3; ++i) x[i] += step * p[i];
+            for (int i = 0; i < 3; ++i) { x[i] += step * p[i];
+}
         }
         delete[] temp_x;
         delete[] gradient;

source/module_base/test/opt_TN_test.cpp

@@ -17,9 +17,9 @@ class TN_test : public testing::Test
     double tol = 1e-5;
     int final_iter = 0;
     int flag = 0;
-    char *task = NULL;
-    double *p = NULL;
-    double *x = NULL;
+    char *task = nullptr;
+    double *p = nullptr;
+    double *x = nullptr;
 
     void SetUp()
     {
@@ -61,7 +61,8 @@ class TN_test : public testing::Test
         {
             tools.dfuncdx(x, gradient, func_label);
             residual = 0;
-            for (int i = 0; i<3 ;++i) residual += gradient[i] * gradient[i];
+            for (int i = 0; i<3 ;++i) { residual += gradient[i] * gradient[i];
+}
             if (residual < tol) 
             {
                 final_iter = iter;
@@ -75,7 +76,8 @@ class TN_test : public testing::Test
             {
                 tn.next_direct(x, gradient, flag, p, &(tools.mf), &ModuleESolver::ESolver_OF::dfuncdx);
             }
-            for (int i = 0; i < 3; ++i) temp_x[i] = x[i];
+            for (int i = 0; i < 3; ++i) { temp_x[i] = x[i];
+}
             task[0] = 'S'; task[1] = 'T'; task[2] = 'A'; task[3] = 'R'; task[4] = 'T';
             while (true)
             {
@@ -84,7 +86,8 @@ class TN_test : public testing::Test
                 ds.dcSrch(f, g, step, task);
                 if (task[0] == 'F' && task[1] == 'G')
                 {
-                    for (int j = 0; j < 3; ++j) temp_x[j] = x[j] + step * p[j];
+                    for (int j = 0; j < 3; ++j) { temp_x[j] = x[j] + step * p[j];
+}
                     continue;
                 }
                 else if (task[0] == 'C' && task[1] == 'O')
@@ -100,7 +103,8 @@ class TN_test : public testing::Test
                     break;
                 }
             }
-            for (int i = 0; i < 3; ++i) x[i] += step * p[i];
+            for (int i = 0; i < 3; ++i) { x[i] += step * p[i];
+}
         }
         delete[] temp_x;
         delete[] gradient;