| 1 |
#include "arrayCheckHashTable.h" |
| 2 |
#include <iostream> |
| 3 |
|
| 4 |
#ifndef MINIMAL |
| 5 |
osl::checkmate::ArrayCheckHashTable::ArrayCheckHashTable(Player a) |
| 6 |
: buckets(new ElementList[bucketSize]), numElements(0), attacker(a) |
| 7 |
{ |
| 8 |
} |
| 9 |
osl::checkmate::ArrayCheckHashTable::~ArrayCheckHashTable() |
| 10 |
{ |
| 11 |
#ifdef CHECKMATE_DEBUG |
| 12 |
confirmNoVisitedRecords(); |
| 13 |
#endif |
| 14 |
} |
| 15 |
|
| 16 |
void osl::checkmate::ArrayCheckHashTable::clear() |
| 17 |
{ |
| 18 |
TwinTableHolder::clear(); |
| 19 |
for (unsigned int i=0; i<bucketSize; ++i) |
| 20 |
{ |
| 21 |
ElementList& e = buckets[i]; |
| 22 |
e.elem.colleagues.clear(); |
| 23 |
e.list.clear(); |
| 24 |
} |
| 25 |
numElements = 0; |
| 26 |
} |
| 27 |
|
| 28 |
void osl::checkmate::ArrayCheckHashTable::confirmNoVisitedRecords() const |
| 29 |
{ |
| 30 |
int visited = 0; |
| 31 |
for (unsigned int i=0; i<bucketSize; ++i) |
| 32 |
{ |
| 33 |
const ElementList& e = buckets[i]; |
| 34 |
visited += e.elem.colleagues.confirmNoVisitedRecords(); |
| 35 |
for (list_t::const_iterator p=e.list.begin(); p!=e.list.end(); ++p) |
| 36 |
{ |
| 37 |
const BoardEntry& b = *p; |
| 38 |
int curVisited = b.colleagues.confirmNoVisitedRecords(); |
| 39 |
if (curVisited) |
| 40 |
std::cerr << b.board_key[0] |
| 41 |
<< " " << b.board_key[1] |
| 42 |
<< "\n"; |
| 43 |
visited += curVisited; |
| 44 |
} |
| 45 |
} |
| 46 |
if (visited) |
| 47 |
{ |
| 48 |
std::cerr << "ArrayCheckHashTable::confirmNoVisitedRecords " |
| 49 |
<< visited << " visited nodes found\n"; |
| 50 |
} |
| 51 |
} |
| 52 |
#endif |
| 53 |
// ;;; Local Variables: |
| 54 |
// ;;; mode:c++ |
| 55 |
// ;;; c-basic-offset:2 |
| 56 |
// ;;; End: |