| 79 | } |
| 80 | |
| 81 | void |
| 82 | StdSearchTracer::node(const EdgeInfo& ei, const NodeInfo& ni) { |
| 83 | os << "trace<Search>::node("; |
| 84 | switch (ni.type()) { |
| 85 | case NodeType::FAILED: |
| 86 | os << "FAILED"; |
| 87 | break; |
| 88 | case NodeType::SOLVED: |
| 89 | os << "SOLVED"; |
| 90 | break; |
| 91 | case NodeType::BRANCH: |
| 92 | os << "BRANCH(" << ni.choice().alternatives() << ")"; |
| 93 | break; |
| 94 | } |
| 95 | if (!ei) |
| 96 | os << ",root"; |
| 97 | os << ",w:" << ni.wid() << ','; |
| 98 | if (ei) |
| 99 | os << "p:" << ei.nid() << ','; |
| 100 | os << "n:" << ni.nid() << ')'; |
| 101 | if (ei) { |
| 102 | if (ei.wid() != ni.wid()) |
| 103 | os << " [stolen from w:" << ei.wid() << "]"; |
| 104 | os << std::endl |
| 105 | << '\t' << ei.string() |
| 106 | << std::endl; |
| 107 | } else { |
| 108 | os << std::endl; |
| 109 | } |
| 110 | } |
| 111 | |
| 112 | void |
| 113 | StdSearchTracer::done(void) { |