blob: 51b1fec8e18459121f0f83cb60ec34e092499487 (
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
|
package de.lmu.ifi.dbs.elki.visualization.batikutil;
/*
This file is part of ELKI:
Environment for Developing KDD-Applications Supported by Index-Structures
Copyright (C) 2011
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 org.w3c.dom.Element;
import de.lmu.ifi.dbs.elki.visualization.svg.SVGPlot;
/**
* This helper class will replace a node in an SVG plot,
* as soon as the tree is unlocked by the rendering engine.
*
* @author Erich Schubert
*
*/
public class NodeReplacer implements Runnable {
private SVGPlot plot;
private String id;
private Element newe;
/**
* Setup a SVG node replacement.
*
* @param newe New element
* @param plot SVG plot to process
* @param id Node ID to replace
*/
public NodeReplacer(Element newe, SVGPlot plot, String id) {
super();
this.newe = newe;
this.plot = plot;
this.id = id;
}
@Override
public void run() {
Element olde = plot.getIdElement(id);
if (olde != null) {
olde.getParentNode().replaceChild(newe, olde);
plot.putIdElement(id, newe);
}
}
}
|
