~oif-team/ubuntu/natty/qt4-x11/xi2.1

<td width="1">  </td><td class="postheader" valign="center"><a href="index.html"><font color="#004faf">Home</font></a> · <a href="classes.html"><font color="#004faf">All Classes</font></a> · <a href="mainclasses.html"><font color="#004faf">Main Classes</font></a> · <a href="annotated.html"><font color="#004faf">Annotated</font></a> · <a href="groups.html"><font color="#004faf">Grouped Classes</font></a> · <a href="functions.html"><font color="#004faf">Functions</font></a></td>

<td align="right" valign="top" width="230"><img src="images/trolltech-logo.png" align="right" width="203" height="32" border="0" /></td></tr></table><h1 align="center">treemodel.cpp Example File<br /><small><small>itemviews/simpletreemodel/treemodel.cpp</small></small></h1>

<pre>  /****************************************************************************

** This file is part of the documentation of the Qt Toolkit.

** This file may be distributed under the terms of the Q Public License

** as defined by Trolltech AS of Norway and appearing in the file

** LICENSE.QPL included in the packaging of this file.

** This file may be distributed and/or modified under the terms of the

** GNU General Public License version 2 as published by the Free Software

** Foundation and appearing in the file LICENSE.GPL included in the

** packaging of this file.

** See http://www.trolltech.com/pricing.html or email sales@trolltech.com for

** information about Qt Commercial License Agreements.

** See http://www.trolltech.com/qpl/ for QPL licensing information.

** See http://www.trolltech.com/gpl/ for GPL licensing information.

** Contact info@trolltech.com if any conditions of this licensing are

** not clear to you.

** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE

** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.

****************************************************************************/

treemodel.cpp

Provides a simple tree model to show how to create and use hierarchical

models.

#include <QtGui>

#include "treeitem.h"

#include "treemodel.h"

TreeModel::TreeModel(const QString &data, QObject *parent)

: QAbstractItemModel(parent)

{

QList<QVariant> rootData;

rootData << "Title" << "Summary";

rootItem = new TreeItem(rootData);

setupModelData(data.split(QString("\n")), rootItem);

}

TreeModel::~TreeModel()

{

delete rootItem;

}

int TreeModel::columnCount(const QModelIndex &parent) const

{

if (parent.isValid())

return static_cast<TreeItem*>(parent.internalPointer())->columnCount();

else

return rootItem->columnCount();

}

QVariant TreeModel::data(const QModelIndex &index, int role) const

{

if (!index.isValid())

return QVariant();

if (role != Qt::DisplayRole)

return QVariant();

TreeItem *item = static_cast<TreeItem*>(index.internalPointer());

return item->data(index.column());

}

Qt::ItemFlags TreeModel::flags(const QModelIndex &index) const

{

if (!index.isValid())

return Qt::ItemIsEnabled;

100

return Qt::ItemIsEnabled | Qt::ItemIsSelectable;

101

}

102

103

QVariant TreeModel::headerData(int section, Qt::Orientation orientation,

104

int role) const

105

{

106

if (orientation == Qt::Horizontal && role == Qt::DisplayRole)

107

return rootItem->data(section);

108

109

return QVariant();

110

}

111

112

QModelIndex TreeModel::index(int row, int column, const QModelIndex &parent)

113

const

114

{

115

TreeItem *parentItem;

116

117

if (!parent.isValid())

118

parentItem = rootItem;

119

else

120

parentItem = static_cast<TreeItem*>(parent.internalPointer());

121

122

TreeItem *childItem = parentItem->child(row);

123

if (childItem)

124

return createIndex(row, column, childItem);

125

else

126

return QModelIndex();

127

}

128

129

QModelIndex TreeModel::parent(const QModelIndex &index) const

130

{

131

if (!index.isValid())

132

return QModelIndex();

133

134

TreeItem *childItem = static_cast<TreeItem*>(index.internalPointer());

135

TreeItem *parentItem = childItem->parent();

136

137

if (parentItem == rootItem)

138

return QModelIndex();

139

140

return createIndex(parentItem->row(), 0, parentItem);

141

}

142

143

int TreeModel::rowCount(const QModelIndex &parent) const

144

{

145

TreeItem *parentItem;

146

147

if (!parent.isValid())

148

parentItem = rootItem;

149

else

150

parentItem = static_cast<TreeItem*>(parent.internalPointer());

151

152

return parentItem->childCount();

153

}

154

155

void TreeModel::setupModelData(const QStringList &lines, TreeItem *parent)

156

{

157

QList<TreeItem*> parents;

158

QList<int> indentations;

159

parents << parent;

160

indentations << 0;

161

162

int number = 0;

163

164

while (number < lines.count()) {

165

int position = 0;

166

while (position < lines[number].length()) {

167

if (lines[number].mid(position, 1) != " ")

168

break;

169

position++;

170

}

171

172

QString lineData = lines[number].mid(position).trimmed();

173

174

if (!lineData.isEmpty()) {

175

// Read the column data from the rest of the line.

176

QStringList columnStrings = lineData.split("\t", QString::SkipEmptyParts);

177

QList<QVariant> columnData;

178

for (int column = 0; column < columnStrings.count(); ++column)

179

columnData << columnStrings[column];

180

181

if (position > indentations.last()) {

182

// The last child of the current parent is now the new parent

183

// unless the current parent has no children.

184

185

if (parents.last()->childCount() > 0) {

186

parents << parents.last()->child(parents.last()->childCount()-1);

187

indentations << position;

188

}

189

} else {

190

while (position < indentations.last() && parents.count() > 0) {

191

parents.pop_back();

192

indentations.pop_back();

193

}

194

}

195

196

// Append a new item to the current parent's list of children.

197

parents.last()->appendChild(new TreeItem(columnData, parents.last()));

198

}

199

200

number++;

201

}

202

}</pre>

203

204

205

206

<td width="40%" align="center"><a href="trademarks.html">Trademarks</a></td>

207

208

</tr></table></div></address></body>

209

</html>

Older »