dds-bridge-sys 2.1.1

/*
   DDS, a bridge double dummy solver.

   Copyright (C) 2006-2014 by Bo Haglund /
   2014-2018 by Bo Haglund & Soren Hein.

   See LICENSE and README.
*/

#ifndef DDS_TRANSTABLES_H
#define DDS_TRANSTABLES_H

/*
   This is an object for managing transposition tables and the
   associated memory.  Compared to TransTableL it uses a lot less
   memory and takes somewhat longer time.
*/


#include <vector>
#include <string>

#include "TransTable.h"

using namespace std;


class TransTableS: public TransTable
{
  private:

    // Structures for the small memory option.

    struct winCardType
    {
      int orderSet;
      int winMask;
      nodeCardsType * first;
      winCardType * prevWin;
      winCardType * nextWin;
      winCardType * next;
    };

    struct posSearchTypeSmall
    {
      winCardType * posSearchPoint;
      long long suitLengths;
      posSearchTypeSmall * left;
      posSearchTypeSmall * right;
    };

    struct ttAggrType
    {
      int aggrRanks[DDS_SUITS];
      int winMask[DDS_SUITS];
    };

    struct statsResetsType
    {
      int noOfResets;
      int aggrResets[TT_RESET_SIZE];
    };


    long long aggrLenSets[14];
    statsResetsType statsResets;

    winCardType temp_win[5];
    int nodeSetSizeLimit;
    int winSetSizeLimit;
    unsigned long long maxmem;
    unsigned long long allocmem;
    unsigned long long summem;
    int wmem;
    int nmem;
    int maxIndex;
    int wcount;
    int ncount;
    bool clearTTflag;
    int windex;
    ttAggrType * aggp;

    posSearchTypeSmall * rootnp[14][DDS_HANDS];
    winCardType ** pw;
    nodeCardsType ** pn;
    posSearchTypeSmall ** pl[14][DDS_HANDS];
    nodeCardsType * nodeCards;
    winCardType * winCards;
    posSearchTypeSmall * posSearch[14][DDS_HANDS];
    int nodeSetSize; /* Index with range 0 to nodeSetSizeLimit */
    int winSetSize;  /* Index with range 0 to winSetSizeLimit */
    int lenSetInd[14][DDS_HANDS];
    int lcount[14][DDS_HANDS];

    vector<string> resetText;

    long long suitLengths[14];

    int TTInUse;

    void SetConstants();

    void Wipe();

    void InitTT();

    void AddWinSet();

    void AddNodeSet();

    void AddLenSet(
      const int trick, 
      const int firstHand);

    void BuildSOP(
      const unsigned short ourWinRanks[DDS_SUITS],
      const unsigned short aggr[DDS_SUITS],
      const nodeCardsType& first,
      const long long suitLengths,
      const int tricks,
      const int firstHand,
      const bool flag);

    nodeCardsType * BuildPath(
      const int winMask[],
      const int winOrderSet[],
      const int ubound,
      const int lbound,
      const char bestMoveSuit,
      const char bestMoveRank,
      posSearchTypeSmall * node,
      bool& result);

    struct posSearchTypeSmall * SearchLenAndInsert(
      posSearchTypeSmall * rootp,
      const long long key,
      const bool insertNode,
      const int trick,
      const int firstHand,
      bool& result);

    nodeCardsType * UpdateSOP(
      const int ubound,
      const int lbound,
      const char bestMoveSuit,
      const char bestMoveRank,
      nodeCardsType * nodep);

    nodeCardsType const * FindSOP(
      const int orderSet[],
      const int limit,
      winCardType * nodeP,
      bool& lowerFlag);

  public:

    TransTableS();

    ~TransTableS();

    void Init(const int handLookup[][15]);

    void SetMemoryDefault(const int megabytes);

    void SetMemoryMaximum(const int megabytes);

    void MakeTT();

    void ResetMemory(const TTresetReason reason);

    void ReturnAllMemory();

    double MemoryInUse() const;

    nodeCardsType const * Lookup(
      const int trick,
      const int hand,
      const unsigned short aggrTarget[],
      const int handDist[],
      const int limit,
      bool& lowerFlag);

    void Add(
      const int trick,
      const int hand,
      const unsigned short aggrTarget[],
      const unsigned short winRanksArg[],
      const nodeCardsType& first,
      const bool flag);

    void PrintNodeStats(ofstream& fout) const;

    void PrintResetStats(ofstream& fout) const;
};

#endif