format

HRD_group.h

@@ -38,7 +38,7 @@ class HRD_group {
             vector <unsigned long long> solution_case;
             vector <unsigned long long> solution_step;
         };
-        vector <unsigned long long> Next_Case_dat; // 储存Find_Next_Case找到的结果
+        vector <unsigned long long> Next_Case_dat; // 储存Find_Next_Case找到的结果
         string File_name_farthest;
         string File_name_solution;
         bool Output_solution_case;

HRD_statistic.cpp

@@ -112,12 +112,12 @@ vector <HRD_statistic::Case_group *> HRD_statistic::Split_Group(vector <unsigned
     }
     if (groups.size() == 0) {return output_dat;}
     for (i = 0; i < groups.size() - 1; i++) {
-		for (j = 0; j < groups.size() - i - 1; j++) {
-			if (groups[j].size() < groups[j + 1].size()) {
-				swap(groups[j], groups[j + 1]);
-			}
-		}
-	}
+        for (j = 0; j < groups.size() - i - 1; j++) {
+            if (groups[j].size() < groups[j + 1].size()) {
+                swap(groups[j], groups[j + 1]);
+            }
+        }
+    }
     output_dat.resize(input_dat.size());
     for (i = 0; i < groups.size(); i++) {
         for (j = 0; j < groups[i].size(); j++) {
@@ -169,10 +169,10 @@ void HRD_statistic::Output_main_table(string File_name) {
     output.close();
 }
 void HRD_statistic::Find_All_Case() {
-	unsigned long long i, n, Code;
-	unsigned int num = 0;
-	HRD_cal cal;
-	All_Case.clear();
+    unsigned long long i, n, Code;
+    unsigned int num = 0;
+    HRD_cal cal;
+    All_Case.clear();
     for (n = 0; n < 0xF; n++) {
         if (n % 4 == 3) {continue;}
         for (i = 0; i <= 0xFFFFFFFF; i++) {