summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAndreas Stöckel <astoecke@techfak.uni-bielefeld.de>2014-11-14 01:24:58 +0100
committerAndreas Stöckel <astoecke@techfak.uni-bielefeld.de>2014-11-14 01:24:58 +0100
commit46fadba6f804b44a726b5b2de1bac188a1785a54 (patch)
tree89b20fb6528ba80bc5c36ff20ec7cea793073db8
parent9bc7a08b120d8ad7e158a29ead8a09baa538c56c (diff)
added TestNode unit test
-rw-r--r--test/core/dom/NodeTest.cpp91
1 files changed, 91 insertions, 0 deletions
diff --git a/test/core/dom/NodeTest.cpp b/test/core/dom/NodeTest.cpp
new file mode 100644
index 0000000..e7c8d96
--- /dev/null
+++ b/test/core/dom/NodeTest.cpp
@@ -0,0 +1,91 @@
+/*
+ Ousía
+ Copyright (C) 2014, 2015 Benjamin Paaßen, Andreas Stöckel
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program. If not, see <http://www.gnu.org/licenses/>.
+*/
+
+#include <gtest/gtest.h>
+
+#include <core/dom/Node.hpp>
+
+namespace ousia {
+namespace dom {
+
+class TestNode : public Node {
+private:
+ std::vector<Owned<Node>> children;
+
+protected:
+ void doResolve(std::vector<Rooted<Node>> &res,
+ const std::vector<std::string> &path, Filter filter,
+ void *filterData, unsigned idx, VisitorSet &visited) override
+ {
+ for (auto &n : children) {
+ n->resolve(res, path, filter, filterData, idx, visited, nullptr);
+ }
+ }
+
+public:
+ using Node::Node;
+
+ Rooted<TestNode> addChild(Handle<TestNode> node)
+ {
+ Owned<TestNode> nd = acquire(node);
+ children.push_back(nd);
+ return nd;
+ }
+};
+
+TEST(Node, isRoot)
+{
+ Manager mgr;
+ Rooted<TestNode> n1{new TestNode(mgr)};
+ Rooted<TestNode> n2{new TestNode(mgr)};
+ Rooted<TestNode> n3{new TestNode(mgr, n2)};
+ ASSERT_TRUE(n1->isRoot());
+ ASSERT_TRUE(n2->isRoot());
+ ASSERT_FALSE(n3->isRoot());
+
+ n2->setParent(n1);
+ ASSERT_TRUE(n1->isRoot());
+ ASSERT_FALSE(n2->isRoot());
+ ASSERT_FALSE(n3->isRoot());
+}
+
+
+
+TEST(Node, simpleResolve)
+{
+ Manager mgr;
+ Rooted<TestNode> root{new TestNode(mgr, "root")};
+ Rooted<TestNode> child1 = root->addChild(new TestNode(mgr, "child1"));
+ Rooted<TestNode> child11 = child1->addChild(new TestNode(mgr, "child11"));
+
+ std::vector<Rooted<Node>> res;
+ res = root->resolve(std::vector<std::string>{"root", "child1", "child11"});
+ ASSERT_EQ(1, res.size());
+ ASSERT_TRUE(child11 == *(res.begin()));
+
+ res = root->resolve(std::vector<std::string>{"child1", "child11"});
+ ASSERT_EQ(1, res.size());
+ ASSERT_TRUE(child11 == *(res.begin()));
+
+ res = root->resolve(std::vector<std::string>{"child11"});
+ ASSERT_EQ(1, res.size());
+ ASSERT_TRUE(child11 == *(res.begin()));
+}
+
+}
+}