[6dd4ed]: src / interfaces / component / connector.cpp Maximize Restore History

Download this file

connector.cpp    213 lines (183 with data), 5.7 kB

  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
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
/*
Copyright (C) 2010 Julia B채ume <julian@svg4all.de>
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 2 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, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include "connector.h"
#include "node.h"
#include <QStringList>
#include <QPointF>
#include <QPainterPath>
#include <KDebug>
using namespace KTechLab;
class KTechLab::ConnectorPrivate
{
public:
ConnectorPrivate(const QVariantMap& connectorData){
startNode = 0;
endNode = 0;
data = connectorData;
parseRoute(data.value( "route" ).toString());
};
void parseRoute(const QString pathString);
void setRoute(const QPainterPath& path);
void setEndNode(const Node* node);
void setStartNode(const Node* node);
QVariantMap data;
QPainterPath route;
const Node* startNode;
const Node* endNode;
};
void ConnectorPrivate::setRoute(const QPainterPath& path)
{
route = path;
data.remove("route");
QString pathString;
for (int i=0; i<path.elementCount(); ++i){
QPainterPath::Element e = path.elementAt(i);
pathString += (e.x-4)/8 + ',' + (e.y-4)/8 + ',';
}
data.insert("route",pathString);
}
void ConnectorPrivate::parseRoute(const QString pathString)
{
QStringList routeList = pathString.split(',');
if (routeList.length() == 0){
kError() << "Cannot parse route:" << pathString;
return;
}
//remove last entry, if it is empty
if (routeList.last().isEmpty())
routeList.removeLast();
if (routeList.length() % 2 != 0){
kError() << "Cannot parse route:" << pathString;
return;
}
QStringList::const_iterator it = routeList.constBegin();
QPointF p;
p.setX((*it++).toDouble()*8+4);
p.setY((*it++).toDouble()*8+4);
route.moveTo(p);
while (it != routeList.constEnd()){
p.setX((*it++).toDouble()*8+4);
p.setY((*it++).toDouble()*8+4);
route.lineTo(p);
}
}
void ConnectorPrivate::setStartNode(const Node* node)
{
if (!node || !node->isValid()){
kError() << "Invalid node set as start node:" << node->id();
return;
}
startNode = node;
data.remove("start-node-id");
data.remove("start-node-cid");
data.remove("start-node-parent");
data.remove("start-node-is-child");
QString parentId = node->parentId();
if (parentId.isEmpty()){
data.insert("start-node-is-child", 1);
data.insert("start-node-parent", parentId);
data.insert("start-node-cid", node->id());
} else {
data.insert("start-node-is-child", 0);
data.insert("start-node-id", node->id());
}
}
void ConnectorPrivate::setEndNode(const Node* node)
{
if (!node || !node->isValid()){
kError() << "Invalid node set as end node:" << node->id();
return;
}
endNode = node;
data.remove("end-node-id");
data.remove("end-node-cid");
data.remove("end-node-parent");
data.remove("end-node-is-child");
QString parentId = node->parentId();
if (parentId.isEmpty()){
data.insert("end-node-is-child", 1);
data.insert("end-node-parent", parentId);
data.insert("end-node-cid", node->id());
} else {
data.insert("end-node-is-child", 0);
data.insert("end-node-id", node->id());
}
}
Connector::Connector(const QVariantMap& connectorData, QObject* parent)
: QObject(parent),
d(new ConnectorPrivate(connectorData))
{
}
Connector::Connector(const KTechLab::Connector& connector)
: QObject(connector.parent()),
d(new ConnectorPrivate(connector.data()))
{
}
Connector::~Connector()
{
delete d;
}
bool Connector::connectsTo(const KTechLab::Node* node) const
{
if (!node->isValid())
return false;
bool found = false;
//// stand-alone nodes
// test start node
found |= d->data.value("start-node-is-child") == 0 &&
d->data.value("start-node-id") == node->id();
//test end node
found |= d->data.value("end-node-is-child") == 0 &&
d->data.value("end-node-id") == node->id();
//// child-nodes of items
// test start node
found |= d->data.value("start-node-is-child") == 1 &&
d->data.value("start-node-parent") == node->parentId() &&
d->data.value("start-node-cid") == node->id();
// test end node
found |= d->data.value("end-node-is-child") == 1 &&
d->data.value("end-node-parent") == node->parentId() &&
d->data.value("end-node-cid") == node->id();
return found;
}
void Connector::setRoute(const QPainterPath& route)
{
d->setRoute(route);
}
void Connector::setStartNode(const Node* node)
{
d->setStartNode(node);
}
const Node* Connector::startNode() const
{
return d->startNode;
}
void Connector::setEndNode(const Node* node)
{
d->setEndNode(node);
}
const Node* Connector::endNode() const
{
return d->endNode;
}
QPainterPath Connector::route() const
{
return d->route;
}
QVariantMap Connector::data() const
{
return d->data;
}
#include "connector.moc"