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
|
/****************************************************************************
**
** Copyright (C) 2014 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the tools applications 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 CODEGENERATOR_H
#define CODEGENERATOR_H
#include <QByteArray>
#include <QString>
#include <QList>
#include <QStack>
namespace CodeGenerator
{
enum GeneratorType {NoopType, CompoundType, TextType, RepeaterType, CounterType, GroupType};
class BaseGenerator;
typedef QStack<BaseGenerator *> GeneratorStack;
template <typename ValueType>
class Stacker {
public:
Stacker(QStack<ValueType> *stack, ValueType value) : stack(stack) { stack->push(value); }
~Stacker() { stack->pop();}
private:
QStack<ValueType> *stack;
};
typedef Stacker<BaseGenerator *> GeneratorStacker;
class BaseGenerator
{
public:
BaseGenerator(GeneratorType type = NoopType) : type(type) {}
virtual ~BaseGenerator() {};
virtual QByteArray generate(GeneratorStack *stack) { Q_UNUSED(stack); return QByteArray(); };
int currentCount(GeneratorStack *stack) const;
int repeatCount(GeneratorStack *stack) const;
GeneratorType type;
};
class Item
{
public:
Item(BaseGenerator * const base) : generator(base) {}
Item(const char * const text);
QByteArray generate() const
{ GeneratorStack stack; return generator->generate(&stack); }
// ### TODO: Fix memory leak!
// QExplicitlySharedDataPointer<BaseGenerator> generator;
BaseGenerator * const generator;
};
class CompoundGenerator : public BaseGenerator
{
public:
CompoundGenerator(BaseGenerator * const a, BaseGenerator * const b)
: BaseGenerator(CompoundType), a(a), b(b) {}
virtual QByteArray generate(GeneratorStack *stack)
{ return a->generate(stack) + b->generate(stack); };
protected:
BaseGenerator * const a;
BaseGenerator * const b;
};
class Compound : public Item
{
public:
Compound(const Item &a, const Item &b) : Item(new CompoundGenerator(a.generator, b.generator)) {}
};
class TextGenerator : public BaseGenerator
{
public:
TextGenerator(const QByteArray &text) : BaseGenerator(TextType), text(text) {}
virtual QByteArray generate(GeneratorStack *) { return text; };
protected:
QByteArray text;
};
class Text : public Item {
public:
Text(const QByteArray &text) : Item(new TextGenerator(text)) {}
Text(const char * const text) : Item(new TextGenerator(QByteArray(text))) {}
};
class RepeaterGenerator : public BaseGenerator
{
public:
RepeaterGenerator(BaseGenerator * const childGenerator)
: BaseGenerator(RepeaterType), repeatCount(1), repeatOffset(0), childGenerator(childGenerator) {}
virtual QByteArray generate(GeneratorStack *stack);
int repeatCount;
int repeatOffset;
int currentRepeat;
BaseGenerator * const childGenerator;
};
class Repeater : public Item {
public:
Repeater(const Item &item) : Item(new RepeaterGenerator(item.generator)) {}
void setRepeatCount(int count)
{ static_cast<RepeaterGenerator * const>(generator)->repeatCount = count; }
void setRepeatOffset(int offset)
{ static_cast<RepeaterGenerator * const>(generator)->repeatOffset = offset; }
};
class CounterGenerator : public BaseGenerator
{
public:
CounterGenerator() : BaseGenerator(CounterType), offset(0), increment(1), reverse(false) {}
QByteArray generate(GeneratorStack *stack)
{
if (reverse)
return QByteArray::number(repeatCount(stack) - (currentCount(stack) * increment) + offset + 1);
else
return QByteArray::number((currentCount(stack) * increment) + offset);
}
int offset;
int increment;
bool reverse;
};
class Counter : public Item {
public:
Counter() : Item(new CounterGenerator()) {}
Counter(int offset) : Item(new CounterGenerator()) { setOffset(offset); }
void setOffset(int offset)
{ static_cast<CounterGenerator *>(generator)->offset = offset; }
void setIncrement(int increment)
{ static_cast<CounterGenerator *>(generator)->increment = increment; }
void setReverse(bool reverse)
{ static_cast<CounterGenerator *>(generator)->reverse = reverse; }
};
class GroupGenerator : public BaseGenerator
{
public:
GroupGenerator(BaseGenerator * const childGenerator)
: BaseGenerator(GroupType), currentRepeat(0), childGenerator(childGenerator),
separator(new BaseGenerator()), prefix(new BaseGenerator()), postfix(new BaseGenerator()) { }
virtual QByteArray generate(GeneratorStack *stack);
int currentRepeat;
BaseGenerator * const childGenerator;
BaseGenerator *separator;
BaseGenerator *prefix;
BaseGenerator *postfix;
};
class Group : public Item
{
public:
Group(const Item &item) : Item(new GroupGenerator(item.generator)) { setSeparator(", "); }
void setSeparator(const Item &separator)
{ static_cast<GroupGenerator *>(generator)->separator = separator.generator; }
void setPrefix(const Item &prefix)
{ static_cast<GroupGenerator *>(generator)->prefix = prefix.generator; }
void setPostfix(const Item &postfix)
{ static_cast<GroupGenerator *>(generator)->postfix = postfix.generator; }
};
const Compound operator+(const Item &a, const Item &b);
const Compound operator+(const Item &a, const char * const text);
const Compound operator+(const char * const text, const Item &b);
} //namespace CodeGenerator
#endif
|
