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
|
/*
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 <iostream>
#include <core/model/Node.hpp>
namespace ousia {
TEST(Index, simple)
{
Manager mgr{1};
Rooted<Managed> owner{new Managed(mgr)};
{
NodeVector<Node> nodes(owner);
Index &idx = nodes.getIndex();
Node* n1 = new Node(mgr, "node1");
Node* n2 = new Node(mgr, "node2");
Node* n3 = new Node(mgr, "node3");
nodes.push_back(n1);
nodes.push_back(n2);
nodes.push_back(n3);
// Index
ASSERT_EQ(n1, idx.resolve("node1"));
ASSERT_EQ(n2, idx.resolve("node2"));
ASSERT_EQ(n3, idx.resolve("node3"));
ASSERT_EQ(nullptr, idx.resolve("node4"));
// Rename
n2->setName("node2b");
ASSERT_EQ(nullptr, idx.resolve("node2"));
ASSERT_EQ(n2, idx.resolve("node2b"));
// Delete
nodes.erase(nodes.begin() + 1);
ASSERT_EQ(nullptr, idx.resolve("node2b"));
nodes.erase(nodes.begin() + 0);
ASSERT_EQ(nullptr, idx.resolve("node1"));
// Another rename
n3->setName("node3b");
ASSERT_EQ(nullptr, idx.resolve("node3"));
ASSERT_EQ(n3, idx.resolve("node3b"));
}
}
TEST(Index, shared)
{
Manager mgr{1};
Rooted<Managed> owner{new Managed(mgr)};
Index idx;
{
NodeVector<Node, Index&> nodes1(owner, idx);
NodeVector<Node, Index&> nodes2(owner, idx);
ASSERT_EQ(&idx, &nodes1.getIndex());
ASSERT_EQ(&idx, &nodes2.getIndex());
Node* n1 = new Node(mgr, "node1");
Node* n2 = new Node(mgr, "node2");
Node* n3 = new Node(mgr, "node3");
nodes1.push_back(n1);
nodes1.push_back(n2);
nodes2.push_back(n3);
ASSERT_EQ(n1, idx.resolve("node1"));
ASSERT_EQ(n2, idx.resolve("node2"));
ASSERT_EQ(n3, idx.resolve("node3"));
ASSERT_EQ(nullptr, idx.resolve("node4"));
}
}
}
|
