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
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
|
/*
* Copyright 1996-2008 Sun Microsystems, Inc. All Rights Reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Sun designates this
* particular file as subject to the "Classpath" exception as provided
* by Sun in the LICENSE file that accompanied this code.
*
* This code 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
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
* CA 95054 USA or visit www.sun.com if you need additional information or
* have any questions.
*
*/
package javax.media.j3d;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
/**
* The switch node controls which one of its children will be rendered.
*/
class SwitchRetained extends GroupRetained implements TargetsInterface
{
static final int GEO_NODES = 0x0001;
static final int ENV_NODES = 0x0002;
static final int BEHAVIOR_NODES = 0x0004;
static final int SOUND_NODES = 0x0008;
static final int BOUNDINGLEAF_NODES = 0x0010;
/**
* The value specifing which child to render.
*/
int whichChild = Switch.CHILD_NONE;
/**
* The BitSet specifying which children are to be selected for
* rendering. This is used ONLY if whichChild is set to CHILD_MASK.
*/
BitSet childMask = new BitSet();
/**
* The childmask bitset used for rendering
*/
BitSet renderChildMask = new BitSet();
// A boolean indication that something changed
boolean isDirty = true;
// switchLevel per key, used in traversing switch children
ArrayList<Integer> switchLevels = new ArrayList<Integer>(1);
// key which identifies a unique path from a locale to this switch link
HashKey switchKey = new HashKey();
// switch index counter to identify specific children
int switchIndexCount = 0;
// for message processing
UpdateTargets updateTargets = null;
ArrayList<ArrayList<SwitchState>> childrenSwitchStates = null;
SwitchRetained() {
this.nodeType = NodeRetained.SWITCH;
}
/**
* Sets which child should be drawn.
* @param whichChild the child to choose during a render operation
*/
// synchronized with clearLive
synchronized void setWhichChild(int whichChild, boolean updateAlways) {
int i, nchildren;
this.whichChild = whichChild;
isDirty = true;
if (source != null && source.isLive()) {
updateTargets = new UpdateTargets();
ArrayList<SwitchState> updateList = new ArrayList<SwitchState>(1);
nchildren = children.size();
switch (whichChild) {
case Switch.CHILD_ALL:
for (i=0; i<nchildren; i++) {
if (renderChildMask.get(i) == false || updateAlways) {
renderChildMask.set(i);
updateSwitchChild(i, true, updateList);
}
}
break;
case Switch.CHILD_NONE:
for (i=0; i<nchildren; i++) {
if (renderChildMask.get(i) == true || updateAlways) {
renderChildMask.clear(i);
updateSwitchChild(i, false, updateList);
}
}
break;
case Switch.CHILD_MASK:
for (i=0; i<nchildren; i++) {
if (childMask.get(i) == true) {
if (renderChildMask.get(i) == false || updateAlways) {
renderChildMask.set(i);
updateSwitchChild(i, true, updateList);
}
} else {
if (renderChildMask.get(i) == true || updateAlways) {
renderChildMask.clear(i);
updateSwitchChild(i, false, updateList);
}
}
}
break;
default:
for (i=0; i<nchildren; i++) {
if (i == whichChild) {
if (renderChildMask.get(i) == false || updateAlways) {
renderChildMask.set(i);
updateSwitchChild(i, true, updateList);
}
} else {
if (renderChildMask.get(i) == true || updateAlways) {
renderChildMask.clear(i);
updateSwitchChild(i, false, updateList);
}
}
}
break;
}
sendMessage(updateList);
}
dirtyBoundsCache();
}
/**
* Returns the index of the current child.
* @return the default child's index
*/
int getWhichChild() {
return this.whichChild;
}
/**
* Sets current childMask.
* @param childMask a BitSet to select the children for rendering
*/
// synchronized with clearLive
synchronized final void setChildMask(BitSet childMask) {
int i, nbits, nchildren;
if (childMask.size() > this.childMask.size()) {
nbits = childMask.size();
} else {
nbits = this.childMask.size();
}
for (i=0; i<nbits; i++) {
if (childMask.get(i)) {
this.childMask.set(i);
} else {
this.childMask.clear(i);
}
}
this.isDirty = true;
if (source != null && source.isLive() &&
whichChild == Switch.CHILD_MASK) {
updateTargets = new UpdateTargets();
ArrayList<SwitchState> updateList = new ArrayList<SwitchState>(1);
nchildren = children.size();
for (i=0; i<nchildren; i++) {
if (childMask.get(i) == true) {
if (renderChildMask.get(i) == false) {
renderChildMask.set(i);
updateSwitchChild(i, true, updateList);
}
} else {
if (renderChildMask.get(i) == true) {
renderChildMask.clear(i);
updateSwitchChild(i, false, updateList);
}
}
}
sendMessage(updateList);
}
dirtyBoundsCache();
}
void sendMessage(ArrayList<SwitchState> updateList) {
J3dMessage m ;
int i,j,size,threads;
Object[] nodesArr, nodes;
threads = updateTargets.computeSwitchThreads();
if (threads > 0) {
m = new J3dMessage();
m.type = J3dMessage.SWITCH_CHANGED;
m.universe = universe;
m.threads = threads;
m.args[0] = updateTargets;
m.args[2] = updateList;
UnorderList blnList =
updateTargets.targetList[Targets.BLN_TARGETS];
if (blnList != null) {
BoundingLeafRetained mbleaf;
size = blnList.size();
Object[] boundingLeafUsersArr = new Object[size];
nodesArr = blnList.toArray(false);
for (j=0; j<size; j++) {
nodes = (Object[])nodesArr[j];
Object[] boundingLeafUsers = new Object[nodes.length];
boundingLeafUsersArr[j] = boundingLeafUsers;
for (i=0; i<nodes.length; i++) {
mbleaf = (BoundingLeafRetained) nodes[i];
boundingLeafUsers[i] = mbleaf.users.toArray();
}
}
m.args[1] = boundingLeafUsersArr;
}
VirtualUniverse.mc.processMessage(m);
}
UnorderList vpList = updateTargets.targetList[Targets.VPF_TARGETS];
if (vpList != null) {
ViewPlatformRetained vp;
size = vpList.size();
nodesArr = vpList.toArray(false);
for (j=0; j<size; j++) {
nodes = (Object[])nodesArr[j];
for (i=0; i<nodes.length; i++) {
vp = (ViewPlatformRetained)nodes[i];
vp.processSwitchChanged();
}
}
}
}
/**
* Returns the current childMask.
* @return the current childMask
*/
final BitSet getChildMask() {
return (BitSet)this.childMask.clone();
}
/**
* Returns the current child.
* @return the current child
*/
Node currentChild() {
if ((whichChild < 0) || (whichChild >= children.size()))
return null;
else
return getChild(whichChild);
}
void updateSwitchChild(int child, boolean switchOn, ArrayList<SwitchState> updateList) {
int i;
int switchLevel;
if (inSharedGroup) {
for (i=0; i<localToVworldKeys.length; i++) {
switchLevel = switchLevels.get(i).intValue();
traverseSwitchChild(child, localToVworldKeys[i], i, this,
false, false, switchOn, switchLevel, updateList);
}
} else {
switchLevel = switchLevels.get(0).intValue();
traverseSwitchChild(child, null, 0, this, false, false,
switchOn, switchLevel, updateList);
}
}
// Switch specific data at SetLive.
@Override
void setAuxData(SetLiveState s, int index, int hkIndex) {
int size;
ArrayList<SwitchState> switchStates;
// Group's setAuxData()
super.setAuxData(s, index, hkIndex);
switchLevels.add(new Integer(s.switchLevels[index]));
int nchildren = children.size();
for (int i=0; i<nchildren; i++) {
switchStates = childrenSwitchStates.get(i);
switchStates.add(hkIndex, new SwitchState(true));
}
}
@Override
void setNodeData(SetLiveState s) {
super.setNodeData(s);
// add this node to parent's childSwitchLink
if (s.childSwitchLinks != null) {
if(!inSharedGroup ||
// only add if not already added in sharedGroup
!s.childSwitchLinks.contains(this)) {
s.childSwitchLinks.add(this);
}
}
// Note that s.childSwitchLinks is updated in super.setLive
s.parentSwitchLink = this;
if (!inSharedGroup) {
setAuxData(s, 0, 0);
} else {
// For inSharedGroup case.
int j, hkIndex;
s.hashkeyIndex = new int[s.keys.length];
for(j=0; j<s.keys.length; j++) {
hkIndex = s.keys[j].equals(localToVworldKeys, 0,
localToVworldKeys.length);
if(hkIndex >= 0) {
setAuxData(s, j, hkIndex);
} else {
MasterControl.getCoreLogger().severe("Can't Find matching hashKey in setNodeData.");
}
s.hashkeyIndex[j] = hkIndex;
}
}
}
@Override
void setLive(SetLiveState s) {
int i,j,k;
boolean switchOn;
SwitchRetained switchRoot;
int size;
// save setLiveState
Targets[] savedSwitchTargets = s.switchTargets;
ArrayList<SwitchState> savedSwitchStates = s.switchStates;
SwitchRetained[] savedClosestSwitchParents = s.closestSwitchParents;
int[] savedClosestSwitchIndices = s.closestSwitchIndices;
ArrayList<NodeRetained> savedChildSwitchLinks = s.childSwitchLinks;
GroupRetained savedParentSwitchLink = s.parentSwitchLink;
int[] savedHashkeyIndex = s.hashkeyIndex;
// update setLiveState for this node
s.closestSwitchParents = (SwitchRetained[])
savedClosestSwitchParents.clone();
s.closestSwitchIndices = Arrays.copyOf(savedClosestSwitchIndices, savedClosestSwitchIndices.length);
// Note that s.containsNodesList is updated in super.setLive
// Note that s.closestSwitchIndices is updated in super.setLive
for (i=0; i< s.switchLevels.length; i++) {
s.switchLevels[i]++;
s.closestSwitchParents[i] = this;
}
super.doSetLive(s);
initRenderChildMask();
// update switch leaves' compositeSwitchMask
// and update switch leaves' switchOn flag if this is top level switch
if (inSharedGroup) {
for (i=0; i<s.keys.length; i++) {
j = s.hashkeyIndex[i];
// j is index in ContainNodes
if (j < localToVworldKeys.length) {
switchRoot = (s.switchLevels[i] == 0)? this : null;
size = children.size();
for (k=0; k<size; k++) {
switchOn = renderChildMask.get(k);
traverseSwitchChild(k, s.keys[i], j, switchRoot, true, false,
switchOn, s.switchLevels[i], null);
}
}
}
} else {
switchRoot = (s.switchLevels[0] == 0)? this : null;
size = children.size();
for (i=0; i<size; i++) {
switchOn = renderChildMask.get(i);
traverseSwitchChild(i, null, 0, switchRoot, true, false,
switchOn, s.switchLevels[0], null);
}
}
// restore setLiveState
s.switchTargets = savedSwitchTargets;
s.switchStates = savedSwitchStates;
s.closestSwitchParents = savedClosestSwitchParents;
s.closestSwitchIndices = savedClosestSwitchIndices;
for (i=0; i< s.switchLevels.length; i++) {
s.switchLevels[i]--;
}
s.childSwitchLinks = savedChildSwitchLinks;
s.parentSwitchLink = savedParentSwitchLink;
s.hashkeyIndex = savedHashkeyIndex;
super.markAsLive();
}
@Override
void removeNodeData(SetLiveState s) {
int numChildren = children.size();
int i, j;
ArrayList<SwitchState> switchStates;
if (refCount <= 0) {
// remove this node from parentSwitchLink's childSwitchLinks
// clear childSwitchLinks
if (parentSwitchLink != null) {
for(i=0; i<parentSwitchLink.childrenSwitchLinks.size();i++) {
ArrayList<NodeRetained> switchLinks = parentSwitchLink.childrenSwitchLinks.get(i);
if (switchLinks.contains(this)) {
switchLinks.remove(this);
break;
}
}
}
for (j=0; j<numChildren; j++) {
switchStates = childrenSwitchStates.get(j);
switchStates.clear();
}
switchLevels.remove(0);
} else {
// remove children dependent data
int hkIndex;
// Must be in reverse, to preserve right indexing.
for (i = s.keys.length-1; i >= 0; i--) {
hkIndex = s.keys[i].equals(localToVworldKeys, 0,
localToVworldKeys.length);
if(hkIndex >= 0) {
for (j=0; j<numChildren; j++) {
switchStates = childrenSwitchStates.get(j);
switchStates.remove(hkIndex);
}
switchLevels.remove(hkIndex);
}
}
}
super.removeNodeData(s);
}
// synchronized with setWhichChild and setChildMask
@Override
synchronized void clearLive(SetLiveState s) {
Targets[] savedSwitchTargets = s.switchTargets;
s.switchTargets = null;
super.clearLive(s);
s.switchTargets = savedSwitchTargets;
}
void initRenderChildMask() {
int i, nchildren;
nchildren = children.size();
switch(whichChild) {
case Switch.CHILD_ALL:
for (i=0; i<nchildren; i++) {
renderChildMask.set(i);
}
break;
case Switch.CHILD_NONE:
for (i=0; i<nchildren; i++) {
renderChildMask.clear(i);
}
break;
case Switch.CHILD_MASK:
for (i=0; i<nchildren; i++) {
if (childMask.get(i) == true) {
renderChildMask.set(i);
} else {
renderChildMask.clear(i);
}
}
break;
default:
for (i=0; i<nchildren; i++) {
if (i == whichChild) {
renderChildMask.set(i);
} else {
renderChildMask.clear(i);
}
}
}
}
void traverseSwitchChild(int child, HashKey key, int index,
SwitchRetained switchRoot, boolean init,
boolean swChanged, boolean switchOn,
int switchLevel, ArrayList<SwitchState> updateList) {
int i,j,k;
SwitchRetained sw;
LinkRetained ln;
Object obj;
boolean newSwChanged = false;
ArrayList<SwitchState> childSwitchStates = childrenSwitchStates.get(child);
SwitchState switchState = childSwitchStates.get(index);
switchState.updateCompositeSwitchMask(switchLevel, switchOn);
if (switchRoot != null) {
if (init) {
if (!switchState.initialized) {
switchState.initSwitchOn();
}
} else {
boolean compositeSwitchOn = switchState.evalCompositeSwitchOn();
if (switchState.cachedSwitchOn != compositeSwitchOn) {
switchState.updateCachedSwitchOn();
switchRoot.updateTargets.addCachedTargets(
switchState.cachedTargets);
newSwChanged = true;
updateList.add(switchState);
}
}
}
ArrayList<NodeRetained> childSwitchLinks = childrenSwitchLinks.get(child);
int cslSize =childSwitchLinks.size();
for (i=0; i<cslSize; i++) {
obj = childSwitchLinks.get(i);
if (obj instanceof SwitchRetained) {
sw = (SwitchRetained)obj;
int swSize = sw.children.size();
for(j=0; j<swSize; j++) {
sw.traverseSwitchChild(j, key, index, switchRoot, init,
newSwChanged, switchOn, switchLevel,
updateList);
}
} else { // LinkRetained
ln = (LinkRetained)obj;
if (key == null) {
switchKey.reset();
switchKey.append(locale.nodeId);
} else {
switchKey.set(key);
}
switchKey.append(LinkRetained.plus).append(ln.nodeId);
if ((ln.sharedGroup != null) &&
(ln.sharedGroup.localToVworldKeys != null)) {
j = switchKey.equals(ln.sharedGroup.localToVworldKeys,0,
ln.sharedGroup.localToVworldKeys.length);
if(j < 0) {
System.err.println("SwitchRetained : Can't find hashKey");
}
if (j<ln.sharedGroup.localToVworldKeys.length) {
int lscSize = ln.sharedGroup.children.size();
for(k=0; k<lscSize; k++) {
ln.sharedGroup.traverseSwitchChild(k, ln.sharedGroup.
localToVworldKeys[j],
j, switchRoot,
init, newSwChanged,
switchOn, switchLevel, updateList);
}
}
}
}
}
}
void traverseSwitchParent() {
boolean switchOn;
int switchLevel;
SwitchRetained switchRoot;
int i,j;
int size;
// first traverse this node's child
if (inSharedGroup) {
for (j=0; j<localToVworldKeys.length; j++) {
switchLevel = switchLevels.get(j).intValue();
switchRoot = (switchLevel == 0)? this : null;
size = children.size();
for (i=0; i<size; i++) {
switchOn = renderChildMask.get(i);
traverseSwitchChild(i, localToVworldKeys[j], j, switchRoot,
true, false, switchOn, switchLevel, null);
}
}
} else {
switchLevel = switchLevels.get(0).intValue();
switchRoot = (switchLevel == 0)? this : null;
size = children.size();
for (i=0; i<size; i++) {
switchOn = renderChildMask.get(i);
traverseSwitchChild(i, null, 0, switchRoot,
true, false, switchOn, switchLevel, null);
}
}
// now traverse this node's parent
if (parentSwitchLink != null) {
if (parentSwitchLink instanceof SwitchRetained) {
((SwitchRetained)parentSwitchLink).traverseSwitchParent();
} else if (parentSwitchLink instanceof SharedGroupRetained) {
((SharedGroupRetained)parentSwitchLink).traverseSwitchParent();
}
}
}
@Override
void computeCombineBounds(Bounds bounds) {
if (boundsAutoCompute) {
if (!VirtualUniverse.mc.cacheAutoComputedBounds) {
if (whichChild == Switch.CHILD_ALL) {
for (int i = 0; i < children.size(); i++) {
NodeRetained child = children.get(i);
if (child != null) {
child.computeCombineBounds(bounds);
}
}
} else if (whichChild == Switch.CHILD_MASK) {
for (int i = 0; i < children.size(); i++) {
if (childMask.get(i)) {
NodeRetained child = children.get(i);
if (child != null) {
child.computeCombineBounds(bounds);
}
}
}
} else if (whichChild != Switch.CHILD_NONE) {
if (whichChild < children.size()) {
NodeRetained child = children.get(whichChild);
if (child != null) {
child.computeCombineBounds(bounds);
}
}
}
} else {
// Issue 514 : NPE in Wonderland : triggered in cached bounds computation
if (!validCachedBounds) {
validCachedBounds = true;
// Issue 544
if (VirtualUniverse.mc.useBoxForGroupBounds) {
cachedBounds = new BoundingBox((Bounds) null);
} else {
cachedBounds = new BoundingSphere((Bounds)null);
}
if (whichChild == Switch.CHILD_ALL) {
for (int i = 0; i < children.size(); i++) {
NodeRetained child = children.get(i);
if (child != null) {
child.computeCombineBounds(cachedBounds);
}
}
} else if (whichChild == Switch.CHILD_MASK) {
for (int i = 0; i < children.size(); i++) {
if (childMask.get(i)) {
NodeRetained child = children.get(i);
if (child != null) {
child.computeCombineBounds(cachedBounds);
}
}
}
} else if (whichChild != Switch.CHILD_NONE) {
if (whichChild < children.size()) {
NodeRetained child = children.get(whichChild);
if (child != null) {
child.computeCombineBounds(cachedBounds);
}
}
}
}
bounds.combine(cachedBounds);
}
} else {
// Should this be lock too ? ( MT safe ? )
synchronized (localBounds) {
bounds.combine(localBounds);
}
}
}
/**
* Gets the bounding object of a node.
* @return the node's bounding object
*/
@Override
Bounds getBounds() {
if (boundsAutoCompute) {
// Issue 514 : NPE in Wonderland : triggered in cached bounds computation
if (validCachedBounds) {
return (Bounds) cachedBounds.clone();
}
// issue 544
Bounds boundingObject = null;
if (VirtualUniverse.mc.useBoxForGroupBounds) {
boundingObject = new BoundingBox((Bounds) null);
} else {
boundingObject = new BoundingSphere((Bounds)null);
}
if (whichChild == Switch.CHILD_ALL) {
for (int i = 0; i < children.size(); i++) {
NodeRetained child = children.get(i);
if (child != null) {
child.computeCombineBounds(boundingObject);
}
}
} else if (whichChild == Switch.CHILD_MASK) {
for (int i = 0; i < children.size(); i++) {
if (childMask.get(i)) {
NodeRetained child = children.get(i);
if (child != null) {
child.computeCombineBounds(boundingObject);
}
}
}
} else if (whichChild != Switch.CHILD_NONE &&
whichChild >= 0 &&
whichChild < children.size()) {
NodeRetained child = children.get(whichChild);
if (child != null) {
child.computeCombineBounds(boundingObject);
}
}
return boundingObject;
} else {
return super.getBounds();
}
}
/*
void compile(CompileState compState) {
setCompiled();
compState.startGroup(null); // don't merge at this level
compileChildren(compState);
compState.endGroup();
}
*/
/**
* Compiles the children of the switch, preventing shape merging at
* this level or above
*/
@Override
void compile(CompileState compState) {
super.compile(compState);
// don't remove this group node
mergeFlag = SceneGraphObjectRetained.DONT_MERGE;
if (J3dDebug.devPhase && J3dDebug.debug) {
compState.numSwitches++;
}
}
@Override
void insertChildrenData(int index) {
if (childrenSwitchStates == null) {
childrenSwitchStates = new ArrayList<ArrayList<SwitchState>>(1);
childrenSwitchLinks = new ArrayList<ArrayList<NodeRetained>>(1);
}
childrenSwitchLinks.add(index, new ArrayList<NodeRetained>(1));
ArrayList<SwitchState> switchStates = new ArrayList<SwitchState>(1);
childrenSwitchStates.add(index, switchStates);
if (source != null && source.isLive()) {
for (int i=0; i<localToVworld.length; i++) {
switchStates.add(new SwitchState(true));
}
}
}
@Override
void appendChildrenData() {
if (childrenSwitchStates == null) {
childrenSwitchStates = new ArrayList<ArrayList<SwitchState>>(1);
childrenSwitchLinks = new ArrayList<ArrayList<NodeRetained>>(1);
}
childrenSwitchLinks.add(new ArrayList<NodeRetained>(1));
ArrayList<SwitchState> switchStates = new ArrayList<SwitchState>(1);
childrenSwitchStates.add(switchStates);
if (source != null && source.isLive()) {
for (int i=0; i<localToVworld.length; i++) {
switchStates.add(new SwitchState(true));
}
}
}
@Override
void removeChildrenData(int index) {
ArrayList<SwitchState> oldSwitchStates = childrenSwitchStates.get(index);
oldSwitchStates.clear();
childrenSwitchStates.remove(index);
ArrayList<NodeRetained> oldSwitchLinks = childrenSwitchLinks.get(index);
oldSwitchLinks.clear();
childrenSwitchLinks.remove(index);
}
@Override
void childDoSetLive(NodeRetained child, int childIndex, SetLiveState s) {
int numPaths = (inSharedGroup)? s.keys.length : 1;
s.childSwitchLinks = childrenSwitchLinks.get(childIndex);
for (int j=0; j< numPaths; j++) {
s.closestSwitchIndices[j] = switchIndexCount;
s.closestSwitchParents[j] = this;
}
// use switchIndexCount instead of child index to avoid
// reordering due to add/remove child later
switchIndexCount++;
Targets[] newTargets = new Targets[numPaths];
for(int i=0; i<numPaths; i++) {
newTargets[i] = new Targets();
}
s.switchTargets = newTargets;
s.switchStates = childrenSwitchStates.get(childIndex);
if(child!=null)
child.setLive(s);
CachedTargets cachedTargets;
SwitchState switchState;
if (! inSharedGroup) {
cachedTargets = s.switchTargets[0].snapShotInit();
switchState = s.switchStates.get(0);
switchState.cachedTargets = cachedTargets;
} else {
for(int i=0; i<numPaths; i++) {
cachedTargets = s.switchTargets[i].snapShotInit();
switchState = s.switchStates.get(s.hashkeyIndex[i]);
switchState.cachedTargets = cachedTargets;
}
}
}
// ***************************
// TargetsInterface methods
// ***************************
@Override
TargetsInterface getClosestTargetsInterface(int type) {
return (type == TargetsInterface.SWITCH_TARGETS)?
(TargetsInterface)this:
(TargetsInterface)parentTransformLink;
}
@Override
public CachedTargets getCachedTargets(int type, int index, int child) {
if (type == TargetsInterface.SWITCH_TARGETS) {
ArrayList<SwitchState> switchStates = childrenSwitchStates.get(child);
if (index < switchStates.size()) {
SwitchState switchState = switchStates.get(index);
return switchState.cachedTargets;
} else {
return null;
}
} else {
System.err.println("getCachedTargets: wrong arguments");
return null;
}
}
@Override
public void resetCachedTargets(int type,
CachedTargets[] newCtArr, int child) {
if (type == TargetsInterface.SWITCH_TARGETS) {
ArrayList<SwitchState> switchStates = childrenSwitchStates.get(child);
if (newCtArr.length != switchStates.size()) {
System.err.println("resetCachedTargets: unmatched length!" +
newCtArr.length + " " + switchStates.size());
System.err.println(" resetCachedTargets: " + this);
}
SwitchState switchState;
for (int i=0; i<newCtArr.length; i++) {
switchState = switchStates.get(i);
switchState.cachedTargets = newCtArr[i];
}
} else {
System.err.println("resetCachedTargets: wrong arguments");
}
}
@Override
public ArrayList<SwitchState> getTargetsData(int type, int child) {
if (type == TargetsInterface.SWITCH_TARGETS) {
return childrenSwitchStates.get(child);
}
else {
System.err.println("getTargetsData: wrong arguments");
return null;
}
}
@Override
public int getTargetThreads(int type) {
System.err.println("getTargetsThreads: wrong arguments");
return -1;
}
@Override
public void updateCachedTargets(int type, CachedTargets[] newCt) {
System.err.println("updateCachedTarget: wrong arguments");
}
@Override
public void computeTargetThreads(int type, CachedTargets[] newCt) {
System.err.println("computeTargetThreads: wrong arguments");
}
@Override
public void updateTargetThreads(int type, CachedTargets[] newCt) {
System.err.println("updateTargetThreads: wrong arguments");
}
@Override
public void propagateTargetThreads(int type, int newTargetThreads) {
System.err.println("propagateTargetThreads: wrong arguments");
}
@Override
public void copyCachedTargets(int type, CachedTargets[] newCt) {
System.err.println("copyCachedTarget: wrong arguments");
}
}
|