blob: e9e3e4e38e2e680e4ceb579f3188ec82f849014c (
plain)
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
|
/****************************************************************************
**
** Copyright (C) 2008-2009 Nokia Corporation and/or its subsidiary(-ies).
** Contact: Qt Software Information (qt-info@nokia.com)
**
** This file is part of the Itemviews NG project on Trolltech Labs.
**
** This file may be used under the terms of the GNU General Public
** License version 2.0 or 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 GNU
** General Public Licensing requirements will be met:
** http://www.fsf.org/licensing/licenses/info/GPLv2.html and
** http://www.gnu.org/copyleft/gpl.html.
**
** If you are unsure which license is appropriate for your use, please
** contact the sales department at qt-sales@nokia.com.
**
** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
**
****************************************************************************/
#ifndef TEST_H
#define TEST_H
#include "qtreemodelinterface.h"
#include <QString>
struct Node
{
Node() : parent(0) {}
Node *parent;
QList<Node*> children;
QString text;
};
class Test : public QtTreeModelInterface<Node*>
{
public:
Test(QObject *parent = 0);
~Test();
Node *firstChild(Node *node) const;
Node *nextSibling(Node *node) const;
Node *previousSibling(Node *node) const;
Node *parentItem(Node *node) const;
QHash<int,QVariant> data(Node *node, int column, const QList<int> &roles) const;
bool setData(const QVariant &data, Node *node, int column, int role);
bool isValid(Node *node) const;
// Model specific API
void insertNode(Node *parent, int index, Node *node);
Node *node(Node *parent, int index);
void removeNode(Node *node);
private:
void init();
Node *hiddenRoot;
};
#endif//TEST_H
|
