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
|
/**
* Copyright 2023 JogAmp Community. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are
* permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this list of
* conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice, this list
* of conditions and the following disclaimer in the documentation and/or other materials
* provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY JogAmp Community ``AS IS'' AND ANY EXPRESS OR IMPLIED
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
* FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JogAmp Community OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
* ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* The views and conclusions contained in the software and documentation are those of the
* authors and should not be interpreted as representing official policies, either expressed
* or implied, of JogAmp Community.
*/
package jogamp.graph.ui;
import java.util.Arrays;
import java.util.Comparator;
import java.util.List;
import com.jogamp.graph.ui.Container;
import com.jogamp.graph.ui.Scene;
import com.jogamp.graph.ui.Shape;
import com.jogamp.graph.ui.Shape.Visitor1;
import com.jogamp.graph.ui.Shape.Visitor2;
import com.jogamp.math.Matrix4f;
import com.jogamp.math.util.PMVMatrix4f;
/** Generic static {@link Shape} tree traversal tools, utilized by {@link Scene} and {@link Container} implementations. */
public class TreeTool {
/**
* Traverses through the graph up until {@code shape} of {@link Container#getShapes()} and apply {@code action} on it.
* @param pmv
* @param shape
* @param action
* @return true to signal operation complete, i.e. {@code shape} found, otherwise false
*/
public static boolean forOne(final Container cont, final PMVMatrix4f pmv, final Shape shape, final Runnable action) {
final List<Shape> shapes = cont.getShapes();
final int shapeCount = shapes.size();
for(int i=0; i<shapeCount; ++i) {
final Shape s = shapes.get(i);
if( s.equals(shape) ) {
pmv.pushMv();
s.applyMatToMv(pmv);
action.run();
pmv.popMv();
return true;
} else if( s instanceof Container ) {
final Container c = (Container)s;
if( !c.contains(shape) ) { // fast-path: skip container
continue;
}
pmv.pushMv();
s.applyMatToMv(pmv);
final boolean res = forOne(c, pmv, shape, action);
pmv.popMv();
if( !res ) { throw new InternalError("Not found "+shape+" in "+c+", but contained"); }
return true;
}
}
return false;
}
/**
* Traverses through the graph and apply {@link Visitor1#visit(Shape)} for each {@link Shape} of {@link Container#getShapes()}, stop if it returns true.
* @param v
* @return true to signal operation complete and to stop traversal, i.e. {@link Visitor1#visit(Shape)} returned true, otherwise false
*/
public static boolean forAll(final Container cont, final Visitor1 v) {
final List<Shape> shapes = cont.getShapes();
final int shapeCount = shapes.size();
boolean res = false;
for(int i=0; !res && i<shapeCount; ++i) {
final Shape s = shapes.get(i);
res = v.visit(s);
if( !res && s instanceof Container ) {
final Container c = (Container)s;
res = forAll(c, v);
}
}
return res;
}
/**
* Traverses through the graph and apply {@link Visitor2#visit(Shape, PMVMatrix4f)} for each {@link Shape} of {@link Container#getShapes()}, stop if it returns true.
* @param pmv
* @param v
* @return true to signal operation complete and to stop traversal, i.e. {@link Visitor2#visit(Shape, PMVMatrix4f)} returned true, otherwise false
*/
public static boolean forAll(final Container cont, final PMVMatrix4f pmv, final Visitor2 v) {
final List<Shape> shapes = cont.getShapes();
final int shapeCount = shapes.size();
boolean res = false;
for(int i=0; !res && i<shapeCount; ++i) {
final Shape s = shapes.get(i);
pmv.pushMv();
s.applyMatToMv(pmv);
res = v.visit(s, pmv);
if( !res && s instanceof Container ) {
final Container c = (Container)s;
res = forAll(c, pmv, v);
}
pmv.popMv();
}
return res;
}
/**
* Traverses through the graph and apply {@link Visitor2#visit(Shape, PMVMatrix4f)} for each {@link Shape} of {@link Container#getShapes()},
* stops if it returns true.
* <p>
* Each {@link Container} level is sorted using {@code sortComp}
* </p>
* @param cont container of the shapes
* @param sortComp
* @param pmv
* @param v
* @return true to signal operation complete and to stop traversal, i.e. {@link Visitor2#visit(Shape, PMVMatrix4f)} returned true, otherwise false
*/
public static boolean forSortedAll(final Container cont, final Comparator<Shape> sortComp, final PMVMatrix4f pmv, final Visitor2 v) {
final List<Shape> shapes = cont.getShapes();
final int shapeCount = shapes.size();
final Shape[] shapesS = shapes.toArray(new Shape[shapeCount]);
Arrays.sort(shapesS, sortComp);
boolean res = false;
for(int i=0; !res && i<shapeCount; ++i) {
final Shape s = shapesS[i];
pmv.pushMv();
s.applyMatToMv(pmv);
res = v.visit(s, pmv);
if( !res && s instanceof Container ) {
final Container c = (Container)s;
res = forSortedAll(c, sortComp, pmv, v);
}
pmv.popMv();
}
return res;
}
/**
* Traverses through the graph and apply {@link Visitor2#visit(Shape, PMVMatrix4f)} for each {@link Shape} of {@link Container#getRenderedShapes()},
* stops if it returns true.
* <p>
* Each {@link Container} level is sorted using {@code sortComp}
* </p>
* @param cont container of the shapes
* @param pmv
* @param v
* @return true to signal operation complete and to stop traversal, i.e. {@link Visitor2#visit(Shape, PMVMatrix4f)} returned true, otherwise false
*/
public static boolean forAllRendered(final Container cont, final PMVMatrix4f pmv, final Visitor2 v) {
final List<Shape> shapes = cont.getRenderedShapes();
boolean res = false;
for(int i=0; !res && i<shapes.size(); ++i) {
final Shape s = shapes.get(i);
pmv.pushMv();
s.applyMatToMv(pmv);
res = v.visit(s, pmv);
if( !res && s instanceof Container ) {
final Container c = (Container)s;
res = forAllRendered(c, pmv, v);
}
pmv.popMv();
}
return res;
}
public static boolean contains(final Container cont, final Shape s) {
final List<Shape> shapes = cont.getShapes();
if( shapes.contains(s) ) {
return true;
}
for(final Shape shape : shapes) {
if( shape instanceof Container ) {
if( contains((Container)shape, s) ) {
return true;
}
}
}
return false;
}
public static Shape getShapeByID(final Container cont, final int id) {
final Shape[] res = { null };
forAll(cont, (final Shape s) -> {
if( s.getID() == id ) {
res[0] = s;
return true;
} else {
return false;
}
});
return res[0];
}
public static Shape getShapeByName(final Container cont, final String name) {
final Shape[] res = { null };
forAll(cont, (final Shape s) -> {
if( s.getName().equals(name) ) {
res[0] = s;
return true;
} else {
return false;
}
});
return res[0];
}
}
|
