blob: bdb102649311757ce181d3439bd3e67ebbbd1ff2 (
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
63
64
65
66
67
68
69
70
71
72
73
74
|
// Copyright (C) 2008 Lukas Lalinsky
//
// 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 "hub.h"
#include "diagramobject.h"
#include "diagramdocument.h"
#include "connector.h"
#include "line.h"
Hub::Hub(DiagramObject *owner)
: m_owner(owner)
{
}
DiagramObject *
Hub::owner() const
{
return m_owner;
}
void
Hub::addConnector(Connector *connector)
{
m_connectors.insert(connector);
if (m_owner->document()) {
m_owner->document()->updatePositions(m_owner);
}
}
void
Hub::removeConnector(Connector *connector)
{
m_connectors.remove(connector);
if (m_owner->document()) {
m_owner->document()->updatePositions(m_owner);
}
}
QSet<Connector *>
Hub::connectors() const
{
return m_connectors;
}
void
Hub::update()
{
}
QList<Line *>
Hub::outgoingLines() const
{
QList<Line *> result;
foreach (Connector *connector, m_connectors) {
Line *line = connector->owner();
if (connector == line->connector(0)) {
result << line;
}
}
return result;
}
|
