| 1 |
2 |
EziDebug |
/****************************************************************************
|
| 2 |
|
|
**
|
| 3 |
|
|
** Copyright (C) 2011 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:BSD$
|
| 10 |
|
|
** You may use this file under the terms of the BSD license as follows:
|
| 11 |
|
|
**
|
| 12 |
|
|
** "Redistribution and use in source and binary forms, with or without
|
| 13 |
|
|
** modification, are permitted provided that the following conditions are
|
| 14 |
|
|
** met:
|
| 15 |
|
|
** * Redistributions of source code must retain the above copyright
|
| 16 |
|
|
** notice, this list of conditions and the following disclaimer.
|
| 17 |
|
|
** * Redistributions in binary form must reproduce the above copyright
|
| 18 |
|
|
** notice, this list of conditions and the following disclaimer in
|
| 19 |
|
|
** the documentation and/or other materials provided with the
|
| 20 |
|
|
** distribution.
|
| 21 |
|
|
** * Neither the name of Nokia Corporation and its Subsidiary(-ies) nor
|
| 22 |
|
|
** the names of its contributors may be used to endorse or promote
|
| 23 |
|
|
** products derived from this software without specific prior written
|
| 24 |
|
|
** permission.
|
| 25 |
|
|
**
|
| 26 |
|
|
** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| 27 |
|
|
** "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| 28 |
|
|
** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| 29 |
|
|
** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
| 30 |
|
|
** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| 31 |
|
|
** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| 32 |
|
|
** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| 33 |
|
|
** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| 34 |
|
|
** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 35 |
|
|
** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 36 |
|
|
** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE."
|
| 37 |
|
|
** $QT_END_LICENSE$
|
| 38 |
|
|
**
|
| 39 |
|
|
****************************************************************************/
|
| 40 |
|
|
|
| 41 |
|
|
/*
|
| 42 |
|
|
treeitem.cpp
|
| 43 |
|
|
|
| 44 |
|
|
A container for items of data supplied by the simple tree model.
|
| 45 |
|
|
*/
|
| 46 |
|
|
|
| 47 |
|
|
#include <QStringList>
|
| 48 |
|
|
|
| 49 |
|
|
#include "treeitem.h"
|
| 50 |
|
|
|
| 51 |
|
|
//! [0]
|
| 52 |
|
|
TreeItem::TreeItem(const QList<QVariant> &data, TreeItem *parent)
|
| 53 |
|
|
{
|
| 54 |
|
|
parentItem = parent;
|
| 55 |
|
|
itemData = data;
|
| 56 |
|
|
}
|
| 57 |
|
|
//! [0]
|
| 58 |
|
|
|
| 59 |
|
|
//! [1]
|
| 60 |
|
|
TreeItem::~TreeItem()
|
| 61 |
|
|
{
|
| 62 |
|
|
qDeleteAll(childItems);
|
| 63 |
|
|
}
|
| 64 |
|
|
//! [1]
|
| 65 |
|
|
|
| 66 |
|
|
//! [2]
|
| 67 |
|
|
void TreeItem::appendChild(TreeItem *item)
|
| 68 |
|
|
{
|
| 69 |
|
|
childItems.append(item);
|
| 70 |
|
|
}
|
| 71 |
|
|
//! [2]
|
| 72 |
|
|
|
| 73 |
|
|
//! [3]
|
| 74 |
|
|
TreeItem *TreeItem::child(int row)
|
| 75 |
|
|
{
|
| 76 |
|
|
return childItems.value(row);
|
| 77 |
|
|
}
|
| 78 |
|
|
//! [3]
|
| 79 |
|
|
|
| 80 |
|
|
//! [4]
|
| 81 |
|
|
int TreeItem::childCount() const
|
| 82 |
|
|
{
|
| 83 |
|
|
return childItems.count();
|
| 84 |
|
|
}
|
| 85 |
|
|
//! [4]
|
| 86 |
|
|
|
| 87 |
|
|
//! [5]
|
| 88 |
|
|
int TreeItem::columnCount() const
|
| 89 |
|
|
{
|
| 90 |
|
|
return itemData.count();
|
| 91 |
|
|
}
|
| 92 |
|
|
//! [5]
|
| 93 |
|
|
|
| 94 |
|
|
//! [6]
|
| 95 |
|
|
QVariant TreeItem::data(int column) const
|
| 96 |
|
|
{
|
| 97 |
|
|
return itemData.value(column);
|
| 98 |
|
|
}
|
| 99 |
|
|
//! [6]
|
| 100 |
|
|
|
| 101 |
|
|
//! [7]
|
| 102 |
|
|
TreeItem *TreeItem::parent()
|
| 103 |
|
|
{
|
| 104 |
|
|
return parentItem;
|
| 105 |
|
|
}
|
| 106 |
|
|
//! [7]
|
| 107 |
|
|
|
| 108 |
|
|
//! [8]
|
| 109 |
|
|
int TreeItem::row() const
|
| 110 |
|
|
{
|
| 111 |
|
|
if (parentItem)
|
| 112 |
|
|
return parentItem->childItems.indexOf(const_cast<TreeItem*>(this));
|
| 113 |
|
|
|
| 114 |
|
|
return 0;
|
| 115 |
|
|
}
|
| 116 |
|
|
//! [8]
|
