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 // G4DataVector << 27 // 23 // 28 // Class description: << 24 // $Id: G4DataVector.hh,v 1.8.2.1 2001/06/28 19:10:02 gunter Exp $ >> 25 // GEANT4 tag $Name: $ >> 26 // >> 27 // >> 28 // ------------------------------------------------------------ >> 29 // GEANT 4 class header file >> 30 // ------------------------------------------------------------ >> 31 // >> 32 // Class Description: >> 33 // >> 34 // Utility class providing similar behaviour of vector<G4double>. >> 35 // It includes additional methods for compatibility with Rogue Wave >> 36 // collection. 29 // 37 // 30 // Utility class providing similar behaviour o << 31 // It includes additional methods for compatib << 32 // collection. << 33 << 34 // Author: H.Kurashige, 18 September 2001 << 35 // ------------------------------------------- << 36 #ifndef G4DataVector_hh << 37 #define G4DataVector_hh 1 << 38 38 39 #include <fstream> << 39 #ifndef G4DataVector_h 40 #include <iostream> << 40 #define G4DataVector_h 1 41 #include <vector> << 42 41 43 #include "G4ios.hh" << 44 #include "globals.hh" 42 #include "globals.hh" >> 43 #include "g4std/vector" 45 44 46 class G4DataVector : public std::vector<G4doub << 45 class G4DataVector : public G4std::vector<G4double> 47 { 46 { 48 public: << 49 G4DataVector() = default; << 50 // Default constructor. << 51 47 52 G4DataVector(const G4DataVector&) = default; << 48 public: // with description 53 G4DataVector(G4DataVector&&) = default; << 54 // Default copy&move constructors. << 55 49 56 explicit G4DataVector(std::size_t cap); << 50 G4DataVector(); 57 // Constructor given a 'capacity' defining t << 51 // Default constructor. 58 52 59 G4DataVector(std::size_t cap, G4double value << 53 G4DataVector(size_t capacity); 60 // Constructor given a 'capacity' defining t << 54 // Constructor given a 'capacity' defining the initial number of elements. 61 // and initialising them to 'value'. << 62 55 63 virtual ~G4DataVector() = default; << 56 G4DataVector(size_t capacity, G4double value); 64 // Empty destructor << 57 // Constructor given a 'capacity' defining the initial number of elements >> 58 // and initialising them to 'value'. 65 59 66 G4DataVector& operator=(const G4DataVector&) << 60 virtual ~G4DataVector(){;} 67 G4DataVector& operator=(G4DataVector&&) = de << 61 // Empty destructor 68 // Default copy&move assignment operators. << 69 62 70 inline void insertAt(std::size_t, const G4do << 63 inline void insertAt(size_t, const G4double&); 71 // Insert an element at given position << 64 // Insert an element at given position 72 65 73 inline std::size_t index(const G4double&) co << 66 inline size_t index(const G4double&); 74 // Returns back index of the element same as << 67 // Returns back index of the element same as given value 75 68 76 inline G4bool contains(const G4double&) cons 69 inline G4bool contains(const G4double&) const; 77 // Returns 'true' if it contains the element << 70 // Returns 'true' if it contains the element same as given value 78 71 79 inline G4bool remove(const G4double&); 72 inline G4bool remove(const G4double&); 80 // Removes the first element same as given v << 73 // Removes the first element same as given value >> 74 >> 75 inline size_t removeAll(const G4double&); >> 76 // Remove all elements same as given value >> 77 }; 81 78 82 inline std::size_t removeAll(const G4double& << 79 inline 83 // Remove all elements same as given value << 80 G4DataVector::G4DataVector() >> 81 : G4std::vector<G4double>() >> 82 { >> 83 } 84 84 85 enum << 85 inline 86 { << 86 G4DataVector::G4DataVector(size_t capacity) 87 T_G4DataVector = 100 << 87 : G4std::vector<G4double>(capacity) 88 }; << 88 { >> 89 } 89 90 90 G4bool Store(std::ofstream& fOut, G4bool asc << 91 inline 91 G4bool Retrieve(std::ifstream& fIn, G4bool a << 92 G4DataVector::G4DataVector(size_t capacity, G4double value) 92 // To store/retrieve persistent data to/from << 93 : G4std::vector<G4double>(capacity, value) >> 94 { >> 95 } 93 96 94 friend std::ostream& operator<<(std::ostream << 97 inline 95 }; << 98 void G4DataVector::insertAt(size_t pos, const G4double& a) >> 99 { >> 100 iterator i = begin(); >> 101 for (size_t ptn=0; (ptn<pos)&&(i!=end()); i++,ptn++); >> 102 if (i==end()) >> 103 push_back(a); >> 104 else >> 105 insert(i,a); >> 106 } >> 107 >> 108 inline >> 109 size_t G4DataVector::index(const G4double& a) >> 110 { >> 111 size_t ptn = 0; >> 112 for (iterator i=begin(); i!=end(); i++,ptn++) >> 113 if (*i==a) return ptn; >> 114 >> 115 return (ptn=~(size_t)0); >> 116 } >> 117 >> 118 inline >> 119 G4bool G4DataVector::contains(const G4double& a) const >> 120 { >> 121 for (const_iterator i=begin(); i!=end(); i++) >> 122 if (*i==a) return true; >> 123 >> 124 return false; >> 125 } >> 126 >> 127 inline >> 128 G4bool G4DataVector::remove(const G4double& a) >> 129 { >> 130 G4bool found =false; >> 131 >> 132 for (iterator i=begin(); i!=end(); i++){ >> 133 if (*i==a) { >> 134 erase(i); >> 135 found = true; >> 136 break; >> 137 } >> 138 } >> 139 return found; >> 140 } >> 141 >> 142 inline >> 143 size_t G4DataVector::removeAll(const G4double& a) >> 144 { >> 145 size_t ptn=0; 96 146 97 #include "G4DataVector.icc" << 147 for (iterator i=begin(); i!=end(); i++){ >> 148 if (*i==a) { >> 149 erase(i); >> 150 ptn++; >> 151 i--; >> 152 } >> 153 } >> 154 return ptn; >> 155 } 98 156 99 #endif 157 #endif 100 158