Qt 4.6: treemodel.cpp Example File (itemviews/simpletreemodel/treemodel.cpp)

|  | Home · All Classes · Overviews |

# treemodel.cpp Example File
itemviews/simpletreemodel/treemodel.cpp

     /****************************************************************************
     **
     ** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
     ** Contact: Nokia Corporation (qt-info@nokia.com)
     **
     ** This file is part of the examples 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$
     **
     ****************************************************************************/

     /*
         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 0;

         return Qt::ItemIsEnabled | Qt::ItemIsSelectable;
     }

     QVariant TreeModel::headerData(int section, Qt::Orientation orientation,
                                    int role) const
     {
         if (orientation == Qt::Horizontal && role == Qt::DisplayRole)
             return rootItem->data(section);

         return QVariant();
     }

     QModelIndex TreeModel::index(int row, int column, const QModelIndex &parent)
                 const
     {
         if (!hasIndex(row, column, parent))
             return QModelIndex();

         TreeItem *parentItem;

         if (!parent.isValid())
             parentItem = rootItem;
         else
             parentItem = static_cast<TreeItem*>(parent.internalPointer());

         TreeItem *childItem = parentItem->child(row);
         if (childItem)
             return createIndex(row, column, childItem);
         else
             return QModelIndex();
     }

     QModelIndex TreeModel::parent(const QModelIndex &index) const
     {
         if (!index.isValid())
             return QModelIndex();

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

         if (parentItem == rootItem)
             return QModelIndex();

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

     int TreeModel::rowCount(const QModelIndex &parent) const
     {
         TreeItem *parentItem;
         if (parent.column() > 0)
             return 0;

         if (!parent.isValid())
             parentItem = rootItem;
         else
             parentItem = static_cast<TreeItem*>(parent.internalPointer());

         return parentItem->childCount();
     }

     void TreeModel::setupModelData(const QStringList &lines, TreeItem *parent)
     {
         QList<TreeItem*> parents;
         QList<int> indentations;
         parents << parent;
         indentations << 0;

         int number = 0;

         while (number < lines.count()) {
             int position = 0;
             while (position < lines[number].length()) {
                 if (lines[number].mid(position, 1) != " ")
                     break;
                 position++;
             }

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

             if (!lineData.isEmpty()) {
                 // Read the column data from the rest of the line.
                 QStringList columnStrings = lineData.split("\t", QString::SkipEmptyParts);
                 QList<QVariant> columnData;
                 for (int column = 0; column < columnStrings.count(); ++column)
                     columnData << columnStrings[column];

                 if (position > indentations.last()) {
                     // The last child of the current parent is now the new parent
                     // unless the current parent has no children.

                     if (parents.last()->childCount() > 0) {
                         parents << parents.last()->child(parents.last()->childCount()-1);
                         indentations << position;
                     }
                 } else {
                     while (position < indentations.last() && parents.count() > 0) {
                         parents.pop_back();
                         indentations.pop_back();
                     }
                 }

                 // Append a new item to the current parent's list of children.
                 parents.last()->appendChild(new TreeItem(columnData, parents.last()));
             }

             number++;
         }
     }