trim trailing whitespaces

sun-yuliang · Jul 16, 2020 · 61cc153 · 61cc153
1 parent b35fe9a
commit 61cc153
Show file tree

Hide file tree

Showing 9 changed files with 43 additions and 43 deletions.
diff --git a/board.c b/board.c
@@ -214,7 +214,7 @@ static void lookup_update(Board* bd, const Pos pos)
     Pos a2 = bd->seg[c - 1][3][pos].end;
     Pos a3 = bd->seg[oc - 1][3][pos].sta;
     Pos a4 = bd->seg[oc - 1][3][pos].end;
-    
+
     pat_reset(ppinc(bd));
     score(bd)[0] = bd->sc[num(bd) - 1][0];
     score(bd)[1] = bd->sc[num(bd) - 1][1];

diff --git a/board.h b/board.h
@@ -47,7 +47,7 @@ typedef struct
     u16 num[2];                             // stone number
     Pos board[BD_SIZE];                     // board array
     Pos mlist[BD_SIZE];                     // move array
-    
+
     Pattern pinc;                           // pattern increment
     Segment seg[2][4][BD_SIZE];             // segment array for each color, direction and position
 

diff --git a/display.c b/display.c
@@ -134,7 +134,7 @@ void print_board(Board* bd)
         printf("(%d, %d) ", bd->mlist[i] % BD_SIDE, bd->mlist[i] / BD_SIDE);
     putchar('\n');
 #endif
-    
+
 #if DISPLAY_CAND
     print_mvlist(pcand(bd));
 #endif

diff --git a/index.h b/index.h
diff --git a/pattab.c b/pattab.c
@@ -619,7 +619,7 @@ static void generate_pattern_defending(u8* tab, const Rule ru, const u8 len, con
     i8 bd8 = len - 7;
     i8 bd9 = len - 8;
     u8 i, j, ind1 = PAT_START, ind2 = AD_START;
-    
+
     // reset to COL_INVALID
     memset(tab, -1, PATTAB_SIZE);
 
@@ -686,7 +686,7 @@ static void generate_pattern_defending(u8* tab, const Rule ru, const u8 len, con
             if (b4_7[sev[i]].is && !((mask >> i) & PatternList[b4_7[sev[i]].index][3]))
             {
                 for (j = 5; j < PatternList[b4_7[sev[i]].index][4]; j++)
-                { 
+                {
                     tab[ind2++] = PatternList[b4_7[sev[i]].index][j] + i;
                     tab[ind2++] = B4d;
                 }

diff --git a/pattab.h b/pattab.h
@@ -22,7 +22,7 @@ extern "C" {
 #define PAT_START       3
 #define AD_START        (3 + PAT_SIZE)
 #define PATTAB_SIZE     (3 + PAT_SIZE + AD_SIZE)
-    
+
 extern u8 Pat5f[IIE5][PATTAB_SIZE];
 extern u8 Pat6f[IIE6][PATTAB_SIZE];
 extern u8 Pat7f[IIE7][PATTAB_SIZE];

diff --git a/public.h b/public.h
@@ -33,7 +33,7 @@ extern "C" {
 #define SEARCH_INFO                 1
 #define MESSAGE_STAT                0
 #define RANDOM_PCT                  0.0
-    
+
 // Search setting.
 #define ITERATIVE_DEEPENING         1
 #define SEARCH_DEPTH_MAX            256

diff --git a/search.c b/search.c
@@ -38,7 +38,7 @@ Score evaluate(const Board* bd)
     ev2 = score(bd)[opp(bd->next) - 1];
     ev3 = bd->sc[num(bd) - 1][bd->next - 1];
     ev4 = bd->sc[num(bd) - 1][opp(bd->next) - 1];
-    
+
     return (ev1 - ev2 + ev3 - ev4) / 2;
 }
 
@@ -65,7 +65,7 @@ static Score alphabeta(Board* bd, Pos* best, const u16 dep, Score alpha, Score b
     bd->node_cnt++;
     if (num(bd) > bd->stone_max)
         bd->stone_max = num(bd);
-    
+
     // Check WLD.
     u8 offset = 0;
     Color wld = check_wld(bd, &offset);
@@ -173,7 +173,7 @@ static Score alphabeta(Board* bd, Pos* best, const u16 dep, Score alpha, Score b
             ev = -alphabeta(bd, &tmp, dep_new, -beta, -alpha);
             undo(bd);
         }
-        
+
         if (bd->timeout)
             return alpha;
 
@@ -240,7 +240,7 @@ static Score iterative(Board* bd, Pos* best, u16* dep)
             // if victory move is found
             flag = true;
             if (*dep > VICTORY_REPEAT - 1)
-            {    
+            {
                 for (u16 i = 0; i < VICTORY_REPEAT; i++)
                     if (abs(ev_arr[*dep - 1 - i]) < VAL_VTHRE)
                         flag = false;
@@ -269,7 +269,7 @@ Pos get_best(Board* bd)
     bd->stone_ini = num(bd);
     bd->stone_max = num(bd);
     bd->node_cnt = 0;
-    
+
     // Check if first move.
     if (num(bd) == 0)
     {
@@ -317,7 +317,7 @@ Pos get_best(Board* bd)
     bd->t_end = get_ms();
     print_message(bd, bd->search_dep, bd->stone_max - bd->stone_ini, ev, bd->node_cnt, bd->t_end - bd->t_begin);
 #endif
-    
+
 #if MESSAGE_STAT
     Pos ptmp;
     Score ev0 = VAL_INVALID, ev1 = VAL_INVALID;
@@ -342,7 +342,7 @@ Pos get_best(Board* bd)
     //         break;
     //     }
     // }
-    
+
     // CutThreshold
     // ev0 = cand(bd).list[0].val;  // largest ev in mvlist
     // printf("MESSAGE %d\n", ev0 - ev1);

diff --git a/test.h b/test.h
@@ -14,7 +14,7 @@
 #ifdef __cplusplus
 extern "C" {
 #endif
-    
+
 void nei_table_test();
 
 void mvlist_test();