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
|
/****************************************************************************
**
** Copyright (C) 2012 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the test suite 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$
**
****************************************************************************/
#include <QList>
#include <QPointer>
#include <QVariant>
#include "ASTItem.h"
using namespace QPatternistSDK;
/**
* This is what the AST rendering is indented with.
*/
static const QLatin1String astIndent(" ");
// STATIC DATA
ASTItem::ASTItem(ASTItem *p,
const QString &name,
const QString &details,
const QString &staticType,
const QString &reqType) : m_name(name),
m_details(details),
m_reqType(reqType),
m_staticType(staticType),
m_parent(p)
{
}
ASTItem::~ASTItem()
{
qDeleteAll(m_children);
}
QString ASTItem::toString() const
{
/* The first ASTItem* is a virtual root node, so skip "this". */
Q_ASSERT(m_children.count() == 1);
TreeItem *treeChild = m_children.first();
Q_ASSERT(treeChild);
ASTItem *astChild = static_cast<ASTItem *>(treeChild);
return astChild->toString(QString());
}
QString ASTItem::toString(const QString &indent) const
{
QString retval;
retval += indent;
retval += m_name;
retval += QLatin1Char('(');
retval += m_details;
retval += QLatin1String(")\n");
const TreeItem::List::const_iterator end(m_children.constEnd());
for(TreeItem::List::const_iterator it(m_children.constBegin()); it != end; ++it)
{
TreeItem *treeChild = *it; /* Cast away the QPointer with its casting operator. */
ASTItem *astChild = static_cast<ASTItem *>(treeChild);
retval += astChild->toString(indent + astIndent);
}
return retval;
}
QVariant ASTItem::data(const Qt::ItemDataRole role, int column) const
{
if(role != Qt::DisplayRole)
return QVariant();
switch(column)
{
case 0:
return m_name;
case 1:
return m_details;
case 2:
return m_staticType;
case 3:
return m_reqType;
default:
{
Q_ASSERT(false);
return QVariant();
}
}
}
int ASTItem::columnCount() const
{
return 4;
}
TreeItem::List ASTItem::children() const
{
return m_children;
}
void ASTItem::appendChild(TreeItem *item)
{
m_children.append(item);
}
TreeItem *ASTItem::child(const unsigned int rowP) const
{
return m_children.value(rowP);
}
unsigned int ASTItem::childCount() const
{
return m_children.count();
}
TreeItem *ASTItem::parent() const
{
return m_parent;
}
// vim: et:ts=4:sw=4:sts=4
|
