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 examples 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 /*

    43     treeitem.cpp

    44 

    45     A container for items of data supplied by the simple tree model.

    46 */

    47 

    48 #include <QStringList>

    49 

    50 #include "treeitem.h"

    51 

    52 //! [0]

    53 TreeItem::TreeItem(const QVector<QVariant> &data, TreeItem *parent)

    54 {

    55     parentItem = parent;

    56     itemData = data;

    57 }

    58 //! [0]

    59 

    60 //! [1]

    61 TreeItem::~TreeItem()

    62 {

    63     qDeleteAll(childItems);

    64 }

    65 //! [1]

    66 

    67 //! [2]

    68 TreeItem *TreeItem::child(int number)

    69 {

    70     return childItems.value(number);

    71 }

    72 //! [2]

    73 

    74 //! [3]

    75 int TreeItem::childCount() const

    76 {

    77     return childItems.count();

    78 }

    79 //! [3]

    80 

    81 //! [4]

    82 int TreeItem::childNumber() const

    83 {

    84     if (parentItem)

    85         return parentItem->childItems.indexOf(const_cast<TreeItem*>(this));

    86 

    87     return 0;

    88 }

    89 //! [4]

    90 

    91 //! [5]

    92 int TreeItem::columnCount() const

    93 {

    94     return itemData.count();

    95 }

    96 //! [5]

    97 

    98 //! [6]

    99 QVariant TreeItem::data(int column) const

   100 {

   101     return itemData.value(column);

   102 }

   103 //! [6]

   104 

   105 //! [7]

   106 bool TreeItem::insertChildren(int position, int count, int columns)

   107 {

   108     if (position < 0 || position > childItems.size())

   109         return false;

   110 

   111     for (int row = 0; row < count; ++row) {

   112         QVector<QVariant> data(columns);

   113         TreeItem *item = new TreeItem(data, this);

   114         childItems.insert(position, item);

   115     }

   116 

   117     return true;

   118 }

   119 //! [7]

   120 

   121 //! [8]

   122 bool TreeItem::insertColumns(int position, int columns)

   123 {

   124     if (position < 0 || position > itemData.size())

   125         return false;

   126 

   127     for (int column = 0; column < columns; ++column)

   128         itemData.insert(position, QVariant());

   129 

   130     foreach (TreeItem *child, childItems)

   131         child->insertColumns(position, columns);

   132 

   133     return true;

   134 }

   135 //! [8]

   136 

   137 //! [9]

   138 TreeItem *TreeItem::parent()

   139 {

   140     return parentItem;

   141 }

   142 //! [9]

   143 

   144 //! [10]

   145 bool TreeItem::removeChildren(int position, int count)

   146 {

   147     if (position < 0 || position + count > childItems.size())

   148         return false;

   149 

   150     for (int row = 0; row < count; ++row)

   151         delete childItems.takeAt(position);

   152 

   153     return true;

   154 }

   155 //! [10]

   156 

   157 bool TreeItem::removeColumns(int position, int columns)

   158 {

   159     if (position < 0 || position + columns > itemData.size())

   160         return false;

   161 

   162     for (int column = 0; column < columns; ++column)

   163         itemData.remove(position);

   164 

   165     foreach (TreeItem *child, childItems)

   166         child->removeColumns(position, columns);

   167 

   168     return true;

   169 }

   170 

   171 //! [11]

   172 bool TreeItem::setData(int column, const QVariant &value)

   173 {

   174     if (column < 0 || column >= itemData.size())

   175         return false;

   176 

   177     itemData[column] = value;

   178     return true;

   179 }

   180 //! [11]