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
|
/****************************************************************************
**
** Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the tools applications of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** Commercial Usage
** Licensees holding valid Qt Commercial licenses may use this file in
** accordance with the Qt Commercial License Agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and Nokia.
**
** 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.
**
** 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.
**
** If you have questions regarding the use of this file, please contact
** Nokia at qt-info@nokia.com.
** $QT_END_LICENSE$
**
****************************************************************************/
#include "codegenerator.h"
#include <qdebug.h>
namespace CodeGenerator
{
//Convenience constructor so you can say Item("foo")
Item::Item(const char * const text) : generator(Text(QByteArray(text)).generator) {}
int BaseGenerator::currentCount(GeneratorStack * const stack) const
{
const int stackSize = stack->count();
for (int i = stackSize - 1; i >= 0; --i) {
BaseGenerator const * const generator = stack->at(i);
switch (generator->type) {
case RepeaterType: {
RepeaterGenerator const * const repeater = static_cast<RepeaterGenerator const * const>(generator);
return repeater->currentRepeat;
} break;
case GroupType: {
GroupGenerator const * const group = static_cast<GroupGenerator const * const>(generator);
return group->currentRepeat;
} break;
default:
break;
}
}
return -1;
}
int BaseGenerator::repeatCount(GeneratorStack * const stack) const
{
const int stackSize = stack->count();
for (int i = stackSize - 1; i >= 0; --i) {
BaseGenerator const * const generator = stack->at(i);
switch (generator->type) {
case RepeaterType: {
RepeaterGenerator const * const repeater = static_cast<RepeaterGenerator const * const>(generator);
return repeater->currentRepeat;
} break;
/* case GroupType: {
GroupGenerator const * const group = static_cast<GroupGenerator const * const>(generator);
return group->currentRepeat;
} break;
*/
default:
break;
}
}
return -1;
}
QByteArray RepeaterGenerator::generate(GeneratorStack * const stack)
{
GeneratorStacker stacker(stack, this);
QByteArray generated;
for (int i = repeatOffset; i < repeatCount + repeatOffset; ++i) {
currentRepeat = i;
generated += childGenerator->generate(stack);
}
return generated;
};
QByteArray GroupGenerator::generate(GeneratorStack * const stack)
{
const int repeatCount = currentCount(stack);
GeneratorStacker stacker(stack, this);
QByteArray generated;
if (repeatCount > 0)
generated += prefix->generate(stack);
for (int i = 1; i <= repeatCount; ++i) {
currentRepeat = i;
generated += childGenerator->generate(stack);
if (i != repeatCount)
generated += separator->generate(stack);
}
if (repeatCount > 0)
generated += postfix->generate(stack);
return generated;
};
const Compound operator+(const Item &a, const Item &b)
{
return Compound(a, b);
}
const Compound operator+(const Item &a, const char * const text)
{
return Compound(a, Text(text));
}
const Compound operator+(const char * const text, const Item &b)
{
return Compound(Text(text), b);
}
}
|