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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
|
/*
* KDevelop outline view
* Copyright 2010, 2015 Alex Richardson <alex.richardson@gmx.de>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#pragma once
#include <QString>
#include <QIcon>
#include <memory>
#include <language/duchain/duchain.h>
#include <language/duchain/duchainbase.h>
#include <language/duchain/duchainlock.h>
#include <language/duchain/duchainpointer.h>
namespace KDevelop {
class Declaration;
class DUContext;
}
class OutlineNode
{
Q_DISABLE_COPY(OutlineNode)
void appendContext(KDevelop::DUContext* ctx, KDevelop::TopDUContext* top);
void sortByLocation(bool requiresSorting);
public:
OutlineNode(const QString& text, OutlineNode* parent);
OutlineNode(OutlineNode&& other) Q_DECL_NOEXCEPT;
OutlineNode& operator=(OutlineNode&& other) Q_DECL_NOEXCEPT;
OutlineNode(KDevelop::Declaration* decl, OutlineNode* parent);
OutlineNode(KDevelop::DUContext* ctx, const QString& name, OutlineNode* parent);
virtual ~OutlineNode();
QIcon icon() const;
QString text() const;
const OutlineNode* parent() const;
const std::vector<OutlineNode>& children() const;
int childCount() const;
const OutlineNode* childAt(int index) const;
int indexOf(const OutlineNode* child) const;
static std::unique_ptr<OutlineNode> fromTopContext(KDevelop::TopDUContext* ctx);
static std::unique_ptr<OutlineNode> dummyNode();
KDevelop::DUChainBase* duChainObject() const;
friend void swap(OutlineNode& n1, OutlineNode& n2);
private:
QString m_cachedText;
QIcon m_cachedIcon;
KDevelop::DUChainBasePointer m_declOrContext;
OutlineNode* m_parent;
std::vector<OutlineNode> m_children;
};
inline int OutlineNode::childCount() const
{
return m_children.size();
}
inline const std::vector<OutlineNode>& OutlineNode::children() const
{
return m_children;
}
inline const OutlineNode* OutlineNode::childAt(int index) const
{
return &m_children.at(index);
}
inline const OutlineNode* OutlineNode::parent() const
{
return m_parent;
}
inline int OutlineNode::indexOf(const OutlineNode* child) const
{
const auto max = m_children.size();
// Comparing the address here is only fine since we never modify the vector after initial creation
for (size_t i = 0; i < max; i++) {
if (child == &m_children[i]) {
return i;
}
}
return -1;
}
inline QIcon OutlineNode::icon() const
{
return m_cachedIcon;
}
inline QString OutlineNode::text() const
{
return m_cachedText;
}
inline KDevelop::DUChainBase* OutlineNode::duChainObject() const
{
ENSURE_CHAIN_READ_LOCKED
return m_declOrContext.data();
}
inline OutlineNode::OutlineNode(OutlineNode&& other) Q_DECL_NOEXCEPT
: m_cachedText(std::move(other.m_cachedText))
, m_cachedIcon(std::move(other.m_cachedIcon))
, m_declOrContext(std::move(other.m_declOrContext))
, m_parent(std::move(other.m_parent))
, m_children(std::move(other.m_children))
{
// qDebug("Move ctor %p -> %p", &other, this);
other.m_parent = nullptr;
other.m_declOrContext = nullptr;
for (OutlineNode& child : m_children) {
// when we are moved the parent pointer has to be updated for the children!
child.m_parent = this;
}
}
inline OutlineNode& OutlineNode::operator=(OutlineNode&& other) Q_DECL_NOEXCEPT
{
if (this == &other) {
return *this;
}
m_cachedText = std::move(other.m_cachedText);
m_cachedIcon = std::move(other.m_cachedIcon);
m_declOrContext = std::move(other.m_declOrContext);
m_parent = std::move(other.m_parent);
m_children = std::move(other.m_children);
// qDebug("Move assignment %p -> %p", &other, this);
other.m_parent = nullptr;
other.m_declOrContext = nullptr;
for (OutlineNode& child : m_children) {
// when we are moved the parent pointer has to be updated for the children!
child.m_parent = this;
}
return *this;
}
inline void swap(OutlineNode& n1, OutlineNode& n2)
{
// For some reason std::sort only sometimes calls swap and mostly uses move ctor + assign.
// Probably it uses different algorithms for different sequence sizes
// qDebug("Swapping %p and %p", &n1, &n2);
std::swap(n1.m_cachedText, n2.m_cachedText);
std::swap(n1.m_cachedIcon, n2.m_cachedIcon);
std::swap(n1.m_declOrContext, n2.m_declOrContext);
std::swap(n1.m_parent, n2.m_parent);
std::swap(n1.m_children, n2.m_children);
}
|
