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
|
/****************************************************************************
**
** Copyright (C) 2009 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$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the Technology Preview License Agreement accompanying
** this package.
**
** 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.
**
** If you have questions regarding the use of this file, please contact
** Nokia at qt-info@nokia.com.
**
**
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include <QFile>
#include "apigenerator.h"
#include "codemarker.h"
#include "tree.h"
QT_BEGIN_NAMESPACE
static QString indentStr(int indent)
{
QString str;
str.fill(QLatin1Char(' '), indent * 4);
return str;
}
static bool lessThanName(Node *node1, Node *node2)
{
return node1->name() < node2->name();
}
QString ApiGenerator::format()
{
return QLatin1String("API");
}
void ApiGenerator::generateTree(const Tree *tree, CodeMarker *marker)
{
QFile outFile(QLatin1String("api"));
outFile.open(QIODevice::WriteOnly);
out.setDevice(&outFile);
generateNode(tree->root(), marker);
out.flush();
}
void ApiGenerator::generateNode(const Node *node, CodeMarker *marker, int indent)
{
if (node->access() == Node::Private)
return;
switch (node->type()) {
case Node::Namespace:
if (!node->name().isEmpty()) {
out << indentStr(indent) << "Namespace: " << node->name() << "\n";
++indent;
}
break;
case Node::Class:
{
const ClassNode *classe = static_cast<const ClassNode *>(node);
out << indentStr(indent) << "Class: " << node->name();
foreach (const RelatedClass &baseClass, classe->baseClasses()) {
if (baseClass.access == Node::Public)
out << " inherits " << baseClass.dataTypeWithTemplateArgs;
}
out << "\n";
++indent;
}
break;
case Node::Enum:
{
const EnumNode *enume = static_cast<const EnumNode *>(node);
out << indentStr(indent) << "Enum: " << node->name() << "\n";
++indent;
QStringList enumNames;
foreach (const EnumItem &item, enume->items())
enumNames << item.name();
qSort(enumNames);
foreach (const QString &name, enumNames)
out << indentStr(indent) << "Enum value: " << name << "\n";
}
break;
case Node::Typedef:
out << indentStr(indent) << "Typedef: " << node->name() << "\n";
++indent;
break;
case Node::Function:
{
out << indentStr(indent) << "Function: "
<< plainCode(marker->markedUpSynopsis(node, 0, CodeMarker::Detailed)) << "\n";
++indent;
}
break;
case Node::Property:
{
const PropertyNode *property = static_cast<const PropertyNode *>(node);
out << indentStr(indent) << "Property: " << property->name()
<< " type " << property->dataType() << "\n";
++indent;
}
break;
default:
;
}
if (node->isInnerNode()) {
const InnerNode *inner = static_cast<const InnerNode *>(node);
NodeList nodes = inner->childNodes();
qSort(nodes.begin(), nodes.end(), lessThanName);
foreach (const Node *child, nodes)
generateNode(child, marker, indent);
}
out.flush();
}
QT_END_NAMESPACE
|
