| Geant4 Cross Reference |
1 // 1 //
2 // ******************************************* 2 // ********************************************************************
3 // * License and Disclaimer 3 // * License and Disclaimer *
4 // * 4 // * *
5 // * The Geant4 software is copyright of th 5 // * The Geant4 software is copyright of the Copyright Holders of *
6 // * the Geant4 Collaboration. It is provided 6 // * the Geant4 Collaboration. It is provided under the terms and *
7 // * conditions of the Geant4 Software License 7 // * conditions of the Geant4 Software License, included in the file *
8 // * LICENSE and available at http://cern.ch/ 8 // * LICENSE and available at http://cern.ch/geant4/license . These *
9 // * include a list of copyright holders. 9 // * include a list of copyright holders. *
10 // * 10 // * *
11 // * Neither the authors of this software syst 11 // * Neither the authors of this software system, nor their employing *
12 // * institutes,nor the agencies providing fin 12 // * institutes,nor the agencies providing financial support for this *
13 // * work make any representation or warran 13 // * work make any representation or warranty, express or implied, *
14 // * regarding this software system or assum 14 // * regarding this software system or assume any liability for its *
15 // * use. Please see the license in the file 15 // * use. Please see the license in the file LICENSE and URL above *
16 // * for the full disclaimer and the limitatio 16 // * for the full disclaimer and the limitation of liability. *
17 // * 17 // * *
18 // * This code implementation is the result 18 // * This code implementation is the result of the scientific and *
19 // * technical work of the GEANT4 collaboratio 19 // * technical work of the GEANT4 collaboration. *
20 // * By using, copying, modifying or distri 20 // * By using, copying, modifying or distributing the software (or *
21 // * any work based on the software) you ag 21 // * any work based on the software) you agree to acknowledge its *
22 // * use in resulting scientific publicati 22 // * use in resulting scientific publications, and indicate your *
23 // * acceptance of all terms of the Geant4 Sof 23 // * acceptance of all terms of the Geant4 Software license. *
24 // ******************************************* 24 // ********************************************************************
25 // 25 //
26 // 26 //
27 // 27 //
>> 28 // $Id: SoDetectorTreeKit.cc,v 1.13 2006/06/29 21:22:51 gunter Exp $
>> 29 // GEANT4 tag $Name: geant4-08-03-patch-01 $
28 // 30 //
29 /*-----------------------------HEPVis--------- 31 /*-----------------------------HEPVis----------------------------------------*/
30 /* 32 /* */
31 /* Node: SoDetectorTreeKit 33 /* Node: SoDetectorTreeKit */
32 /* Description: Represents a single sided 34 /* Description: Represents a single sided silicon strip detector */
33 /* Author: Joe Boudreau Nov 11 1996 35 /* Author: Joe Boudreau Nov 11 1996 */
34 /* 36 /* */
35 /*-------------------------------------------- 37 /*---------------------------------------------------------------------------*/
36 38
>> 39 #ifdef G4VIS_BUILD_OI_DRIVER
>> 40
37 // this : 41 // this :
38 #include "HEPVis/nodekits/SoDetectorTreeKit.h" 42 #include "HEPVis/nodekits/SoDetectorTreeKit.h"
39 43
40 #include <Inventor/SoPickedPoint.h> 44 #include <Inventor/SoPickedPoint.h>
41 #include <Inventor/nodes/SoSeparator.h> 45 #include <Inventor/nodes/SoSeparator.h>
42 #include <Inventor/nodes/SoPickStyle.h> 46 #include <Inventor/nodes/SoPickStyle.h>
43 #include <Inventor/nodes/SoDrawStyle.h> 47 #include <Inventor/nodes/SoDrawStyle.h>
44 #include <Inventor/nodes/SoSwitch.h> 48 #include <Inventor/nodes/SoSwitch.h>
45 #include <Inventor/nodes/SoMaterial.h> 49 #include <Inventor/nodes/SoMaterial.h>
46 #include <Inventor/nodes/SoUnits.h> 50 #include <Inventor/nodes/SoUnits.h>
47 #include <Inventor/nodes/SoTransform.h> 51 #include <Inventor/nodes/SoTransform.h>
48 #include <Inventor/nodes/SoEventCallback.h> 52 #include <Inventor/nodes/SoEventCallback.h>
49 #include <Inventor/nodekits/SoSeparatorKit.h> 53 #include <Inventor/nodekits/SoSeparatorKit.h>
50 #include <Inventor/nodekits/SoShapeKit.h> 54 #include <Inventor/nodekits/SoShapeKit.h>
51 #include <Inventor/nodekits/SoAppearanceKit.h> 55 #include <Inventor/nodekits/SoAppearanceKit.h>
52 #include <Inventor/nodekits/SoNodeKitListPart. 56 #include <Inventor/nodekits/SoNodeKitListPart.h>
53 #include <Inventor/nodekits/SoBaseKit.h> 57 #include <Inventor/nodekits/SoBaseKit.h>
54 #include <Inventor/nodes/SoTexture2Transform.h 58 #include <Inventor/nodes/SoTexture2Transform.h>
55 #include <Inventor/events/SoMouseButtonEvent.h 59 #include <Inventor/events/SoMouseButtonEvent.h>
56 #include <Inventor/actions/SoHandleEventAction 60 #include <Inventor/actions/SoHandleEventAction.h>
57 61
58 #include <HEPVis/actions/SoAlternateRepAction. 62 #include <HEPVis/actions/SoAlternateRepAction.h>
59 63
60 #include <cmath> 64 #include <cmath>
61 65
62 // This statement is required 66 // This statement is required
63 SO_KIT_SOURCE(SoDetectorTreeKit) 67 SO_KIT_SOURCE(SoDetectorTreeKit)
64 68
65 // initClass 69 // initClass
66 void SoDetectorTreeKit::initClass(){ 70 void SoDetectorTreeKit::initClass(){
67 static bool first = true; << 71 SO_KIT_INIT_CLASS(SoDetectorTreeKit,SoBaseKit,"BaseKit");
68 if (first) { <<
69 first = false; <<
70 SO_KIT_INIT_CLASS(SoDetectorTreeKit,SoBase <<
71 } <<
72 } 72 }
73 73
74 // Constructor 74 // Constructor
75 SoDetectorTreeKit::SoDetectorTreeKit() { 75 SoDetectorTreeKit::SoDetectorTreeKit() {
76 SO_KIT_CONSTRUCTOR(SoDetectorTreeKit); 76 SO_KIT_CONSTRUCTOR(SoDetectorTreeKit);
77 77
78 SO_NODE_ADD_FIELD(alternateRep, (NULL)); 78 SO_NODE_ADD_FIELD(alternateRep, (NULL));
79 79
80 SO_KIT_ADD_CATALOG_ENTRY ( topSepara 80 SO_KIT_ADD_CATALOG_ENTRY ( topSeparator, SoSeparator, FALSE, this,\0, FALSE);
81 SO_KIT_ADD_CATALOG_ENTRY ( pickSt 81 SO_KIT_ADD_CATALOG_ENTRY ( pickStyle, SoSeparator, TRUE , topSeparator,\0, TRUE);
82 SO_KIT_ADD_CATALOG_ENTRY ( appeara 82 SO_KIT_ADD_CATALOG_ENTRY ( appearance, SoAppearanceKit, TRUE, topSeparator ,\0, TRUE);
83 SO_KIT_ADD_CATALOG_ENTRY ( un 83 SO_KIT_ADD_CATALOG_ENTRY ( units, SoUnits, TRUE, topSeparator ,\0, TRUE);
84 SO_KIT_ADD_CATALOG_ENTRY ( transf 84 SO_KIT_ADD_CATALOG_ENTRY ( transform, SoTransform, TRUE , topSeparator,\0, TRUE);
85 SO_KIT_ADD_CATALOG_ENTRY (texture2Transf 85 SO_KIT_ADD_CATALOG_ENTRY (texture2Transform, SoTexture2Transform, TRUE, topSeparator ,\0, TRUE);
86 SO_KIT_ADD_CATALOG_ENTRY ( childL 86 SO_KIT_ADD_CATALOG_ENTRY ( childList, SoSwitch, FALSE, topSeparator,\0, FALSE);
87 SO_KIT_ADD_CATALOG_ENTRY ( previewSepara 87 SO_KIT_ADD_CATALOG_ENTRY ( previewSeparator, SoSeparator, FALSE, childList,\0, TRUE);
88 SO_KIT_ADD_CATALOG_ENTRY ( fullSepara 88 SO_KIT_ADD_CATALOG_ENTRY ( fullSeparator, SoSeparator, FALSE, childList,\0, TRUE);
89 89
90 SO_KIT_INIT_INSTANCE(); 90 SO_KIT_INIT_INSTANCE();
91 createInitialTree(); 91 createInitialTree();
92 } 92 }
93 93
94 // Destructor 94 // Destructor
95 SoDetectorTreeKit::~SoDetectorTreeKit() { 95 SoDetectorTreeKit::~SoDetectorTreeKit() {
96 } 96 }
97 97
98 98
99 SbBool SoDetectorTreeKit::affectsState() const 99 SbBool SoDetectorTreeKit::affectsState() const {
100 return FALSE; 100 return FALSE;
101 } 101 }
102 102
103 void SoDetectorTreeKit::createInitialTree() { 103 void SoDetectorTreeKit::createInitialTree() {
104 104
105 SoEventCallback *myCallback = new SoEventCal 105 SoEventCallback *myCallback = new SoEventCallback();
106 myCallback->addEventCallback(SoMouseButtonEv 106 myCallback->addEventCallback(SoMouseButtonEvent::getClassTypeId(),
107 SoDetectorTreeK 107 SoDetectorTreeKit::expand,
108 this); 108 this);
109 myCallback->addEventCallback(SoMouseButtonEv 109 myCallback->addEventCallback(SoMouseButtonEvent::getClassTypeId(),
110 SoDetectorTreeK 110 SoDetectorTreeKit::contract ,
111 this); 111 this);
112 if(setPart("callbackList[0]",myCallback)==FA 112 if(setPart("callbackList[0]",myCallback)==FALSE) myCallback->unref();
113 113
114 SoSwitch *theChildList = (SoSwitch *) childL 114 SoSwitch *theChildList = (SoSwitch *) childList.getValue();
115 theChildList->whichChild.setValue(0); 115 theChildList->whichChild.setValue(0);
116 } 116 }
117 117
118 void SoDetectorTreeKit::expand(void *userData, 118 void SoDetectorTreeKit::expand(void *userData, SoEventCallback *eventCB){
119 119
120 // Was the event previously handled? Is it t 120 // Was the event previously handled? Is it the right kind?
121 121
122 if (eventCB->isHandled()) return; 122 if (eventCB->isHandled()) return;
123 const SoMouseButtonEvent *event= (SoMouseBut 123 const SoMouseButtonEvent *event= (SoMouseButtonEvent *) eventCB->getEvent();
124 if (!SoMouseButtonEvent::isButtonPressEvent( 124 if (!SoMouseButtonEvent::isButtonPressEvent(event,SoMouseButtonEvent::BUTTON1)) return;
125 if (!event->wasCtrlDown()) return; 125 if (!event->wasCtrlDown()) return;
126 if (event->wasShiftDown()) return; 126 if (event->wasShiftDown()) return;
127 127
128 // Which Detector is this being called for? 128 // Which Detector is this being called for?
129 SoDetectorTreeKit* This = (SoDetectorTreeKit 129 SoDetectorTreeKit* This = (SoDetectorTreeKit *) userData;
130 130
131 // Find out whether that's the one that has 131 // Find out whether that's the one that has been picked.
132 // "This' is the lowest detector tree kit in 132 // "This' is the lowest detector tree kit in the hierarchy.
133 SoHandleEventAction *handleEventAction = eve 133 SoHandleEventAction *handleEventAction = eventCB->getAction();
134 const SoPickedPoint *pickedPoint = handleEve 134 const SoPickedPoint *pickedPoint = handleEventAction->getPickedPoint();
135 if (!pickedPoint) return; 135 if (!pickedPoint) return;
136 136
137 SoFullPath* path = (SoFullPath*)pickedPoint- 137 SoFullPath* path = (SoFullPath*)pickedPoint->getPath();
138 SoNode *ancestorNode=NULL; 138 SoNode *ancestorNode=NULL;
139 for (int i=0;i<path->getLength();i++) { 139 for (int i=0;i<path->getLength();i++) {
140 ancestorNode = path->getNodeFromTail(i); 140 ancestorNode = path->getNodeFromTail(i);
141 if (ancestorNode->isOfType(SoDetectorTreeK 141 if (ancestorNode->isOfType(SoDetectorTreeKit::getClassTypeId())) break;
142 } 142 }
143 if (This!=ancestorNode) return; 143 if (This!=ancestorNode) return;
144 // if (!ancestorNode->isOfType(SoDetectorTr 144 // if (!ancestorNode->isOfType(SoDetectorTreeKit::getClassTypeId())) return;
145 145
146 // Deactivate the Preview 146 // Deactivate the Preview
147 This->setPreview(FALSE); 147 This->setPreview(FALSE);
148 eventCB->setHandled(); 148 eventCB->setHandled();
149 149
150 } 150 }
151 151
152 void SoDetectorTreeKit::contract(void *userDat 152 void SoDetectorTreeKit::contract(void *userData, SoEventCallback *eventCB){
153 153
154 // Was the event previously handled? Is it t 154 // Was the event previously handled? Is it the right kind?
155 if (eventCB->isHandled()) return; 155 if (eventCB->isHandled()) return;
156 const SoMouseButtonEvent *event= (SoMouseBut 156 const SoMouseButtonEvent *event= (SoMouseButtonEvent *) eventCB->getEvent();
157 if (!SoMouseButtonEvent::isButtonPressEvent( 157 if (!SoMouseButtonEvent::isButtonPressEvent(event,SoMouseButtonEvent::BUTTON1)) return;
158 if (event->wasCtrlDown()) return; 158 if (event->wasCtrlDown()) return;
159 if (!event->wasShiftDown()) return; 159 if (!event->wasShiftDown()) return;
160 160
161 // Which Detector is this being called for? 161 // Which Detector is this being called for?
162 SoDetectorTreeKit* This = (SoDetectorTreeKit 162 SoDetectorTreeKit* This = (SoDetectorTreeKit *) userData;
163 163
164 // Find out whether that's the one that has 164 // Find out whether that's the one that has been picked
165 SoHandleEventAction *handleEventAction = eve 165 SoHandleEventAction *handleEventAction = eventCB->getAction();
166 const SoPickedPoint *pickedPoint = handleEve 166 const SoPickedPoint *pickedPoint = handleEventAction->getPickedPoint();
167 if (!pickedPoint) return; 167 if (!pickedPoint) return;
168 168
169 // Find out whether that's the one that has 169 // Find out whether that's the one that has been picked.
170 // "This" is the lowest detector tree kit in 170 // "This" is the lowest detector tree kit in the hierarchy.
171 SoFullPath* path = (SoFullPath*)pickedPoint- 171 SoFullPath* path = (SoFullPath*)pickedPoint->getPath();
172 SoNode *ancestorNode=NULL; 172 SoNode *ancestorNode=NULL;
173 SbBool firstTreeFound=FALSE; 173 SbBool firstTreeFound=FALSE;
174 for (int i=0;i<path->getLength();i++) { 174 for (int i=0;i<path->getLength();i++) {
175 ancestorNode = path->getNodeFromTail(i); 175 ancestorNode = path->getNodeFromTail(i);
176 if (ancestorNode->isOfType(SoDetectorTreeK 176 if (ancestorNode->isOfType(SoDetectorTreeKit::getClassTypeId())) {
177 if (!firstTreeFound) { 177 if (!firstTreeFound) {
178 if (This!=ancestorNode) return; 178 if (This!=ancestorNode) return;
179 firstTreeFound=TRUE; 179 firstTreeFound=TRUE;
180 } 180 }
181 SoDetectorTreeKit *That = (SoDetectorTre 181 SoDetectorTreeKit *That = (SoDetectorTreeKit *) ancestorNode;
182 if (!That->getPreview()) { 182 if (!That->getPreview()) {
183 That->setPreview(TRUE); 183 That->setPreview(TRUE);
184 eventCB->setHandled(); 184 eventCB->setHandled();
185 return; 185 return;
186 } 186 }
187 } 187 }
188 } 188 }
189 } 189 }
190 190
191 void SoDetectorTreeKit::setPreview(SbBool Flag 191 void SoDetectorTreeKit::setPreview(SbBool Flag) {
192 SoSwitch *theChildList = (SoSwitch *) childL 192 SoSwitch *theChildList = (SoSwitch *) childList.getValue();
193 if (Flag) { 193 if (Flag) {
194 theChildList->whichChild.setValue(0); 194 theChildList->whichChild.setValue(0);
195 } 195 }
196 else { 196 else {
197 theChildList->whichChild.setValue(1); 197 theChildList->whichChild.setValue(1);
198 } 198 }
199 } 199 }
200 200
201 SbBool SoDetectorTreeKit::getPreview() const { 201 SbBool SoDetectorTreeKit::getPreview() const {
202 SoSwitch *theChildList = (SoSwitch *) childL 202 SoSwitch *theChildList = (SoSwitch *) childList.getValue();
203 if (theChildList->whichChild.getValue()==0) 203 if (theChildList->whichChild.getValue()==0) return TRUE;
204 return FALSE; 204 return FALSE;
205 } 205 }
206 206
207 207
208 void SoDetectorTreeKit::setPreviewAndFull() { 208 void SoDetectorTreeKit::setPreviewAndFull() {
209 SoSwitch *theChildList = (SoSwitch *) childL 209 SoSwitch *theChildList = (SoSwitch *) childList.getValue();
210 theChildList->whichChild.setValue(SO_SWITCH_ 210 theChildList->whichChild.setValue(SO_SWITCH_ALL);
211 } 211 }
212 212
213 SoSeparator *SoDetectorTreeKit::getPreviewSepa 213 SoSeparator *SoDetectorTreeKit::getPreviewSeparator() const {
214 return (SoSeparator *) previewSeparator.getV 214 return (SoSeparator *) previewSeparator.getValue();
215 } 215 }
216 216
217 SoSeparator *SoDetectorTreeKit::getFullSeparat 217 SoSeparator *SoDetectorTreeKit::getFullSeparator() const {
218 return (SoSeparator *) fullSeparator.getValu 218 return (SoSeparator *) fullSeparator.getValue();
219 } 219 }
220 220
221 221
222 222
223 223
224 // generateAlternateRep 224 // generateAlternateRep
225 void SoDetectorTreeKit::generateAlternateRep() 225 void SoDetectorTreeKit::generateAlternateRep() {
226 alternateRep.setValue(topSeparator.getValue( 226 alternateRep.setValue(topSeparator.getValue());
227 } 227 }
228 228
229 void SoDetectorTreeKit::clearAlternateRep() { 229 void SoDetectorTreeKit::clearAlternateRep() {
230 alternateRep.setValue(NULL); 230 alternateRep.setValue(NULL);
231 } 231 }
232 ////////////////////////////////////////////// 232 //////////////////////////////////////////////////////////////////////////////
233 void SoDetectorTreeKit::doAction( 233 void SoDetectorTreeKit::doAction(
234 SoAction* aAction 234 SoAction* aAction
235 ) 235 )
236 ////////////////////////////////////////////// 236 //////////////////////////////////////////////////////////////////////////////
237 //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! 237 //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!//
238 { 238 {
239 SO_ALTERNATEREP_DO_ACTION(aAction) 239 SO_ALTERNATEREP_DO_ACTION(aAction)
240 SoBaseKit::doAction(aAction); 240 SoBaseKit::doAction(aAction);
241 } 241 }
>> 242
>> 243 #endif
242 244