0
|
1 |
/****************************************************************************
|
|
2 |
**
|
|
3 |
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
|
|
4 |
** All rights reserved.
|
|
5 |
** Contact: Nokia Corporation (qt-info@nokia.com)
|
|
6 |
**
|
|
7 |
** This file is part of the test suite 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 |
#include <QList>
|
|
43 |
#include <QPointer>
|
|
44 |
#include <QVariant>
|
|
45 |
|
|
46 |
#include "ASTItem.h"
|
|
47 |
|
|
48 |
using namespace QPatternistSDK;
|
|
49 |
|
|
50 |
/**
|
|
51 |
* This is what the AST rendering is indented with.
|
|
52 |
*/
|
|
53 |
static const QLatin1String astIndent(" ");
|
|
54 |
// STATIC DATA
|
|
55 |
|
|
56 |
ASTItem::ASTItem(ASTItem *p,
|
|
57 |
const QString &name,
|
|
58 |
const QString &details,
|
|
59 |
const QString &staticType,
|
|
60 |
const QString &reqType) : m_name(name),
|
|
61 |
m_details(details),
|
|
62 |
m_reqType(reqType),
|
|
63 |
m_staticType(staticType),
|
|
64 |
m_parent(p)
|
|
65 |
{
|
|
66 |
}
|
|
67 |
|
|
68 |
ASTItem::~ASTItem()
|
|
69 |
{
|
|
70 |
qDeleteAll(m_children);
|
|
71 |
}
|
|
72 |
|
|
73 |
QString ASTItem::toString() const
|
|
74 |
{
|
|
75 |
/* The first ASTItem* is a virtual root node, so skip "this". */
|
|
76 |
Q_ASSERT(m_children.count() == 1);
|
|
77 |
TreeItem *treeChild = m_children.first();
|
|
78 |
Q_ASSERT(treeChild);
|
|
79 |
|
|
80 |
ASTItem *astChild = static_cast<ASTItem *>(treeChild);
|
|
81 |
|
|
82 |
return astChild->toString(QString());
|
|
83 |
}
|
|
84 |
|
|
85 |
QString ASTItem::toString(const QString &indent) const
|
|
86 |
{
|
|
87 |
QString retval;
|
|
88 |
|
|
89 |
retval += indent;
|
|
90 |
retval += m_name;
|
|
91 |
retval += QLatin1Char('(');
|
|
92 |
retval += m_details;
|
|
93 |
retval += QLatin1String(")\n");
|
|
94 |
|
|
95 |
const TreeItem::List::const_iterator end(m_children.constEnd());
|
|
96 |
|
|
97 |
for(TreeItem::List::const_iterator it(m_children.constBegin()); it != end; ++it)
|
|
98 |
{
|
|
99 |
TreeItem *treeChild = *it; /* Cast away the QPointer with its casting operator. */
|
|
100 |
ASTItem *astChild = static_cast<ASTItem *>(treeChild);
|
|
101 |
|
|
102 |
retval += astChild->toString(indent + astIndent);
|
|
103 |
}
|
|
104 |
|
|
105 |
return retval;
|
|
106 |
}
|
|
107 |
|
|
108 |
QVariant ASTItem::data(const Qt::ItemDataRole role, int column) const
|
|
109 |
{
|
|
110 |
if(role != Qt::DisplayRole)
|
|
111 |
return QVariant();
|
|
112 |
|
|
113 |
switch(column)
|
|
114 |
{
|
|
115 |
case 0:
|
|
116 |
return m_name;
|
|
117 |
case 1:
|
|
118 |
return m_details;
|
|
119 |
case 2:
|
|
120 |
return m_staticType;
|
|
121 |
case 3:
|
|
122 |
return m_reqType;
|
|
123 |
default:
|
|
124 |
{
|
|
125 |
Q_ASSERT(false);
|
|
126 |
return QVariant();
|
|
127 |
}
|
|
128 |
}
|
|
129 |
}
|
|
130 |
|
|
131 |
int ASTItem::columnCount() const
|
|
132 |
{
|
|
133 |
return 4;
|
|
134 |
}
|
|
135 |
|
|
136 |
TreeItem::List ASTItem::children() const
|
|
137 |
{
|
|
138 |
return m_children;
|
|
139 |
}
|
|
140 |
|
|
141 |
void ASTItem::appendChild(TreeItem *item)
|
|
142 |
{
|
|
143 |
m_children.append(item);
|
|
144 |
}
|
|
145 |
|
|
146 |
TreeItem *ASTItem::child(const unsigned int rowP) const
|
|
147 |
{
|
|
148 |
return m_children.value(rowP);
|
|
149 |
}
|
|
150 |
|
|
151 |
unsigned int ASTItem::childCount() const
|
|
152 |
{
|
|
153 |
return m_children.count();
|
|
154 |
}
|
|
155 |
|
|
156 |
TreeItem *ASTItem::parent() const
|
|
157 |
{
|
|
158 |
return m_parent;
|
|
159 |
}
|
|
160 |
|
|
161 |
// vim: et:ts=4:sw=4:sts=4
|