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 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255
|
//-----------------------------------------------------------------------------
/** @file libboardgame_base/SgfTree.cpp
@author Markus Enzenberger
@copyright GNU General Public License version 3 or later */
//-----------------------------------------------------------------------------
#include "SgfTree.h"
#include <ctime>
#include "SgfUtil.h"
#include "StringUtil.h"
namespace libboardgame_base {
//-----------------------------------------------------------------------------
SgfTree::SgfTree()
{
SgfTree::init();
}
bool SgfTree::contains(const SgfNode& node) const
{
return &find_root(node) == &get_root();
}
const SgfNode& SgfTree::create_new_child(const SgfNode& node)
{
m_modified = true;
return non_const(node).create_new_child();
}
void SgfTree::delete_all_variations()
{
auto node = &get_root();
do
{
delete_variations(*node);
node = node->get_first_child_or_null();
}
while (node != nullptr);
}
void SgfTree::delete_variations(const SgfNode& node)
{
if (node.get_nu_children() <= 1)
return;
non_const(node).delete_variations();
m_modified = true;
}
double SgfTree::get_bad_move(const SgfNode& node)
{
return node.parse_property<double>("BM", 0);
}
string SgfTree::get_comment(const SgfNode& node)
{
return node.get_property("C", "");
}
string SgfTree::get_date_today()
{
time_t t = time(nullptr);
auto tmp = localtime(&t);
if (tmp == nullptr)
return "?";
char date[128];
strftime(date, sizeof(date), "%Y-%m-%d", tmp);
return date;
}
double SgfTree::get_good_move(const SgfNode& node)
{
return node.parse_property<double>("TE", 0);
}
bool SgfTree::has_variations() const
{
auto node = m_root.get();
do
{
if (node->get_sibling() != nullptr)
return true;
node = node->get_first_child_or_null();
}
while (node != nullptr);
return false;
}
void SgfTree::init()
{
auto root = make_unique<SgfNode>();
m_root = std::move(root);
m_modified = false;
}
void SgfTree::init(unique_ptr<SgfNode>& root)
{
m_root = std::move(root);
m_modified = false;
}
bool SgfTree::is_doubtful_move(const SgfNode& node)
{
return node.has_property("DO");
}
bool SgfTree::is_interesting_move(const SgfNode& node)
{
return node.has_property("IT");
}
void SgfTree::make_first_child(const SgfNode& node)
{
auto parent = node.get_parent_or_null();
if (parent != nullptr && &parent->get_first_child() != &node)
{
non_const(node).make_first_child();
m_modified = true;
}
}
void SgfTree::make_main_variation(const SgfNode& node)
{
auto current = &non_const(node);
while (current->has_parent())
{
make_first_child(*current);
current = ¤t->get_parent();
}
}
void SgfTree::make_root(const SgfNode& node)
{
if (&node == &get_root())
return;
LIBBOARDGAME_ASSERT(contains(node));
auto& parent = node.get_parent();
unique_ptr<SgfNode> new_root = non_const(parent).remove_child(non_const(node));
m_root = std::move(new_root);
m_modified = true;
}
void SgfTree::move_property_to_front(const SgfNode& node, const string& id)
{
if (non_const(node).move_property_to_front(id))
m_modified = true;
}
void SgfTree::move_down(const SgfNode& node)
{
if (node.get_sibling() != nullptr)
{
non_const(node).move_down();
m_modified = true;
}
}
void SgfTree::move_up(const SgfNode& node)
{
auto parent = node.get_parent_or_null();
if (parent != nullptr && &parent->get_first_child() != &node)
{
non_const(node).move_up();
m_modified = true;
}
}
void SgfTree::remove_move_annotation(const SgfNode& node)
{
remove_property(node, "BM");
remove_property(node, "DO");
remove_property(node, "IT");
remove_property(node, "TE");
}
bool SgfTree::remove_property(const SgfNode& node, const string& id)
{
bool prop_existed = non_const(node).remove_property(id);
if (prop_existed)
m_modified = true;
return prop_existed;
}
void SgfTree::set_application(const string& name, const string& version)
{
if (version.empty())
set_property(get_root(), "AP", name);
else
set_property(get_root(), "AP", name + ":" + version);
}
void SgfTree::set_property(const SgfNode& node, const string& id, const char* value)
{
bool was_changed = non_const(node).set_property(id, value);
if (was_changed)
m_modified = true;
}
void SgfTree::set_property_remove_empty(const SgfNode& node, const string& id,
const string& value)
{
string trimmed = trim(value);
if (trimmed.empty())
remove_property(node, id);
else
set_property(node, id, value);
}
void SgfTree::set_bad_move(const SgfNode& node, double value)
{
remove_move_annotation(node);
set_property(node, "BM", value);
}
void SgfTree::set_comment(const SgfNode& node, const string& s)
{
set_property_remove_empty(node, "C", s);
}
void SgfTree::set_date_today()
{
set_date(get_date_today());
}
void SgfTree::set_doubtful_move(const SgfNode& node)
{
remove_move_annotation(node);
set_property(node, "DO", "");
}
void SgfTree::set_good_move(const SgfNode& node, double value)
{
remove_move_annotation(node);
set_property(node, "TE", value);
}
void SgfTree::set_interesting_move(const SgfNode& node)
{
remove_move_annotation(node);
set_property(node, "IT", "");
}
const SgfNode& SgfTree::truncate(const SgfNode& node)
{
auto& parent = node.get_parent();
non_const(parent).remove_child(non_const(node));
m_modified = true;
return parent;
}
//-----------------------------------------------------------------------------
} // namespace libboardgame_base
|