summaryrefslogtreecommitdiff
path: root/test/core/model/NodeTest.cpp
blob: 1c58e2cd8be60b9f34a7f86e6351cc5aa1514905 (plain)
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
/*
    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/managed/Managed.hpp>
#include <core/model/Node.hpp>

namespace ousia {
namespace dom {

class TestNode : public Node {
private:
	std::vector<Owned<Node>> children;

protected:
	void doResolve(std::vector<Rooted<Managed>> &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<Managed>> 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()));
}

}
}