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: >> 25 // GEANT4 tag $Name: 27 // 26 // 28 // << 27 // 29 //-------------------------------------------- 28 //--------------------------------------------------------------- 30 // 29 // 31 // G4FastSimulationVector.hh 30 // G4FastSimulationVector.hh 32 // 31 // 33 // Description: 32 // Description: 34 // Extends the STL vector to replace RW. 33 // Extends the STL vector to replace RW. 35 // 34 // 36 // History: 35 // History: 37 // May 00: Verderi && MoraDeFreitas - First 36 // May 00: Verderi && MoraDeFreitas - First Implementation. 38 // 37 // 39 //-------------------------------------------- 38 //--------------------------------------------------------------- 40 39 41 template<class T> << 40 template<class T> 42 T* G4FastSimulationVector<T>::remove(const T* << 41 T* G4FastSimulationVector<T>::remove (const T* a) 43 { 42 { 44 for (auto it = std_pvector::begin(); it < st << 43 for (iterator it = std_pvector::begin();it<std_pvector::end(); it++) 45 if (**it == *a) { << 44 { 46 T* tmp = *it; << 45 if (**it==*a) 47 std_pvector::erase(it); << 46 { 48 return tmp; << 47 T* tmp=*it; >> 48 std_pvector::erase(it); >> 49 return tmp; >> 50 } 49 } 51 } 50 } << 52 return 0; 51 return nullptr; << 52 } 53 } 53 54 54 template<class T> 55 template<class T> 55 T* G4FastSimulationVector<T>::removeAt(G4int i << 56 T* G4FastSimulationVector<T>::removeAt (G4int i) 56 { 57 { 57 auto it = std_pvector::begin(); << 58 iterator it=std_pvector::begin(); 58 int j; 59 int j; 59 for (j = 0; j < i; ++j) << 60 for(j=0;j<i;j++) it++; 60 ++it; << 61 if(it!=std_pvector::end()) 61 if (it != std_pvector::end()) { << 62 { 62 T* tmp = std_pvector::operator[](i); << 63 T* tmp = std_pvector::operator[](i); 63 std_pvector::erase(it); << 64 std_pvector::erase(it); 64 return tmp; << 65 return tmp; 65 } << 66 } 66 return nullptr; << 67 else >> 68 return 0; 67 } 69 } 68 70 69 template<class T> 71 template<class T> 70 void G4FastSimulationVector<T>::clearAndDestro << 72 void G4FastSimulationVector<T>::clearAndDestroy () 71 { 73 { 72 for (auto it = std_pvector::begin(); it < st << 74 for (iterator it = std_pvector::begin();it<std_pvector::end(); it++) 73 if (*it) delete *it; << 75 if(*it) delete *it; 74 std_pvector::clear(); 76 std_pvector::clear(); 75 } 77 } 76 78