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
|
/*
Copyright 2007 David Nolden <david.nolden.kdevelop@art-master.de>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License version 2 as published by the Free Software Foundation.
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
Library General Public License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
*/
#include "codecompletioncontext.h"
#include <debug.h>
#include <util/pushvalue.h>
#include <language/duchain/ducontext.h>
using namespace KDevelop;
using IntPusher = PushValue<int>;
///Extracts the last line from the given string
QString CodeCompletionContext::extractLastLine(const QString& str)
{
int prevLineEnd = str.lastIndexOf(QLatin1Char('\n'));
if (prevLineEnd != -1)
return str.mid(prevLineEnd + 1);
else
return str;
}
int completionRecursionDepth = 0;
CodeCompletionContext::CodeCompletionContext(const DUContextPointer& context, const QString& text,
const KDevelop::CursorInRevision& position, int depth)
: m_text(text)
, m_depth(depth)
, m_valid(true)
, m_position(position)
, m_duContext(context)
, m_parentContext(nullptr)
{
IntPusher(completionRecursionDepth, completionRecursionDepth + 1);
if (depth > 10) {
qCWarning(LANGUAGE) << "too much recursion";
m_valid = false;
return;
}
if (completionRecursionDepth > 10) {
qCWarning(LANGUAGE) << "too much recursion";
m_valid = false;
return;
}
}
CodeCompletionContext::~CodeCompletionContext()
{
}
int CodeCompletionContext::depth() const
{
return m_depth;
}
bool CodeCompletionContext::isValid() const
{
return m_valid;
}
void KDevelop::CodeCompletionContext::setParentContext(
QExplicitlySharedDataPointer<KDevelop::CodeCompletionContext> newParent)
{
m_parentContext = newParent;
int newDepth = m_depth + 1;
while (newParent) {
newParent->m_depth = newDepth;
++newDepth;
newParent = newParent->m_parentContext;
}
}
CodeCompletionContext* CodeCompletionContext::parentContext()
{
return m_parentContext.data();
}
QList<QExplicitlySharedDataPointer<KDevelop::CompletionTreeElement>> KDevelop::CodeCompletionContext::ungroupedElements()
{
return QList<QExplicitlySharedDataPointer<KDevelop::CompletionTreeElement>>();
}
KDevelop::DUContext* KDevelop::CodeCompletionContext::duContext() const
{
return m_duContext.data();
}
|
