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
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
|
/****************************************************************************
**
** Copyright (C) 2012 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the qt3to4 porting application of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** GNU Lesser General Public License Usage
** This file may be used under the terms of the GNU Lesser General Public
** License version 2.1 as published by the Free Software Foundation and
** appearing in the file LICENSE.LGPL included in the packaging of this
** file. Please review the following information to ensure the GNU Lesser
** General Public License version 2.1 requirements will be met:
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU General
** Public License version 3.0 as published by the Free Software Foundation
** and appearing in the file LICENSE.GPL included in the packaging of this
** file. Please review the following information to ensure the GNU General
** Public License version 3.0 requirements will be met:
** http://www.gnu.org/copyleft/gpl.html.
**
** Other Usage
** Alternatively, this file may be used in accordance with the terms and
** conditions contained in a signed written agreement between you and Nokia.
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "tokenengine.h"
QT_BEGIN_NAMESPACE
namespace TokenEngine {
/*
Add a container-global attribute.
*/
void TokenAttributes::addAttribute(const QByteArray &name, const QByteArray &value)
{
const QByteArray keyText = makeKeyText(-1, name);
attributes.insert(keyText, value);
}
/*
Retrieve container-global attribute.
*/
QByteArray TokenAttributes::attribute(const QByteArray &name) const
{
const QByteArray keyText = makeKeyText(-1, name);
return attributes.value(keyText);
}
/*
Add an attribute. Note: Don't use names starting with a number, that will
break the indexing.
*/
void TokenAttributes::addAttribute(const int index, const QByteArray &name, const QByteArray &value)
{
const QByteArray keyText = makeKeyText(index, name);
attributes.insert(keyText, value);
}
QByteArray TokenAttributes::attribute(const int index, const QByteArray &name) const
{
const QByteArray keyText = makeKeyText(index, name);
return attributes.value(keyText);
}
QByteArray TokenAttributes::makeKeyText(const int index, const QByteArray &name) const
{
QByteArray indexText;
return indexText.setNum(index) + name;
}
/*
Construnct an empty TokenContainer.
*/
TokenContainer::TokenContainer()
{
d = new TokenContainerData();
d->typeInfo = 0;
}
/*
Construnct a TokenContainer from data
*/
TokenContainer::TokenContainer(QByteArray text, QVector<Token> tokens, TypeInfo *typeInfo)
{
d = new TokenContainerData();
d->text = text;
d->tokens = tokens;
if(typeInfo == 0)
d->typeInfo = new TypeInfo();
else
d->typeInfo = typeInfo;
}
int TokenContainer::count() const
{
return d->tokens.count();
}
QByteArray TokenContainer::text(const int index) const
{
Token token = d->tokens.at(index);
return d->text.mid(token.start, token.length);
}
QByteArray TokenContainer::tempText(const int index) const
{
Token token = d->tokens.at(index);
return QByteArray::fromRawData(d->text.constData() + token.start, token.length);
}
QByteArray TokenContainer::fullText() const
{
return d->text;
}
TokenContainer TokenContainer::tokenContainer(const int index) const
{
Q_UNUSED(index);
return *this;
}
Token TokenContainer::token(const int index) const
{
return d->tokens.at(index);
}
TypeInfo *TokenContainer::typeInfo()
{
return d->typeInfo;
}
TokenAttributes *TokenContainer::tokenAttributes()
{
return d->tokenAttributes;
}
const TokenAttributes *TokenContainer::tokenAttributes() const
{
return d->tokenAttributes;
}
/*
Returns the line number for the given index.
*/
int TokenContainer::line(int index) const
{
//This algorithm is a bit more complicated than it should be,
//since we have to search for newlines inside comments.
//(Comments are tokenized as one token)
QByteArray contents = fullText();
int pos=0;
int lines=0;
for(int t=0; t < index; ++t) {
int tokenLength = d->tokens.at(t).length;
if((tokenLength == 1) && (text(t) == "\n")) {
++lines;
} else if(tokenLength > 2) {// 3 is the minimum size for a comment (// + newline)
int newpos = d->tokens.at(t).length;
for(int p = pos; p < newpos; ++p) {
if(contents[p] == '\n')
++lines;
}
}
pos += d->tokens.at(t).length;
}
return lines;
}
/*
Returns the column number for the given index.
*/
int TokenContainer::column(int index) const
{
//Scan backwards, find \n.
int chars = 0;
int t = index;
while (t>0) {
if((d->tokens.at(t).length == 1) && (text(t) == "\n"))
break;
chars += d->tokens.at(t).length;
--t;
}
return chars;
}
TokenTempRef TokenContainer::tokenTempRef(const int index) const
{
Q_ASSERT(index < d->tokens.count());
const Token token = d->tokens.at(index);
return TokenTempRef(d->text.constData() + token.start, token.length);
}
QByteArray TokenSection::fullText() const
{
QByteArray text;
for (int t = m_start; t < m_start + m_count; ++t) {
text += m_tokenContainer.text(t);
}
return text;
}
QByteArray TokenList::fullText() const
{
QByteArray text;
for (int t = 0; t < m_tokenList.count(); ++t) {
text += m_tokenContainer.text(m_tokenList.at(t));
}
return text;
}
TokenSectionSequence::TokenSectionSequence(QVector<TokenSection> tokenSections)
:m_tokenSections(tokenSections), m_count(0)
{
for(int s = 0; s < m_tokenSections.count(); ++s) {
m_startIndexes.append(m_count);
m_count += m_tokenSections.at(s).count();
}
}
QByteArray TokenSectionSequence::fullText() const
{
QByteArray text;
foreach(TokenSection section, m_tokenSections) {
text += section.fullText();
}
return text;
}
int TokenSectionSequence::count() const
{
return m_count;
}
QVector<TokenSection> TokenSectionSequence::tokenSections() const
{
return m_tokenSections;
}
QByteArray TokenSectionSequence::text(const int index) const
{
const int sectionIndex = findSection(index);
const int sectionInternalIndex = calculateInternalIndex(index, sectionIndex);
return m_tokenSections.at(sectionIndex).text(sectionInternalIndex);
}
QByteArray TokenSectionSequence::tempText(const int index) const
{
const int sectionIndex = findSection(index);
const int sectionInternalIndex = calculateInternalIndex(index, sectionIndex);
return m_tokenSections.at(sectionIndex).tempText(sectionInternalIndex);
}
TokenContainer TokenSectionSequence::tokenContainer(const int index) const
{
const int sectionIndex = findSection(index);
const int sectionInternalIndex = calculateInternalIndex(index, sectionIndex);
return m_tokenSections.at(sectionIndex).tokenContainer(sectionInternalIndex);
}
int TokenSectionSequence::containerIndex(const int index) const
{
const int sectionIndex = findSection(index);
const int sectionInternalIndex = calculateInternalIndex(index, sectionIndex);
return m_tokenSections.at(sectionIndex).containerIndex(sectionInternalIndex);
}
int TokenSectionSequence::findSection(const int index) const
{
int c = 0;
bool found = false;
//Here we do a linear search through all collections in the list,
//which could turn out to be to slow.
while(!found && c < m_tokenSections.count()) {
const int sectionEnd = m_startIndexes.at(c)
+ m_tokenSections.at(c).count();
if (index < sectionEnd)
found = true;
else
++c;
}
if(!found) {
//error
Q_ASSERT(0);
return -1;
}
Q_ASSERT(c < m_tokenSections.count());
return c;
}
int TokenSectionSequence::calculateInternalIndex(const int index, const int sectionIndex) const
{
const int sectionInternalIndex =
index - m_startIndexes.at(sectionIndex);
Q_ASSERT(sectionInternalIndex < m_tokenSections.at(sectionIndex).count());
return sectionInternalIndex;
}
TokenSectionSequenceIterator::TokenSectionSequenceIterator(const TokenSectionSequence &tokenSectionSequence)
:m_currentSection(0)
,m_currentToken(-1)
,m_numSections(tokenSectionSequence.m_tokenSections.count())
,m_tokenSectionSequence(tokenSectionSequence)
{ }
/*
Resets the token iterator.
*/
void TokenSectionSequenceIterator::reset()
{
m_currentSection = 0;
m_currentToken = -1;
}
/*
Advances the token iterator.
*/
bool TokenSectionSequenceIterator::nextToken()
{
if(m_tokenSectionSequence.m_tokenSections.isEmpty())
return false;
++m_currentToken;
//check of we are past the end of the current section
if(m_currentToken < m_tokenSectionSequence.m_tokenSections.at(m_currentSection).count())
return true;
//Advance to the next non-empty section.
m_currentToken = 0;
do {
++m_currentSection;
//return false if no more sections
if(m_currentSection >= m_numSections)
return false;
//skip empty sections
} while(m_tokenSectionSequence.m_tokenSections.at(m_currentSection).count() == 0);
return true;
}
/*
Returns the text for the current token;
*/
QByteArray TokenSectionSequenceIterator::text() const
{
return m_tokenSectionSequence.m_tokenSections.at(m_currentSection).text(m_currentToken);
}
/*
Returns the text for the current token as a temporary QByteArray;
*/
QByteArray TokenSectionSequenceIterator::tempText() const
{
return m_tokenSectionSequence.m_tokenSections.at(m_currentSection).tempText(m_currentToken);
}
/*
Returns the container for the current token;
*/
TokenContainer TokenSectionSequenceIterator::tokenContainer() const
{
return m_tokenSectionSequence.m_tokenSections.at(m_currentSection).tokenContainer(m_currentToken);
}
/*
Returns the containerIndex for the current token;
*/
int TokenSectionSequenceIterator::containerIndex() const
{
return m_tokenSectionSequence.m_tokenSections.at(m_currentSection).containerIndex(m_currentToken);
}
/*
Returns a temporary token reference for the current token for the current token;
*/
TokenTempRef TokenSectionSequenceIterator::tokenTempRef() const
{
return m_tokenSectionSequence.m_tokenSections.at(m_currentSection).tokenTempRef(m_currentToken);
}
} //namespace TokenEngine
QT_END_NAMESPACE
|