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
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
// SPDX-License-Identifier: GPL-2.0-or-later
/*
* Multiindex container for selection
*
* Authors:
* Adrian Boguszewski
*
* Copyright (C) 2016 Adrian Boguszewski
*
* Released under GNU GPL v2+, read the file 'COPYING' for more information.
*/
#include <gtest/gtest.h>
#include <src/object/sp-object.h>
#include <src/object/sp-item.h>
#include <src/xml/node.h>
#include <src/xml/text-node.h>
#include <doc-per-case-test.h>
#include <src/xml/simple-document.h>
using namespace Inkscape;
using namespace Inkscape::XML;
class SPObjectTest: public DocPerCaseTest {
public:
SPObjectTest() {
a = new SPItem();
b = new SPItem();
c = new SPItem();
d = new SPItem();
e = new SPItem();
auto sd = new SimpleDocument();
auto et = new TextNode(Util::share_string("e"), sd);
auto dt = new TextNode(Util::share_string("d"), sd);
auto ct = new TextNode(Util::share_string("c"), sd);
auto bt = new TextNode(Util::share_string("b"), sd);
auto at = new TextNode(Util::share_string("a"), sd);
e->invoke_build(_doc, et, 0);
d->invoke_build(_doc, dt, 0);
c->invoke_build(_doc, ct, 0);
b->invoke_build(_doc, bt, 0);
a->invoke_build(_doc, at, 0);
}
~SPObjectTest() override {
delete e;
delete d;
delete c;
delete b;
delete a;
}
SPObject* a;
SPObject* b;
SPObject* c;
SPObject* d;
SPObject* e;
};
TEST_F(SPObjectTest, Basics) {
a->attach(c, a->lastChild());
a->attach(b, nullptr);
a->attach(d, c);
EXPECT_TRUE(a->hasChildren());
EXPECT_EQ(b, a->firstChild());
EXPECT_EQ(d, a->lastChild());
auto children = a->childList(false);
EXPECT_EQ(3, children.size());
EXPECT_EQ(b, children[0]);
EXPECT_EQ(c, children[1]);
EXPECT_EQ(d, children[2]);
a->attach(b, a->lastChild());
EXPECT_EQ(3, a->children.size());
a->reorder(b, b);
EXPECT_EQ(3, a->children.size());
EXPECT_EQ(b, &a->children.front());
EXPECT_EQ(d, &a->children.back());
a->reorder(b, d);
EXPECT_EQ(3, a->children.size());
EXPECT_EQ(c, &a->children.front());
EXPECT_EQ(b, &a->children.back());
a->reorder(d, nullptr);
EXPECT_EQ(3, a->children.size());
EXPECT_EQ(d, &a->children.front());
EXPECT_EQ(b, &a->children.back());
a->reorder(c, b);
EXPECT_EQ(3, a->children.size());
EXPECT_EQ(d, &a->children.front());
EXPECT_EQ(c, &a->children.back());
a->detach(b);
EXPECT_EQ(c, a->lastChild());
children = a->childList(false);
EXPECT_EQ(2, children.size());
EXPECT_EQ(d, children[0]);
EXPECT_EQ(c, children[1]);
a->detach(b);
EXPECT_EQ(2, a->childList(false).size());
a->releaseReferences();
EXPECT_FALSE(a->hasChildren());
EXPECT_EQ(nullptr, a->firstChild());
EXPECT_EQ(nullptr, a->lastChild());
}
TEST_F(SPObjectTest, Advanced) {
a->attach(b, a->lastChild());
a->attach(c, a->lastChild());
a->attach(d, a->lastChild());
a->attach(e, a->lastChild());
EXPECT_EQ(e, a->get_child_by_repr(e->getRepr()));
EXPECT_EQ(c, a->get_child_by_repr(c->getRepr()));
EXPECT_EQ(d, e->getPrev());
EXPECT_EQ(c, d->getPrev());
EXPECT_EQ(b, c->getPrev());
EXPECT_EQ(nullptr, b->getPrev());
EXPECT_EQ(nullptr, e->getNext());
EXPECT_EQ(e, d->getNext());
EXPECT_EQ(d, c->getNext());
EXPECT_EQ(c, b->getNext());
std::vector<SPObject*> tmp = {b, c, d, e};
int index = 0;
for(auto& child: a->children) {
EXPECT_EQ(tmp[index++], &child);
}
}
|