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
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
|
package de.lmu.ifi.dbs.elki.visualization.gui.overview;
import java.util.ArrayList;
/*
This file is part of ELKI:
Environment for Developing KDD-Applications Supported by Index-Structures
Copyright (C) 2015
Ludwig-Maximilians-Universität München
Lehr- und Forschungseinheit für Datenbanksysteme
ELKI Development Team
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero 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 Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
import java.util.Collection;
import java.util.Collections;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import de.lmu.ifi.dbs.elki.visualization.VisualizationTask;
import de.lmu.ifi.dbs.elki.visualization.projections.Projection;
/**
* Item to collect visualization tasks on a specific position on the plot map.
*
* Note: this is a {@code LinkedList<VisualizationTask>}!
*
* @author Erich Schubert
* @since 0.4.0
*
* @apiviz.composedOf Projection
* @apiviz.composedOf VisualizationTask
* @apiviz.composedOf PlotItem
*/
public class PlotItem {
/**
* Position: x
*/
public final double x;
/**
* Position: y
*/
public final double y;
/**
* Size: width
*/
public final double w;
/**
* Size: height
*/
public final double h;
/**
* Projection (may be {@code null}!)
*/
public final Projection proj;
/**
* The visualization tasks at this location
*/
public List<VisualizationTask> tasks = new LinkedList<>();
/**
* Subitems to plot
*/
public Collection<PlotItem> subitems = new LinkedList<>();
/**
* Constructor.
*
* @param w Position: w
* @param h Position: h
* @param proj Projection
*/
public PlotItem(double w, double h, Projection proj) {
this(0, 0, w, h, proj);
}
/**
* Constructor.
*
* @param x Position: x
* @param y Position: y
* @param w Position: w
* @param h Position: h
* @param proj Projection
*/
public PlotItem(double x, double y, double w, double h, Projection proj) {
super();
this.x = x;
this.y = y;
this.w = w;
this.h = h;
this.proj = proj;
}
/**
* Clone constructor.
*
* @param vis Existing plot item.
*/
public PlotItem(PlotItem vis) {
super();
this.x = vis.x;
this.y = vis.y;
this.w = vis.w;
this.h = vis.h;
this.proj = vis.proj;
this.tasks = new ArrayList<>(vis.tasks);
this.subitems = new ArrayList<>(vis.subitems.size());
for(PlotItem s : vis.subitems) {
this.subitems.add(new PlotItem(s));
}
}
/**
* Sort all visualizers for their proper drawing order
*/
public void sort() {
Collections.sort(tasks);
for(PlotItem subitem : subitems) {
subitem.sort();
}
}
/**
* Add a task to the item.
*
* @param task Task to add
*/
public void add(VisualizationTask task) {
tasks.add(task);
}
/**
* Number of tasks in this item.
*
* @return Number of tasks.
*/
public int taskSize() {
return tasks.size();
}
/**
* Iterate (recursively) over all plot items, including itself.
*
* @return Iterator
*/
public Iterator<PlotItem> itemIterator() {
return new ItmItr();
}
@Override
public String toString() {
return "PlotItem [x=" + x + ", y=" + y + ", w=" + w + ", h=" + h + ",proj=" + proj + "]";
}
/**
* Recursive iterator
*
* @author Erich Schubert
*
* @apiviz.exclude
*/
private class ItmItr implements Iterator<PlotItem> {
PlotItem next;
Iterator<PlotItem> cur;
Iterator<PlotItem> sub;
/**
* Constructor.
*/
public ItmItr() {
super();
this.next = PlotItem.this;
this.cur = null;
this.sub = subitems.iterator();
}
@Override
public boolean hasNext() {
if(next != null) {
return true;
}
if(cur != null && cur.hasNext()) {
next = cur.next();
return true;
}
if(sub.hasNext()) {
cur = sub.next().itemIterator();
return hasNext();
}
return false;
}
@Override
public PlotItem next() {
hasNext();
PlotItem ret = next;
next = null;
return ret;
}
@Override
public void remove() {
throw new UnsupportedOperationException();
}
}
}
|
