File: print.cpp

package info (click to toggle)
dds 2.9.0-10
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 56,576 kB
  • sloc: cpp: 17,621; ansic: 385; makefile: 27; xml: 11; sh: 7
file content (201 lines) | stat: -rw-r--r-- 4,753 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
/*
   DDS, a bridge double dummy solver.

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

   See LICENSE and README.
*/


#include <iostream>
#include <iomanip>
#include <algorithm>

#include "print.h"
#include "cst.h"


static unsigned short dbitMapRank[16];
static unsigned char dcardRank[16];
static unsigned char dcardSuit[5];

string equals_to_string(const int equals);


void set_constants()
{
  dbitMapRank[15] = 0x2000;
  dbitMapRank[14] = 0x1000;
  dbitMapRank[13] = 0x0800;
  dbitMapRank[12] = 0x0400;
  dbitMapRank[11] = 0x0200;
  dbitMapRank[10] = 0x0100;
  dbitMapRank[ 9] = 0x0080;
  dbitMapRank[ 8] = 0x0040;
  dbitMapRank[ 7] = 0x0020;
  dbitMapRank[ 6] = 0x0010;
  dbitMapRank[ 5] = 0x0008;
  dbitMapRank[ 4] = 0x0004;
  dbitMapRank[ 3] = 0x0002;
  dbitMapRank[ 2] = 0x0001;
  dbitMapRank[ 1] = 0;
  dbitMapRank[ 0] = 0;

  dcardRank[ 2] = '2';
  dcardRank[ 3] = '3';
  dcardRank[ 4] = '4';
  dcardRank[ 5] = '5';
  dcardRank[ 6] = '6';
  dcardRank[ 7] = '7';
  dcardRank[ 8] = '8';
  dcardRank[ 9] = '9';
  dcardRank[10] = 'T';
  dcardRank[11] = 'J';
  dcardRank[12] = 'Q';
  dcardRank[13] = 'K';
  dcardRank[14] = 'A';
  dcardRank[15] = '-';

  dcardSuit[0] = 'S';
  dcardSuit[1] = 'H';
  dcardSuit[2] = 'D';
  dcardSuit[3] = 'C';
  dcardSuit[4] = 'N';
}


void print_PBN(const dealPBN& dl)
{
  cout << setw(10) << left << "trump" << dl.trump << "\n";
  cout << setw(10) << "first" << dl.first << "\n";
  cout << setw(10) << "cards" << dl.remainCards << "\n";
}


void print_FUT(const futureTricks& fut)
{
  cout << setw(6) << left << "cards" << fut.cards << "\n";
  cout << setw(6) << right <<  "No." << 
    setw(7) << "suit" <<
    setw(7) << "rank" <<
    setw(7) << "equals" <<
    setw(7) << "score" << "\n";

  for (int i = 0; i < fut.cards; i++)
  {
    cout << setw(6) << right << i <<
      setw(7) << dcardSuit[ fut.suit[i] ] <<
      setw(7) << dcardRank[ fut.rank[i] ] <<
      setw(7) << equals_to_string(fut.equals[i]) <<
      setw(7) << fut.score[i] << "\n";
  }
}


string equals_to_string(const int equals)
{
  string st = "";
  for (unsigned i = 15; i >= 2; i--)
  {
    if (equals & dbitMapRank[i])
      st += static_cast<char>(dcardRank[i]);
  }
  return (st == "" ? "-" : st);
}


void print_TABLE(const ddTableResults& table)
{
  cout << setw(5) << right << "" <<
    setw(6) << "North" <<
    setw(6) << "South" <<
    setw(6) << "East" <<
    setw(6) << "West" << "\n";

  cout << setw(5) << right << "NT" <<
    setw(6) << table.resTable[4][0] <<
    setw(6) << table.resTable[4][2] <<
    setw(6) << table.resTable[4][1] <<
    setw(6) << table.resTable[4][3] << "\n";

  for (int suit = 0; suit <= 3; suit++)
  {
    cout << setw(5) << right << dcardSuit[suit] <<
      setw(6) << table.resTable[suit][0] <<
      setw(6) << table.resTable[suit][2] <<
      setw(6) << table.resTable[suit][1] <<
      setw(6) << table.resTable[suit][3] << "\n";
  }
}


void print_PAR(const parResults& par)
{
  cout << setw(9) << left << "NS score" << par.parScore[0] << "\n";
  cout << setw(9) << "EW score" << par.parScore[1] << "\n";
  cout << setw(9) << "NS list" << par.parContractsString[0] << "\n";
  cout << setw(9) << "EW list" << par.parContractsString[1] << "\n";
}


void print_DEALERPAR(const parResultsDealer& par)
{
  cout << setw(6) << left << "Score" << par.score << "\n";
  cout << setw(6) << left << "Pars" << par.number << "\n";

  for (int i = 0; i < par.number; i++)
    cout << left << "Par " << setw(2) << i << par.contracts[i] << "\n";
}


void print_PLAY(const playTracePBN& play)
{
  cout << setw(6) << right << "Number" << 
    setw(5) << play.number << "\n";

  for (int i = 0; i < play.number; i++)
     cout << setw(6) << i <<  "   " << 
       play.cards[2*i] << play.cards[2*i+1] << "\n";
}


void print_TRACE(const solvedPlay& solved)
{
  cout << setw(6) << right << "Number" << 
    setw(5) << solved.number << "\n";

  for (int i = 0; i < solved.number; i++)
     cout << setw(6) << i << 
       setw(5) << solved.tricks[i] << "\n";
}


void print_double_TRACE(
  const solvedPlay& solved, 
  const solvedPlay& ref)
{
  cout << "Number solved vs ref: " << solved.number << " vs. " <<
    ref.number << "\n";

  const int m = min(solved.number, ref.number);
  for (int i = 0; i < m; i++)
  {
    cout << "Trick " << i << ": " << 
      solved.tricks[i] << " vs " <<
      ref.tricks[i] << 
      (solved.tricks[i] == ref.tricks[i] ? "" : " ERROR") << "\n";
  }

  if (solved.number > m)
  {
    for (int i = m; i < solved.number; i++)
      cout << "Solved " << i << ": " << solved.tricks[i] << "\n";
  }
  else if (ref.number > m)
  {
    for (int i = m; i < ref.number; i++)
      cout << "Ref    " << i << ": " << ref.tricks[i] << "\n";
  }
}