blob: 5e99fb1b195e794aafefed1138f597c62c7ba691 (
plain)
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
|
/****************************************************************************
**
** Copyright (C) 2001-2004 Roberto Raggi
** Copyright (C) 2012 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the qt3to4 porting application of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and Digia. For licensing terms and
** conditions see http://qt.digia.com/licensing. For further information
** use the contact form at http://qt.digia.com/contact-us.
**
** 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, Digia gives you certain additional
** rights. These rights are described in the Digia 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.
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef TOKENSTREAMADAPTER_H
#define TOKENSTREAMADAPTER_H
#include "tokenengine.h"
#include "tokens.h"
#include <QVector>
QT_BEGIN_NAMESPACE
namespace TokenStreamAdapter {
struct TokenStream
{
TokenStream(TokenEngine::TokenSectionSequence translationUnit, QVector<Type> tokenKindList)
:m_translationUnit(translationUnit),
m_tokenKindList(tokenKindList),
m_cursor(0),
m_numTokens(tokenKindList.count())
{
Q_ASSERT(translationUnit.count() == m_numTokens);
// Copy out the container and containerIndex for each token so we can have
// constant time random access to it.
TokenEngine::TokenSectionSequenceIterator it(translationUnit);
while(it.nextToken()) {
m_tokenContainers.append(it.tokenContainer());
m_containerIndices.append(it.containerIndex());
}
}
bool isHidden(int index) const
{
if(index >= m_numTokens)
return false;
QT_PREPEND_NAMESPACE(Type) type = m_tokenKindList.at(index);
return (type == Token_whitespaces || type == 10 /*newline*/ ||
type == Token_comment || type == Token_preproc );
}
inline int lookAhead(int n = 0) const
{
if(m_cursor + n >= m_numTokens)
return 0;
return m_tokenKindList.at(m_cursor + n);
}
inline int currentToken() const
{ return lookAhead(); }
inline QByteArray currentTokenText() const
{
return tokenText(m_cursor);
}
inline TokenEngine::TokenContainer tokenContainer(int index = 0) const
{
if (index < m_numTokens)
return m_tokenContainers.at(index);
else
return TokenEngine::TokenContainer();
}
inline int containerIndex(int index = 0) const
{
if (index < m_numTokens)
return m_containerIndices.at(index);
else
return -1;
}
inline QByteArray tokenText(int index = 0) const
{
if (index < m_numTokens) {
const TokenEngine::TokenContainer container = tokenContainer(index);
const int cIndex = containerIndex(index);
return container.text(cIndex);
} else {
return QByteArray();
}
}
inline void rewind(int index)
{ m_cursor = index; }
inline int cursor() const
{ return m_cursor; }
inline void nextToken()
{ ++m_cursor; }
inline bool tokenAtEnd()
{ return m_cursor >= m_numTokens; }
TokenEngine::TokenSectionSequence tokenSections() const
{ return m_translationUnit; }
private:
TokenEngine::TokenSectionSequence m_translationUnit;
QVector<Type> m_tokenKindList;
QList<TokenEngine::TokenContainer> m_tokenContainers;
QList<int> m_containerIndices;
int m_cursor;
int m_numTokens;
};
} //namespace TokenStreamAdapter
QT_END_NAMESPACE
#endif
|
