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
|
//-----------------------------------------------------------------------------
/** @file libboardgame_base/tests/SgfNodeTest.cpp
@author Markus Enzenberger
@copyright GNU General Public License version 3 or later */
//-----------------------------------------------------------------------------
#include "libboardgame_base/SgfNode.h"
#include <memory>
#include "libboardgame_test/Test.h"
using namespace libboardgame_base;
//-----------------------------------------------------------------------------
LIBBOARDGAME_TEST_CASE(sgf_node_create_new_child)
{
auto parent = make_unique<SgfNode>();
auto& child = parent->create_new_child();
LIBBOARDGAME_CHECK_EQUAL(&parent->get_child(), &child)
LIBBOARDGAME_CHECK_EQUAL(&child.get_parent(), parent.get())
}
LIBBOARDGAME_TEST_CASE(sgf_node_remove_property)
{
string id = "B";
auto node = make_unique<SgfNode>();
LIBBOARDGAME_CHECK(! node->has_property(id))
node->set_property(id, "foo");
LIBBOARDGAME_CHECK(node->has_property(id))
LIBBOARDGAME_CHECK_EQUAL(node->get_property(id), "foo")
bool result = node->remove_property(id);
LIBBOARDGAME_CHECK(result)
LIBBOARDGAME_CHECK(! node->has_property(id))
}
//-----------------------------------------------------------------------------
|