| 190 | |
| 191 | |
| 192 | bool loop_dealerpar( |
| 193 | int * dealer_list, |
| 194 | int * vul_list, |
| 195 | DdTableResults * table_list, |
| 196 | ParResultsDealer * dealerpar_list, |
| 197 | const int number, |
| 198 | const int stepsize) |
| 199 | { |
| 200 | // This is so fast that there is no batch or multi-threaded |
| 201 | // version. We run it many times just to get meaningful times. |
| 202 | |
| 203 | ParResultsDealer presp; |
| 204 | |
| 205 | timer.start(number); |
| 206 | for (int i = 0; i < number; i++) |
| 207 | { |
| 208 | for (int j = 0; j < stepsize; j++) |
| 209 | { |
| 210 | int ret; |
| 211 | if ((ret = DealerPar(&table_list[i], &presp, |
| 212 | dealer_list[i], vul_list[i])) != RETURN_NO_FAULT) |
| 213 | { |
| 214 | cout << "loop_dealerpar: i " << i << ", j " << j << ": " << |
| 215 | "return " << ret << "\n"; |
| 216 | exit(0); |
| 217 | } |
| 218 | } |
| 219 | |
| 220 | if (compare_DEALERPAR(presp, dealerpar_list[i])) |
| 221 | continue; |
| 222 | |
| 223 | cout << "loop_dealerpar i " << i << ": Difference\n\n"; |
| 224 | print_DEALERPAR(presp); |
| 225 | cout << "\n"; |
| 226 | print_DEALERPAR(dealerpar_list[i]); |
| 227 | cout << "\n"; |
| 228 | } |
| 229 | timer.end(); |
| 230 | |
| 231 | #ifdef BATCHTIMES |
| 232 | timer.print_running(number, number); |
| 233 | #endif |
| 234 | |
| 235 | return true; |
| 236 | } |
| 237 | |
| 238 | |
| 239 | bool loop_play( |
no test coverage detected