| Geant4 Cross Reference |
1 // 1 //
2 // ******************************************* 2 // ********************************************************************
3 // * License and Disclaimer << 3 // * DISCLAIMER *
4 // * 4 // * *
5 // * The Geant4 software is copyright of th << 5 // * The following disclaimer summarizes all the specific disclaimers *
6 // * the Geant4 Collaboration. It is provided << 6 // * of contributors to this software. The specific disclaimers,which *
7 // * conditions of the Geant4 Software License << 7 // * govern, are listed with their locations in: *
8 // * LICENSE and available at http://cern.ch/ << 8 // * http://cern.ch/geant4/license *
9 // * include a list of copyright holders. <<
10 // * 9 // * *
11 // * Neither the authors of this software syst 10 // * Neither the authors of this software system, nor their employing *
12 // * institutes,nor the agencies providing fin 11 // * institutes,nor the agencies providing financial support for this *
13 // * work make any representation or warran 12 // * work make any representation or warranty, express or implied, *
14 // * regarding this software system or assum 13 // * regarding this software system or assume any liability for its *
15 // * use. Please see the license in the file << 14 // * use. *
16 // * for the full disclaimer and the limitatio <<
17 // * 15 // * *
18 // * This code implementation is the result << 16 // * This code implementation is the intellectual property of the *
19 // * technical work of the GEANT4 collaboratio << 17 // * GEANT4 collaboration. *
20 // * By using, copying, modifying or distri << 18 // * By copying, distributing or modifying the Program (or any work *
21 // * any work based on the software) you ag << 19 // * based on the Program) you indicate your acceptance of this *
22 // * use in resulting scientific publicati << 20 // * statement, and all its terms. *
23 // * acceptance of all terms of the Geant4 Sof <<
24 // ******************************************* 21 // ********************************************************************
25 // 22 //
26 // 23 //
>> 24 // $Id: G3RotTable.cc,v 1.15 2001/07/16 15:38:21 gcosmo Exp $
>> 25 // GEANT4 tag $Name: geant4-05-02-patch-01 $
27 // 26 //
28 // by I.Hrivnacova, 27 Sep 99 27 // by I.Hrivnacova, 27 Sep 99
29 28
30 #include "G3RotTable.hh" 29 #include "G3RotTable.hh"
31 30
32 G3RotTable::G3RotTable() 31 G3RotTable::G3RotTable()
33 { 32 {
34 fRotVector = new G3RotMatrixVector(); 33 fRotVector = new G3RotMatrixVector();
35 } 34 }
36 35
37 G3RotTable::~G3RotTable() 36 G3RotTable::~G3RotTable()
38 { 37 {
39 fRotVector->clear(); 38 fRotVector->clear();
40 delete fRotVector; 39 delete fRotVector;
41 } 40 }
42 41
43 G4RotationMatrix* G3RotTable::Get(G4int id) co 42 G4RotationMatrix* G3RotTable::Get(G4int id) const
44 { 43 {
45 for (size_t i=0; i<fRotVector->size(); i++) 44 for (size_t i=0; i<fRotVector->size(); i++) {
46 G3RotTableEntry* rte = (*fRotVector)[i]; 45 G3RotTableEntry* rte = (*fRotVector)[i];
47 if (id == rte->GetID()) return rte->GetMat 46 if (id == rte->GetID()) return rte->GetMatrix();
48 } 47 }
49 return 0; 48 return 0;
50 } 49 }
51 50
52 void G3RotTable::Put(G4int id, G4RotationMatri 51 void G3RotTable::Put(G4int id, G4RotationMatrix* matrix)
53 { 52 {
54 G3RotTableEntry* rte = new G3RotTableEntry(i 53 G3RotTableEntry* rte = new G3RotTableEntry(id, matrix);
55 fRotVector->push_back(rte); 54 fRotVector->push_back(rte);
56 } 55 }
57 56
58 void G3RotTable::Clear() 57 void G3RotTable::Clear()
59 { 58 {
60 G3RotTableEntry* a; 59 G3RotTableEntry* a;
61 while (fRotVector->size()>0) { 60 while (fRotVector->size()>0) {
62 a = fRotVector->back(); 61 a = fRotVector->back();
63 fRotVector->pop_back(); 62 fRotVector->pop_back();
64 for (G3RotMatrixVector::iterator i=fRotVec 63 for (G3RotMatrixVector::iterator i=fRotVector->begin();
65 i!=fRotVe << 64 i!=fRotVector->end(); i++){
66 if (*i==a) { 65 if (*i==a) {
67 i = fRotVector->erase(i); << 66 fRotVector->erase(i);
68 } << 67 i--;
69 else { <<
70 ++i; <<
71 } 68 }
72 } 69 }
73 if ( a ) delete a; 70 if ( a ) delete a;
74 } 71 }
75 } 72 }
76 73