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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
|
/*
* Copyright 2008-2009 Ben Boeckel <MathStuf@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program. If not, see <http://www.gnu.org/licenses/>.
*/
// Header include
#include "SigmodrTree.h"
// Sigmodr tree includes
#include "BaseModel.h"
#include "SigmodrTreeModel.h"
// Sigmodr widget includes
#include <sigmodr/widgets/ObjectUI.h>
// Sigmod includes
#include <sigmod/Game.h>
#include <sigmod/Object.h>
// Qt includes
#include <QtGui/QHeaderView>
using namespace Sigmod;
using namespace Sigmodr::Widgets;
using namespace Sigmodr::Tree;
SigmodrTree::SigmodrTree(QWidget* parent) :
QTreeView(parent)
{
SigmodrTreeModel* model = new SigmodrTreeModel(this);
connect(model, SIGNAL(dirty(const Game*, bool)), this, SLOT(setDirty(const Game*, bool)));
header()->hide();
setModel(model);
setRootIndex(model->index(-1, 0, QModelIndex()));
}
QString SigmodrTree::description(const QModelIndex& index)
{
QString type = model()->data(index, BaseModel::TypeRole).toString();
QString name = model()->data(index, Qt::DisplayRole).toString();
if (type.isEmpty() && name.isEmpty())
return "";
return QString("%1: %2").arg(type).arg(name);
}
ObjectUI* SigmodrTree::editorWidget(const QModelIndex& index)
{
ObjectUI* widget = qobject_cast<ObjectUI*>(model()->data(index, BaseModel::WidgetRole).value<QWidget*>());
return widget;
}
KMenu* SigmodrTree::contextMenu(const QModelIndex& index)
{
return model()->data(index, BaseModel::ContextMenuRole).value<KMenu*>();
}
const Game* SigmodrTree::currentGame() const
{
QModelIndex index = currentIndex();
if (index.isValid())
{
const Object* object = static_cast<BaseModel*>(index.internalPointer())->object();
if (object)
return object->game();
}
return NULL;
}
QDomDocument SigmodrTree::copy(const QModelIndex& index)
{
QDomDocument xml;
xml.setContent(model()->data(index, BaseModel::XmlRole).toString());
return xml;
}
void SigmodrTree::paste(const QModelIndex& index, const QDomDocument& data)
{
model()->setData(index, data.toString(), BaseModel::XmlRole);
}
QList<const Game*> SigmodrTree::openedGames() const
{
return m_games.keys();
}
void SigmodrTree::addGame(Game* game, const KUrl& url)
{
qobject_cast<SigmodrTreeModel*>(model())->addGame(game);
m_games[game] = UrlDirty(url, false);
}
void SigmodrTree::deleteGame(const Game* game)
{
if (m_games.contains(game))
{
qobject_cast<SigmodrTreeModel*>(model())->deleteGame(game);
m_games.remove(game);
}
}
bool SigmodrTree::isOpen(const KUrl& url) const
{
foreach (const UrlDirty& pair, m_games.values())
{
if (url == pair.first)
return true;
}
return false;
}
KUrl SigmodrTree::url(const Game* game) const
{
if (m_games.contains(game))
return m_games[game].first;
return KUrl();
}
QStringList SigmodrTree::urls() const
{
QStringList urls;
foreach (const UrlDirty& pair, m_games.values())
urls << pair.first.prettyUrl();
return urls;
}
void SigmodrTree::setUrl(const Game* game, const KUrl& url)
{
if (m_games.contains(game))
m_games[game] = UrlDirty(url, false);
}
bool SigmodrTree::dirty(const Game* game) const
{
if (m_games.contains(game))
return m_games[game].second;
return false;
}
bool SigmodrTree::dirty() const
{
return dirty(currentGame());
}
void SigmodrTree::setDirty(const Game* game, const bool dirty)
{
if (m_games.contains(game))
m_games[game].second = dirty;
}
void SigmodrTree::setDirty()
{
setDirty(currentGame(), true);
}
|
