X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Ftt.cpp;h=1f495ca9d12be229aaef9a8171690c5ae5d3ad73;hb=HEAD;hp=a3ad0a78d4f8a25202825980659b87e4406b653f;hpb=2d0237db3f0e596fb06e3ffbadba84dcc4e018f6;p=stockfish

diff --git a/src/tt.cpp b/src/tt.cpp
index a3ad0a78..816d43f8 100644
--- a/src/tt.cpp
+++ b/src/tt.cpp
@@ -33,9 +33,8 @@ namespace Stockfish {
 
 TranspositionTable TT;  // Our global transposition table
 
-// TTEntry::save() populates the TTEntry with a new node's data, possibly
+// Populates the TTEntry with a new node's data, possibly
 // overwriting an old position. The update is not atomic and can be racy.
-
 void TTEntry::save(Key k, Value v, bool pv, Bound b, Depth d, Move m, Value ev) {
 
     // Preserve any existing move for the same position
@@ -57,10 +56,9 @@ void TTEntry::save(Key k, Value v, bool pv, Bound b, Depth d, Move m, Value ev)
 }
 
 
-// TranspositionTable::resize() sets the size of the transposition table,
+// Sets the size of the transposition table,
 // measured in megabytes. Transposition table consists of a power of 2 number
 // of clusters and each cluster consists of ClusterSize number of TTEntry.
-
 void TranspositionTable::resize(size_t mbSize) {
 
     Threads.main()->wait_for_search_finished();
@@ -80,9 +78,8 @@ void TranspositionTable::resize(size_t mbSize) {
 }
 
 
-// TranspositionTable::clear() initializes the entire transposition table to zero,
-//  in a multi-threaded way.
-
+// Initializes the entire transposition table to zero,
+// in a multi-threaded way.
 void TranspositionTable::clear() {
 
     std::vector<std::thread> threads;
@@ -109,13 +106,12 @@ void TranspositionTable::clear() {
 }
 
 
-// TranspositionTable::probe() looks up the current position in the transposition
+// Looks up the current position in the transposition
 // table. It returns true and a pointer to the TTEntry if the position is found.
 // Otherwise, it returns false and a pointer to an empty or least valuable TTEntry
 // to be replaced later. The replace value of an entry is calculated as its depth
 // minus 8 times its relative age. TTEntry t1 is considered more valuable than
 // TTEntry t2 if its replace value is greater than that of t2.
-
 TTEntry* TranspositionTable::probe(const Key key, bool& found) const {
 
     TTEntry* const tte   = first_entry(key);
@@ -148,7 +144,7 @@ TTEntry* TranspositionTable::probe(const Key key, bool& found) const {
 }
 
 
-// TranspositionTable::hashfull() returns an approximation of the hashtable
+// Returns an approximation of the hashtable
 // occupation during a search. The hash is x permill full, as per UCI protocol.
 
 int TranspositionTable::hashfull() const {