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 (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the qt3to4 porting application of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the Technology Preview License Agreement accompanying
** this package.
**
** GNU Lesser General Public License Usage
** Alternatively, 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.
**
** If you have questions regarding the use of this file, please contact
** Nokia at qt-info@nokia.com.
**
**
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "replacetoken.h"
#include "tokenreplacements.h"
#include <QByteArray>
QT_BEGIN_NAMESPACE
/*
Add an entry to the tokenRuleLookup map for each token replacement rule.
*/
ReplaceToken::ReplaceToken(const QList<TokenReplacement*> &tokenReplacementRules)
:tokenReplacementRules(tokenReplacementRules)
{
foreach (TokenReplacement* rep, tokenReplacementRules) {
QByteArray key = rep->getReplaceKey();
if(!key.isEmpty()) {
tokenRuleLookup.insert(key, rep);
}
}
}
TextReplacements ReplaceToken::getTokenTextReplacements(const TokenEngine::TokenContainer &container)
{
TextReplacements textReplacements;
int t=0;
const int numTokens = container.count();
while(t < numTokens) {
QByteArray tokenText = container.text(t);
bool changed = false;
if(isPreprocessorDirective(tokenText)) {
foreach(TokenReplacement *tokenReplacementRule, tokenReplacementRules) {
if(!changed)
changed = tokenReplacementRule->doReplace(container, t, textReplacements);
if(changed)
break;
}
} else if (isInterestingToken(tokenText.trimmed())) {
foreach (TokenReplacement* value, tokenRuleLookup.values(tokenText)) {
changed = value->doReplace(container, t, textReplacements);
if(changed) {
goto end;
}
}
}
end:
++t;
}
return textReplacements;
}
bool ReplaceToken::isInterestingToken(const QByteArray &text)
{
return !(text.isEmpty() || text==";" || text=="(" || text==")" || text=="{" || text=="}" || text=="="
|| text=="+=" || text=="-=" || text=="if" || text=="then" || text=="else"
);
}
bool ReplaceToken::isPreprocessorDirective(const QByteArray &token)
{
return (token[0]=='#');
}
QT_END_NAMESPACE
|
