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
|
/*
* RTFL
*
* Copyright 2014, 2015 Sebastian Geerken <sgeerken@dillo.org>
*
* 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; with the following exception:
*
* The copyright holders of RTFL give you permission to link this file
* statically or dynamically against all versions of the graphviz
* library, which are published by AT&T Corp. under one of the following
* licenses:
*
* - Common Public License version 1.0 as published by International
* Business Machines Corporation (IBM), or
* - Eclipse Public License version 1.0 as published by the Eclipse
* Foundation.
*
* 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/>.
*/
#include "graph2.hh"
using namespace dw::core;
namespace rtfl {
namespace dw {
Graph2::Graph2Iterator::Graph2Iterator (Graph2 *graph, Content::Type mask,
bool atEnd) :
Iterator (graph, mask, atEnd)
{
index = atEnd ? graph->nodes->size() : -1;
content.type = atEnd ? Content::END : Content::START;
}
Graph2::Graph2Iterator::Graph2Iterator (Graph2 *graph, Content::Type mask,
int index) :
Iterator (graph, mask, false)
{
this->index = index;
if (index < 0)
content.type = Content::START;
else if (index >= graph->nodes->size ())
content.type = Content::END;
else {
content.type = Content::WIDGET_IN_FLOW;
content.widget = graph->nodes->get(index)->widget;
}
}
lout::object::Object *Graph2::Graph2Iterator::clone ()
{
return new Graph2Iterator ((Graph2*)getWidget(), getMask(), index);
}
int Graph2::Graph2Iterator::compareTo (lout::object::Comparable *other)
{
return index - ((Graph2Iterator*)other)->index;
}
bool Graph2::Graph2Iterator::next ()
{
Graph2 *graph = (Graph2*)getWidget();
if (content.type == Content::END)
return false;
// graphs only contain widgets:
if ((getMask() & Content::WIDGET_IN_FLOW) == 0) {
content.type = Content::END;
return false;
}
index++;
if (index >= graph->nodes->size ()) {
content.type = Content::END;
return false;
} else {
content.type = Content::WIDGET_IN_FLOW;
content.widget = graph->nodes->get(index)->widget;
return true;
}
}
bool Graph2::Graph2Iterator::prev ()
{
Graph2 *graph = (Graph2*)getWidget();
if (content.type == Content::START)
return false;
// graphs only contain widgets:
if ((getMask() & Content::WIDGET_IN_FLOW) == 0) {
content.type = Content::START;
return false;
}
index--;
if (index < 0) {
content.type = Content::START;
return false;
} else {
content.type = Content::WIDGET_IN_FLOW;
content.widget = graph->nodes->get(index)->widget;
return true;
}
}
void Graph2::Graph2Iterator::highlight (int start, int end,
HighlightLayer layer)
{
/** todo Needs this an implementation? */
}
void Graph2::Graph2Iterator::unhighlight (int direction, HighlightLayer layer)
{
/** todo Needs this an implementation? */
}
void Graph2::Graph2Iterator::getAllocation (int start, int end,
Allocation *allocation)
{
/** \bug Not implemented. */
}
} // namespace rtfl
} // namespace dw
|
