| 1 |
/* treeTraverser.cc |
| 2 |
*/ |
| 3 |
#include "analyzer/treeTraverser.h" |
| 4 |
#include "checkHashRecord.h" |
| 5 |
#include <iostream> |
| 6 |
|
| 7 |
osl::checkmate::analyzer:: |
| 8 |
TreeTraverser::TreeTraverser(TreeWriter& w, const TwinTable& t) |
| 9 |
: writer(w), table(t) |
| 10 |
{ |
| 11 |
} |
| 12 |
|
| 13 |
osl::checkmate::analyzer:: |
| 14 |
TreeTraverser::~TreeTraverser() |
| 15 |
{ |
| 16 |
if (analyzerStack.size()) |
| 17 |
{ |
| 18 |
std::cerr << "unexpected abort in TreeTraverser\n"; |
| 19 |
std::cerr << "current stack was \n" << analyzerStack; |
| 20 |
} |
| 21 |
} |
| 22 |
|
| 23 |
bool osl::checkmate::analyzer:: |
| 24 |
TreeTraverser::findLoopToStackByTwins(const TwinList& l) const |
| 25 |
{ |
| 26 |
for (TwinList::const_iterator p=l.begin(); p!=l.end(); ++p) |
| 27 |
{ |
| 28 |
if (p->loopTo |
| 29 |
&& (p->loopTo->isVisited |
| 30 |
|| (analyzerStack.findLoop(p->loopTo) != analyzerStack.end()))) |
| 31 |
return true; |
| 32 |
} |
| 33 |
return false; |
| 34 |
} |
| 35 |
|
| 36 |
bool osl::checkmate::analyzer:: |
| 37 |
TreeTraverser::findLoopToStackByStack(const TwinList& l) const |
| 38 |
{ |
| 39 |
for (CheckStack::const_iterator p=analyzerStack.begin(); |
| 40 |
p != analyzerStack.end(); ++p) |
| 41 |
{ |
| 42 |
if (l.findLoopTo(p->record)) |
| 43 |
{ |
| 44 |
return true; |
| 45 |
} |
| 46 |
} |
| 47 |
return false; |
| 48 |
} |
| 49 |
|
| 50 |
bool osl::checkmate::analyzer:: |
| 51 |
TreeTraverser::findLoopToStack(const TwinList& l) const |
| 52 |
{ |
| 53 |
const bool byTwins = findLoopToStackByTwins(l); |
| 54 |
//const bool byStack = findLoopToStackByStack(l); |
| 55 |
return byTwins; |
| 56 |
} |
| 57 |
|
| 58 |
void osl::checkmate::analyzer:: |
| 59 |
TreeTraverser::traverseOrNode(Move lastMove, const CheckHashRecord *record, |
| 60 |
const HashKey& key, const PathEncoding& path) |
| 61 |
{ |
| 62 |
analyzerStack.push_back(CheckStackEntry(0, "T-OR ", record, |
| 63 |
key, path)); |
| 64 |
orNode(lastMove, record, key, path); |
| 65 |
analyzerStack.pop_back(); |
| 66 |
} |
| 67 |
|
| 68 |
void osl::checkmate::analyzer:: |
| 69 |
TreeTraverser::traverseAndNode(Move lastMove, const CheckHashRecord *record, |
| 70 |
const HashKey& key, const PathEncoding& path) |
| 71 |
{ |
| 72 |
analyzerStack.push_back(CheckStackEntry(0, "T-AND", record, |
| 73 |
key, path)); |
| 74 |
andNode(lastMove, record, key, path); |
| 75 |
analyzerStack.pop_back(); |
| 76 |
} |
| 77 |
|
| 78 |
|
| 79 |
/* ------------------------------------------------------------------------- */ |
| 80 |
// ;;; Local Variables: |
| 81 |
// ;;; mode:c++ |
| 82 |
// ;;; c-basic-offset:2 |
| 83 |
// ;;; End: |