/*
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 .
*/
#include
#include
#include
namespace ousia {
namespace dom {
class TestNode : public Node {
private:
std::vector> children;
protected:
void doResolve(std::vector> &res,
const std::vector &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 addChild(Handle node)
{
Owned nd = acquire(node);
children.push_back(nd);
return nd;
}
};
TEST(Node, isRoot)
{
Manager mgr;
Rooted n1{new TestNode(mgr)};
Rooted n2{new TestNode(mgr)};
Rooted 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 root{new TestNode(mgr, "root")};
Rooted child1 = root->addChild(new TestNode(mgr, "child1"));
Rooted child11 = child1->addChild(new TestNode(mgr, "child11"));
std::vector> res;
res = root->resolve(std::vector{"root", "child1", "child11"});
ASSERT_EQ(1, res.size());
ASSERT_TRUE(child11 == *(res.begin()));
res = root->resolve(std::vector{"child1", "child11"});
ASSERT_EQ(1, res.size());
ASSERT_TRUE(child11 == *(res.begin()));
res = root->resolve(std::vector{"child11"});
ASSERT_EQ(1, res.size());
ASSERT_TRUE(child11 == *(res.begin()));
}
}
}