author | Eckhart Koeppen <eckhart.koppen@nokia.com> |
Wed, 21 Apr 2010 12:15:23 +0300 | |
branch | RCL_3 |
changeset 12 | cc75c76972ee |
parent 4 | 3b1da2848fc7 |
permissions | -rw-r--r-- |
0 | 1 |
/**************************************************************************** |
2 |
** |
|
4
3b1da2848fc7
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
3 |
** Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies). |
0 | 4 |
** All rights reserved. |
5 |
** Contact: Nokia Corporation (qt-info@nokia.com) |
|
6 |
** |
|
7 |
** This file is part of the tools applications of the Qt Toolkit. |
|
8 |
** |
|
9 |
** $QT_BEGIN_LICENSE:LGPL$ |
|
10 |
** No Commercial Usage |
|
11 |
** This file contains pre-release code and may not be distributed. |
|
12 |
** You may use this file in accordance with the terms and conditions |
|
13 |
** contained in the Technology Preview License Agreement accompanying |
|
14 |
** this package. |
|
15 |
** |
|
16 |
** GNU Lesser General Public License Usage |
|
17 |
** Alternatively, this file may be used under the terms of the GNU Lesser |
|
18 |
** General Public License version 2.1 as published by the Free Software |
|
19 |
** Foundation and appearing in the file LICENSE.LGPL included in the |
|
20 |
** packaging of this file. Please review the following information to |
|
21 |
** ensure the GNU Lesser General Public License version 2.1 requirements |
|
22 |
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. |
|
23 |
** |
|
24 |
** In addition, as a special exception, Nokia gives you certain additional |
|
25 |
** rights. These rights are described in the Nokia Qt LGPL Exception |
|
26 |
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. |
|
27 |
** |
|
28 |
** If you have questions regarding the use of this file, please contact |
|
29 |
** Nokia at qt-info@nokia.com. |
|
30 |
** |
|
31 |
** |
|
32 |
** |
|
33 |
** |
|
34 |
** |
|
35 |
** |
|
36 |
** |
|
37 |
** |
|
38 |
** $QT_END_LICENSE$ |
|
39 |
** |
|
40 |
****************************************************************************/ |
|
41 |
||
42 |
/* |
|
43 |
qscodemarker.cpp |
|
44 |
*/ |
|
45 |
||
46 |
#include "node.h" |
|
47 |
#include "qscodemarker.h" |
|
48 |
||
49 |
QT_BEGIN_NAMESPACE |
|
50 |
||
51 |
QsCodeMarker::QsCodeMarker() |
|
52 |
{ |
|
53 |
} |
|
54 |
||
55 |
QsCodeMarker::~QsCodeMarker() |
|
56 |
{ |
|
57 |
} |
|
58 |
||
59 |
bool QsCodeMarker::recognizeCode( const QString& /* code */ ) |
|
60 |
{ |
|
61 |
return true; |
|
62 |
} |
|
63 |
||
64 |
bool QsCodeMarker::recognizeExtension( const QString& ext ) |
|
65 |
{ |
|
66 |
return ext == "js" || ext == "qs"; |
|
67 |
} |
|
68 |
||
69 |
bool QsCodeMarker::recognizeLanguage( const QString& lang ) |
|
70 |
{ |
|
71 |
return lang == "JavaScript" || lang == "Qt Script"; |
|
72 |
} |
|
73 |
||
74 |
QString QsCodeMarker::plainName( const Node *node ) |
|
75 |
{ |
|
76 |
QString name = node->name(); |
|
77 |
if ( node->type() == Node::Function ) |
|
78 |
name += "()"; |
|
79 |
return name; |
|
80 |
} |
|
81 |
||
82 |
QString QsCodeMarker::plainFullName( const Node *node, const Node * /* relative */ ) |
|
83 |
{ |
|
84 |
QString fullName; |
|
85 |
for ( ;; ) { |
|
86 |
fullName.prepend( plainName(node) ); |
|
87 |
if ( node->parent()->name().isEmpty() ) |
|
88 |
break; |
|
89 |
node = node->parent(); |
|
90 |
fullName.prepend("."); |
|
91 |
} |
|
92 |
return fullName; |
|
93 |
} |
|
94 |
||
95 |
QString QsCodeMarker::markedUpCode( const QString& code, |
|
96 |
const Node * /* relative */, |
|
97 |
const QString& /* dirPath */ ) |
|
98 |
{ |
|
99 |
return protect( code ); |
|
100 |
} |
|
101 |
||
102 |
QString QsCodeMarker::markedUpSynopsis( const Node *node, |
|
103 |
const Node * /* relative */, |
|
104 |
SynopsisStyle style ) |
|
105 |
{ |
|
106 |
QString synopsis; |
|
107 |
QStringList extras; |
|
108 |
QString name; |
|
109 |
||
110 |
name = taggedNode( node ); |
|
111 |
if ( style != Detailed ) |
|
112 |
name = linkTag( node, name ); |
|
113 |
name = "<@name>" + name + "</@name>"; |
|
114 |
||
115 |
if ( style == Detailed && !node->parent()->name().isEmpty() && |
|
116 |
node->type() != Node::Enum ) |
|
117 |
name.prepend( taggedNode(node->parent()) + "." ); |
|
118 |
||
119 |
switch ( node->type() ) { |
|
120 |
case Node::Class: |
|
121 |
synopsis = "class " + name; |
|
122 |
break; |
|
123 |
case Node::Function: |
|
124 |
{ |
|
125 |
const FunctionNode *func = (const FunctionNode *) node; |
|
126 |
||
127 |
synopsis = name; |
|
128 |
||
129 |
if ( style == SeparateList ) { |
|
130 |
synopsis += "()"; |
|
131 |
} else { |
|
132 |
synopsis += " ("; |
|
133 |
if ( !func->parameters().isEmpty() ) { |
|
134 |
synopsis += " "; |
|
135 |
int numOptional = 0; |
|
136 |
QList<Parameter>::ConstIterator p = func->parameters().begin(); |
|
137 |
while ( p != func->parameters().end() ) { |
|
138 |
if ( !(*p).defaultValue().isEmpty() ) { |
|
139 |
if ( p == func->parameters().begin() ) { |
|
140 |
synopsis += "[ "; |
|
141 |
} else { |
|
142 |
synopsis += " [ , "; |
|
143 |
} |
|
144 |
numOptional++; |
|
145 |
} else { |
|
146 |
if ( p != func->parameters().begin() ) |
|
147 |
synopsis += ", "; |
|
148 |
} |
|
149 |
if ( !(*p).name().isEmpty() ) |
|
150 |
synopsis += "<@param>" + protect( (*p).name() ) + |
|
151 |
"</@param> : "; |
|
152 |
synopsis += protect( (*p).leftType() ); |
|
153 |
++p; |
|
154 |
} |
|
155 |
for ( int i = 0; i < numOptional; i++ ) |
|
156 |
synopsis += " ]"; |
|
157 |
synopsis += " "; |
|
158 |
} |
|
159 |
synopsis += ")"; |
|
160 |
} |
|
161 |
||
162 |
if ( style != SeparateList && !func->returnType().isEmpty() ) |
|
163 |
synopsis += " : " + protect( func->returnType() ); |
|
164 |
||
165 |
if ( style == Detailed && func->metaness() == FunctionNode::Signal ) |
|
166 |
extras << "[signal]"; |
|
167 |
} |
|
168 |
break; |
|
169 |
case Node::Property: |
|
170 |
{ |
|
171 |
const PropertyNode *property = (const PropertyNode *) node; |
|
172 |
||
173 |
synopsis = name; |
|
174 |
if ( style != SeparateList ) |
|
175 |
synopsis += " : " + property->dataType(); |
|
176 |
if ( style == Detailed && property->setters().isEmpty() ) |
|
177 |
extras << "[read only]"; |
|
178 |
} |
|
179 |
break; |
|
180 |
case Node::Enum: |
|
181 |
{ |
|
182 |
/* |
|
183 |
The letters A to F and X (upper- and lower-case) can |
|
184 |
appear in a hexadecimal constant (e.g. 0x3F). |
|
185 |
*/ |
|
186 |
QRegExp letterRegExp( "[G-WYZg-wyz_]" ); |
|
187 |
const EnumNode *enume = (const EnumNode *) node; |
|
188 |
||
189 |
synopsis = name; |
|
190 |
if ( style == Summary && !enume->items().isEmpty() ) { |
|
191 |
synopsis += " : "; |
|
192 |
QString comma; |
|
193 |
QList<EnumItem>::ConstIterator it = enume->items().begin(); |
|
194 |
while ( it != enume->items().end() ) { |
|
195 |
if ( enume->itemAccess((*it).name()) == Node::Public ) { |
|
196 |
synopsis += comma; |
|
197 |
synopsis += (*it).name(); |
|
198 |
if ( (*it).value().indexOf(letterRegExp) != -1 ) |
|
199 |
synopsis += " = " + (*it).value(); |
|
200 |
comma = ", "; |
|
201 |
} |
|
202 |
++it; |
|
203 |
} |
|
204 |
} |
|
205 |
} |
|
206 |
break; |
|
207 |
case Node::Namespace: |
|
208 |
case Node::Typedef: |
|
209 |
default: |
|
210 |
synopsis = name; |
|
211 |
} |
|
212 |
||
213 |
if ( style == Summary ) { |
|
214 |
if ( node->status() == Node::Preliminary ) { |
|
215 |
extras << "(preliminary)"; |
|
216 |
} else if ( node->status() == Node::Deprecated ) { |
|
217 |
extras << "(deprecated)"; |
|
218 |
} else if ( node->status() == Node::Obsolete ) { |
|
219 |
extras << "(obsolete)"; |
|
220 |
} |
|
221 |
} |
|
222 |
||
223 |
QString extra; |
|
224 |
if ( !extras.isEmpty() ) |
|
225 |
extra = "<@extra>" + extras.join(" ") + "</@extra>"; |
|
226 |
return synopsis + extra; |
|
227 |
} |
|
228 |
||
229 |
QString QsCodeMarker::markedUpName( const Node *node ) |
|
230 |
{ |
|
231 |
QString name = linkTag( node, taggedNode(node) ); |
|
232 |
if ( node->type() == Node::Function ) |
|
233 |
name += "()"; |
|
234 |
return name; |
|
235 |
} |
|
236 |
||
237 |
QString QsCodeMarker::markedUpFullName( const Node *node, |
|
238 |
const Node * /* relative */ ) |
|
239 |
{ |
|
240 |
QString fullName; |
|
241 |
for ( ;; ) { |
|
242 |
fullName.prepend( markedUpName(node) ); |
|
243 |
if ( node->parent()->name().isEmpty() ) |
|
244 |
break; |
|
245 |
node = node->parent(); |
|
246 |
fullName.prepend( "<@op>.</@op>" ); |
|
247 |
} |
|
248 |
return fullName; |
|
249 |
} |
|
250 |
||
251 |
QString QsCodeMarker::markedUpEnumValue(const QString & /* enumValue */, |
|
252 |
const Node * /* relative */) |
|
253 |
{ |
|
254 |
return QString(); |
|
255 |
} |
|
256 |
||
257 |
QString QsCodeMarker::markedUpIncludes( const QStringList& /* includes */ ) |
|
258 |
{ |
|
259 |
return QString(); |
|
260 |
} |
|
261 |
||
262 |
QString QsCodeMarker::functionBeginRegExp( const QString& funcName ) |
|
263 |
{ |
|
264 |
return "^function[ \t].*\\b" + QRegExp::escape( funcName ); |
|
265 |
} |
|
266 |
||
267 |
QString QsCodeMarker::functionEndRegExp( const QString& /* funcName */ ) |
|
268 |
{ |
|
269 |
return "^}"; |
|
270 |
} |
|
271 |
||
272 |
QList<Section> QsCodeMarker::sections( const InnerNode *inner, SynopsisStyle style, Status status ) |
|
273 |
{ |
|
274 |
QList<Section> sections; |
|
275 |
||
276 |
if (inner->type() != Node::Class) |
|
277 |
return sections; |
|
278 |
||
279 |
const ClassNode *classe = static_cast<const ClassNode *>(inner); |
|
280 |
||
281 |
if ( style == Summary ) { |
|
282 |
FastSection enums(classe, "Enums", "enum", "enums"); |
|
283 |
FastSection functions(classe, "Functions", "function", "functions"); |
|
284 |
FastSection readOnlyProperties(classe, "Read-Only Properties", "property", "properties"); |
|
285 |
FastSection signalz(classe, "Signals", "signal", "signals"); |
|
286 |
FastSection writableProperties(classe, "Writable Properties", "property", "properties"); |
|
287 |
||
288 |
QStack<const ClassNode *> stack; |
|
289 |
stack.push( classe ); |
|
290 |
||
291 |
while ( !stack.isEmpty() ) { |
|
292 |
const ClassNode *ancestorClass = stack.pop(); |
|
293 |
||
294 |
NodeList::ConstIterator c = ancestorClass->childNodes().begin(); |
|
295 |
while ( c != ancestorClass->childNodes().end() ) { |
|
296 |
if ( (*c)->access() == Node::Public ) { |
|
297 |
if ( (*c)->type() == Node::Enum ) { |
|
298 |
insert( enums, *c, style, status ); |
|
299 |
} else if ( (*c)->type() == Node::Function ) { |
|
300 |
const FunctionNode *func = (const FunctionNode *) *c; |
|
301 |
if ( func->metaness() == FunctionNode::Signal ) { |
|
302 |
insert( signalz, *c, style, status ); |
|
303 |
} else { |
|
304 |
insert( functions, *c, style, status ); |
|
305 |
} |
|
306 |
} else if ( (*c)->type() == Node::Property ) { |
|
307 |
const PropertyNode *property = |
|
308 |
(const PropertyNode *) *c; |
|
309 |
if ( property->setters().isEmpty() ) { |
|
310 |
insert( readOnlyProperties, *c, style, status ); |
|
311 |
} else { |
|
312 |
insert( writableProperties, *c, style, status ); |
|
313 |
} |
|
314 |
} |
|
315 |
} |
|
316 |
++c; |
|
317 |
} |
|
318 |
||
319 |
QList<RelatedClass>::ConstIterator r = ancestorClass->baseClasses().begin(); |
|
320 |
while ( r != ancestorClass->baseClasses().end() ) { |
|
321 |
stack.prepend( (*r).node ); |
|
322 |
++r; |
|
323 |
} |
|
324 |
} |
|
325 |
append( sections, enums ); |
|
326 |
append( sections, writableProperties ); |
|
327 |
append( sections, readOnlyProperties ); |
|
328 |
append( sections, functions ); |
|
329 |
append( sections, signalz ); |
|
330 |
} else if ( style == Detailed ) { |
|
331 |
FastSection enums( classe, "Enum Documentation" ); |
|
332 |
FastSection functionsAndSignals( classe, "Function and Signal Documentation" ); |
|
333 |
FastSection properties( classe, "Property Documentation" ); |
|
334 |
||
335 |
NodeList::ConstIterator c = classe->childNodes().begin(); |
|
336 |
while ( c != classe->childNodes().end() ) { |
|
337 |
if ( (*c)->access() == Node::Public ) { |
|
338 |
if ( (*c)->type() == Node::Enum ) { |
|
339 |
insert( enums, *c, style, status ); |
|
340 |
} else if ( (*c)->type() == Node::Function ) { |
|
341 |
insert( functionsAndSignals, *c, style, status ); |
|
342 |
} else if ( (*c)->type() == Node::Property ) { |
|
343 |
insert( properties, *c, style, status ); |
|
344 |
} |
|
345 |
} |
|
346 |
++c; |
|
347 |
} |
|
348 |
append( sections, enums ); |
|
349 |
append( sections, properties ); |
|
350 |
append( sections, functionsAndSignals ); |
|
351 |
} else { // ( style == SeparateList ) |
|
352 |
FastSection all( classe ); |
|
353 |
||
354 |
QStack<const ClassNode *> stack; |
|
355 |
stack.push( classe ); |
|
356 |
||
357 |
while ( !stack.isEmpty() ) { |
|
358 |
const ClassNode *ancestorClass = stack.pop(); |
|
359 |
||
360 |
NodeList::ConstIterator c = ancestorClass->childNodes().begin(); |
|
361 |
while ( c != ancestorClass->childNodes().end() ) { |
|
362 |
if ( (*c)->access() == Node::Public ) |
|
363 |
insert( all, *c, style, status ); |
|
364 |
++c; |
|
365 |
} |
|
366 |
||
367 |
QList<RelatedClass>::ConstIterator r = ancestorClass->baseClasses().begin(); |
|
368 |
while ( r != ancestorClass->baseClasses().end() ) { |
|
369 |
stack.prepend( (*r).node ); |
|
370 |
++r; |
|
371 |
} |
|
372 |
} |
|
373 |
append( sections, all ); |
|
374 |
} |
|
375 |
return sections; |
|
376 |
} |
|
377 |
||
378 |
const Node *QsCodeMarker::resolveTarget( const QString& /* target */, |
|
379 |
const Tree * /* tree */, |
|
380 |
const Node * /* relative */ ) |
|
381 |
{ |
|
382 |
return 0; |
|
383 |
} |
|
384 |
||
385 |
QT_END_NAMESPACE |