Method TransTableL

library/src/trans_table/trans_table_l.cpp:191–219

* @brief Large transposition table for double dummy solver. * * TransTableL implements a large, memory-intensive transposition table * used to cache and retrieve results during double dummy bridge analysis. * It manages memory allocation, lookup, and statistics for position caching. */

 * It manages memory allocation, lookup, and statistics for position caching.
*/
TransTableL::TransTableL()
{
  // Touch the tables once to ensure construction.
  (void)tt_lowest_rank_table();
  (void)mask_bytes_table();
  (void)players();
  // Initialize all internal state to safe defaults. Some of these
  // fields were previously left uninitialized and relied on implicit
  // zeroing via legacy construction paths. With newer creation flows
  // (via SolverContext), make the invariants explicit here.
  tt_in_use_ = 0;
  mem_state_ = MemState::FROM_POOL;
  pages_default_ = 0;
  pages_current_ = 0;
  pages_maximum_ = 0;
  harvest_trick_ = 0;
  harvest_hand_ = 0;
  page_stats_ = PageStats{0,0,0,0,0};
  timestamp_ = 0;
  pool_ = nullptr;
  next_block_ = nullptr;
  harvested_.next_block_no_ = 0;
  for (int c = 0; c < TtTricks; ++c) {
    for (int h = 0; h < DDS_HANDS; ++h) {
      tt_root_[c][h] = nullptr;
      last_block_seen_[c][h] = nullptr;
    }
  }
}

/**
 * @brief Destroy the TransTableL object and free all memory.