Small cleanups (march 2021)

[stockfish] / src / syzygy / tbprobe.cpp

diff --git a/src/syzygy/tbprobe.cpp b/src/syzygy/tbprobe.cpp
index 0500dd5a4f85055730f90a885497ae251a754386..831c8259c538c103b6d4eb4a15fe1577ca8fbd79 100644 (file)
--- a/src/syzygy/tbprobe.cpp
+++ b/src/syzygy/tbprobe.cpp
@@ -192,7 +192,8 @@ public:
         std::stringstream ss(Paths);
         std::string path;
 
         std::stringstream ss(Paths);
         std::string path;
 

-        while (std::getline(ss, path, SepChar)) {
+        while (std::getline(ss, path, SepChar))
+        {

             fname = path + "/" + f;
             std::ifstream::open(fname);
             if (is_open())
             fname = path + "/" + f;
             std::ifstream::open(fname);
             if (is_open())


@@ -567,7 +568,8 @@ int decompress_pairs(PairsData* d, uint64_t idx) {
     int buf64Size = 64;
     Sym sym;
 
     int buf64Size = 64;
     Sym sym;
 

-    while (true) {
+    while (true)
+    {

         int len = 0; // This is the symbol length - d->min_sym_len
 
         // Now get the symbol length. For any symbol s64 of length l right-padded
         int len = 0; // This is the symbol length - d->min_sym_len
 
         // Now get the symbol length. For any symbol s64 of length l right-padded


@@ -605,8 +607,8 @@ int decompress_pairs(PairsData* d, uint64_t idx) {
     // We binary-search for our value recursively expanding into the left and
     // right child symbols until we reach a leaf node where symlen[sym] + 1 == 1
     // that will store the value we need.
     // We binary-search for our value recursively expanding into the left and
     // right child symbols until we reach a leaf node where symlen[sym] + 1 == 1
     // that will store the value we need.

-    while (d->symlen[sym]) {
-
+    while (d->symlen[sym])
+    {

         Sym left = d->btree[sym].get<LR::Left>();
 
         // If a symbol contains 36 sub-symbols (d->symlen[sym] + 1 = 36) and
         Sym left = d->btree[sym].get<LR::Left>();
 
         // If a symbol contains 36 sub-symbols (d->symlen[sym] + 1 = 36) and