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
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
|
/**
* 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 com.jogamp.graph.ui;
import java.util.Arrays;
import java.util.Collection;
import java.util.Comparator;
import java.util.List;
import java.util.concurrent.CopyOnWriteArrayList;
import com.jogamp.graph.curve.Region;
import com.jogamp.graph.curve.opengl.RegionRenderer;
import com.jogamp.graph.ui.layout.Padding;
import com.jogamp.graph.ui.shapes.Rectangle;
import com.jogamp.opengl.GL2ES2;
import com.jogamp.opengl.GLProfile;
import com.jogamp.opengl.math.Vec3f;
import com.jogamp.opengl.math.Vec4f;
import com.jogamp.opengl.math.geom.AABBox;
import com.jogamp.opengl.util.PMVMatrix;
import jogamp.graph.ui.TreeTool;
/**
* Group of {@link Shape}s, optionally utilizing a {@link Group.Layout}.
* @see Scene
* @see Shape
* @see Group.Layout
*/
public class Group extends Shape implements Container {
/** Layout for the GraphUI {@link Group}, called @ {@link Shape#validate(GL2ES2)} or {@link Shape#validate(GLProfile)}. */
public static interface Layout {
/**
* Performing the layout of {@link Group#getShapes()}, called @ {@link Shape#validate(GL2ES2)} or {@link Shape#validate(GLProfile)}.
* <p>
* According to the implemented layout, method
* - may scale the {@Link Shape}s
* - may move the {@Link Shape}s
* - may reuse the given {@link PMVMatrix} `pmv`
* - must update the given {@link AABBox} `box`
* </p>
* @param g the {@link Group} to layout
* @param box the bounding box of {@link Group} to be updated by this method.
* @param pmv a {@link PMVMatrix} which can be reused.
*/
void layout(final Group g, final AABBox box, final PMVMatrix pmv);
}
private final List<Shape> shapes = new CopyOnWriteArrayList<Shape>();
private Layout layouter;
private Rectangle border = null;
/**
* Create a group of {@link Shape}s w/o {@link Group.Layout}.
* <p>
* Default is non-interactive, see {@link #setInteractive(boolean)}.
* </p>
*/
public Group() {
this(null);
}
/**
* Create a group of {@link Shape}s w/ given {@link Group.Layout}.
* <p>
* Default is non-interactive, see {@link #setInteractive(boolean)}.
* </p>
* @param l optional {@link Layout}, maybe {@code null}
*/
public Group(final Layout l) {
super();
this.layouter = l;
this.setInteractive(false);
}
/** Return current {@link Group.Layout}. */
public Layout getLayout() { return layouter; }
/** Set {@link Group.Layout}. */
public Group setLayout(final Layout l) { layouter = l; return this; }
@Override
public List<Shape> getShapes() {
return shapes;
}
@Override
public void addShape(final Shape s) {
shapes.add(s);
markShapeDirty();
}
/** Removes given shape, keeps it alive. */
@Override
public Shape removeShape(final Shape s) {
final Shape r = shapes.remove(s) ? s : null;
markShapeDirty();
return r;
}
@Override
public Shape removeShape(final int idx) {
final Shape r = shapes.remove(idx);
markShapeDirty();
return r;
}
/** Removes given shape and destroy it. */
public void removeShape(final GL2ES2 gl, final RegionRenderer renderer, final Shape s) {
shapes.remove(s);
s.destroy(gl, renderer);
}
@Override
public void addShapes(final Collection<? extends Shape> shapes) {
for(final Shape s : shapes) {
addShape(s);
}
}
/** Removes all given shapes, keeps them alive. */
@Override
public void removeShapes(final Collection<? extends Shape> shapes) {
for(final Shape s : shapes) {
removeShape(s);
}
}
/** Removes all given shapes and destroys them. */
public void removeShapes(final GL2ES2 gl, final RegionRenderer renderer, final Collection<? extends Shape> shapes) {
for(final Shape s : shapes) {
removeShape(gl, renderer, s);
}
}
@Override
public void removeAllShapes() {
shapes.clear();
}
/** Removes all given shapes and destroys them. */
public void removeAllShapes(final GL2ES2 gl, final RegionRenderer renderer) {
final int count = shapes.size();
for(int i=count-1; i>=0; --i) {
removeShape(gl, renderer, shapes.get(i));
}
}
@Override
public boolean hasColorChannel() {
return false; // FIXME
}
@Override
protected final void clearImpl0(final GL2ES2 gl, final RegionRenderer renderer) {
for(final Shape s : shapes) {
// s.clearImpl0(gl, renderer);;
s.clear(gl, renderer);;
}
}
@Override
protected final void destroyImpl0(final GL2ES2 gl, final RegionRenderer renderer) {
for(final Shape s : shapes) {
// s.destroyImpl0(gl, renderer);
s.destroy(gl, renderer);;
}
if( null != border ) {
border.destroy(gl, renderer);
border = null;
}
}
private boolean doFrustumCulling = false;
@Override
public final void setFrustumCullingEnabled(final boolean v) { doFrustumCulling = v; }
@Override
public final boolean isFrustumCullingEnabled() { return doFrustumCulling; }
@SuppressWarnings({ "unchecked", "rawtypes" })
@Override
protected final void drawImpl0(final GL2ES2 gl, final RegionRenderer renderer, final int[] sampleCount, final Vec4f rgba) {
final PMVMatrix pmv = renderer.getMatrix();
final Object[] shapesS = shapes.toArray();
Arrays.sort(shapesS, (Comparator)Shape.ZAscendingComparator);
final int shapeCount = shapesS.length;
for(int i=0; i<shapeCount; i++) {
final Shape shape = (Shape) shapesS[i];
if( shape.isEnabled() ) {
pmv.glPushMatrix();
shape.setTransform(pmv);
if( !doFrustumCulling || !pmv.getFrustum().isAABBoxOutside( shape.getBounds() ) ) {
if( null == rgba ) {
shape.drawToSelect(gl, renderer, sampleCount);
} else {
shape.draw(gl, renderer, sampleCount);
}
}
pmv.glPopMatrix();
}
}
if( null != border ) {
if( null == rgba ) {
border.drawToSelect(gl, renderer, sampleCount);
} else {
border.draw(gl, renderer, sampleCount);
}
}
}
@Override
protected void validateImpl(final GLProfile glp, final GL2ES2 gl) {
if( isShapeDirty() ) {
// box has been reset
final PMVMatrix pmv = new PMVMatrix();
if( null != layouter ) {
for(final Shape s : shapes) {
if( null != gl ) {
s.validate(gl);
} else {
s.validate(glp);
}
}
layouter.layout(this, box, pmv);
} else {
final AABBox tsbox = new AABBox();
for(final Shape s : shapes) {
if( null != gl ) {
s.validate(gl);
} else {
s.validate(glp);
}
pmv.glPushMatrix();
s.setTransform(pmv);
s.getBounds().transformMv(pmv, tsbox);
pmv.glPopMatrix();
box.resize(tsbox);
}
}
if( hasPadding() ) {
final Padding p = getPadding();
final Vec3f l = box.getLow();
final Vec3f h = box.getHigh();
box.resize(l.x() - p.left, l.y() - p.bottom, l.z());
box.resize(h.x() + p.right, h.y() + p.top, l.z());
setRotationPivot( box.getCenter() );
}
if( hasBorder() ) {
if( null == border ) {
border = new Rectangle(Region.VBAA_RENDERING_BIT, box, getBorderThickness());
} else {
border.setEnabled(true);
border.setBounds(box, getBorderThickness());
}
border.setColor(getBorderColor());
} else if( null != border ) {
border.setEnabled(false);
}
}
}
@Override
public boolean contains(final Shape s) {
if( shapes.contains(s) ) {
return true;
}
for(final Shape shape : shapes) {
if( shape instanceof Container ) {
if( ((Container)shape).contains(s) ) {
return true;
}
}
}
return false;
}
@Override
public AABBox getBounds(final PMVMatrix pmv, final Shape shape) {
pmv.reset();
setTransform(pmv);
final AABBox res = new AABBox();
if( null == shape ) {
return res;
}
forOne(pmv, shape, () -> {
shape.getBounds().transformMv(pmv, res);
});
return res;
}
@Override
public String getSubString() {
return super.getSubString()+", shapes "+shapes.size();
}
@Override
public boolean forOne(final PMVMatrix pmv, final Shape shape, final Runnable action) {
return TreeTool.forOne(shapes, pmv, shape, action);
}
@Override
public boolean forAll(final Visitor1 v) {
return TreeTool.forAll(shapes, v);
}
@Override
public boolean forAll(final PMVMatrix pmv, final Visitor2 v) {
return TreeTool.forAll(shapes, pmv, v);
}
@Override
public boolean forSortedAll(final Comparator<Shape> sortComp, final PMVMatrix pmv, final Visitor2 v) {
return TreeTool.forSortedAll(sortComp, shapes, pmv, v);
}
}
|