1 /***************************************************************************
3 * Open \______ \ ____ ____ | | _\_ |__ _______ ___
4 * Source | _// _ \_/ ___\| |/ /| __ \ / _ \ \/ /
5 * Jukebox | | ( <_> ) \___| < | \_\ ( <_> > < <
6 * Firmware |____|_ /\____/ \___ >__|_ \|___ /\____/__/\_ \
10 * Copyright (C) 2010 Robert Bieber
12 * This program is free software; you can redistribute it and/or
13 * modify it under the terms of the GNU General Public License
14 * as published by the Free Software Foundation; either version 2
15 * of the License, or (at your option) any later version.
17 * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
18 * KIND, either express or implied.
20 ****************************************************************************/
23 #include "tag_table.h"
25 #include "parsetreenode.h"
26 #include "parsetreemodel.h"
28 /* Root element constructor */
29 ParseTreeNode::ParseTreeNode(struct skin_element
* data
)
30 : parent(0), element(0), param(0), children()
34 children
.append(new ParseTreeNode(data
, this));
39 /* Normal element constructor */
40 ParseTreeNode::ParseTreeNode(struct skin_element
* data
, ParseTreeNode
* parent
)
41 : parent(parent
), element(data
), param(0), children()
47 for(int i
= 0; i
< element
->params_count
; i
++)
49 if(element
->params
[i
].type
== skin_tag_parameter::CODE
)
50 children
.append(new ParseTreeNode(element
->params
[i
].data
.code
,
53 children
.append(new ParseTreeNode(&element
->params
[i
], this));
57 /* CONDITIONAL and SUBLINES fall through to the same code */
60 for(int i
= 0; i
< element
->children_count
; i
++)
62 children
.append(new ParseTreeNode(data
->children
[i
], this));
68 for(int i
= 0; i
< data
->children_count
; i
++)
70 for(struct skin_element
* current
= data
->children
[i
]; current
;
71 current
= current
->next
)
73 children
.append(new ParseTreeNode(current
, this));
83 /* Parameter constructor */
84 ParseTreeNode::ParseTreeNode(skin_tag_parameter
*data
, ParseTreeNode
*parent
)
85 : parent(parent
), element(0), param(data
), children()
90 QString
ParseTreeNode::genCode() const
101 for(int i
= 0; i
< children
.count(); i
++)
104 Adding a % in case of tag, because the tag rendering code
105 doesn't insert its own
107 if(children
[i
]->element
->type
== TAG
)
108 buffer
.append(TAGSYM
);
109 buffer
.append(children
[i
]->genCode());
114 for(int i
= 0; i
< children
.count(); i
++)
116 buffer
.append(children
[i
]->genCode());
117 if(i
!= children
.count() - 1)
118 buffer
.append(MULTILINESYM
);
123 /* Inserts a %?, the tag renderer doesn't deal with the TAGSYM */
124 buffer
.append(TAGSYM
);
125 buffer
.append(CONDITIONSYM
);
126 buffer
.append(children
[0]->genCode());
128 /* Inserting the sublines */
129 buffer
.append(ENUMLISTOPENSYM
);
130 for(int i
= 1; i
< children
.count(); i
++)
132 buffer
.append(children
[i
]->genCode());
133 if(i
!= children
.count() - 1)
134 buffer
.append(ENUMLISTSEPERATESYM
);
136 buffer
.append(ENUMLISTCLOSESYM
);
140 /* When generating code, we DO NOT insert the leading TAGSYM, leave
141 * the calling functions to handle that
143 buffer
.append(element
->tag
->name
);
145 if(element
->params_count
> 0)
147 /* Rendering parameters if there are any */
148 buffer
.append(ARGLISTOPENSYM
);
149 for(int i
= 0; i
< children
.count(); i
++)
151 buffer
.append(children
[i
]->genCode());
152 if(i
!= children
.count() - 1)
153 buffer
.append(ARGLISTSEPERATESYM
);
155 buffer
.append(ARGLISTCLOSESYM
);
164 for(char* cursor
= element
->text
; *cursor
; cursor
++)
166 if(find_escape_character(*cursor
))
167 buffer
.append(TAGSYM
);
168 buffer
.append(*cursor
);
173 buffer
.append(COMMENTSYM
);
174 buffer
.append(element
->text
);
183 case skin_tag_parameter::STRING
:
184 for(char* cursor
= param
->data
.text
; *cursor
; cursor
++)
186 if(find_escape_character(*cursor
))
187 buffer
.append(TAGSYM
);
188 buffer
.append(*cursor
);
192 case skin_tag_parameter::NUMERIC
:
193 buffer
.append(QString::number(param
->data
.numeric
, 10));
196 case skin_tag_parameter::DEFAULT
:
197 buffer
.append(DEFAULTSYM
);
200 case skin_tag_parameter::CODE
:
201 buffer
.append(QObject::tr("This doesn't belong here"));
208 for(int i
= 0; i
< children
.count(); i
++)
209 buffer
.append(children
[i
]->genCode());
215 ParseTreeNode
* ParseTreeNode::child(int row
)
217 if(row
< 0 || row
>= children
.count())
220 return children
[row
];
223 int ParseTreeNode::numChildren() const
225 return children
.count();
229 QVariant
ParseTreeNode::data(int column
) const
233 case ParseTreeModel::typeColumn
:
236 switch(element
->type
)
239 return QObject::tr("Viewport");
242 return QObject::tr("Logical Line");
245 return QObject::tr("Alternator");
248 return QObject::tr("Comment");
251 return QObject::tr("Conditional Tag");
254 return QObject::tr("Tag");
257 return QObject::tr("Newline");
260 return QObject::tr("Plaintext");
267 case skin_tag_parameter::STRING
:
268 return QObject::tr("String");
270 case skin_tag_parameter::NUMERIC
:
271 return QObject::tr("Number");
273 case skin_tag_parameter::DEFAULT
:
274 return QObject::tr("Default Argument");
276 case skin_tag_parameter::CODE
:
277 return QObject::tr("This doesn't belong here");
282 return QObject::tr("Root");
287 case ParseTreeModel::valueColumn
:
290 switch(element
->type
)
299 return QObject::tr("\\n");
303 return QString(element
->text
);
306 return QString(element
->tag
->name
);
313 case skin_tag_parameter::DEFAULT
:
314 return QObject::tr("-");
316 case skin_tag_parameter::STRING
:
317 return QString(param
->data
.text
);
319 case skin_tag_parameter::NUMERIC
:
320 return QString::number(param
->data
.numeric
, 10);
322 case skin_tag_parameter::CODE
:
323 return QObject::tr("Seriously, something's wrong here");
332 case ParseTreeModel::lineColumn
:
334 return QString::number(element
->line
, 10);
344 int ParseTreeNode::getRow() const
349 return parent
->children
.indexOf(const_cast<ParseTreeNode
*>(this));
352 ParseTreeNode
* ParseTreeNode::getParent() const
357 ParseTreeNode::~ParseTreeNode()
359 for(int i
= 0; i
< children
.count(); i
++)