| 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 // G4ProcessVector inline methods implementati <<
27 // 26 //
28 // Authors: G.Cosmo, H.Kurashige - 1998 << 27 // $Id$
29 // ------------------------------------------- << 28 //
30 << 29 inline G4bool G4ProcessVector::operator==(const G4ProcessVector &right) const
31 inline G4bool G4ProcessVector::operator==(cons <<
32 { 30 {
33 return (this == (G4ProcessVector *) &right); 31 return (this == (G4ProcessVector *) &right);
34 } 32 }
35 33
36 inline std::size_t G4ProcessVector::entries() << 34 inline G4int G4ProcessVector::entries() const
37 { 35 {
38 return pProcVector->size(); 36 return pProcVector->size();
39 } 37 }
40 38
41 inline std::size_t G4ProcessVector::size() con << 39 inline G4int G4ProcessVector::size() const
42 { 40 {
43 return pProcVector->size(); 41 return pProcVector->size();
44 } 42 }
45 43
46 inline std::size_t G4ProcessVector::length() c << 44 inline G4int G4ProcessVector::length() const
47 { 45 {
48 return pProcVector->size(); 46 return pProcVector->size();
49 } 47 }
50 48
>> 49 inline G4int G4ProcessVector::index(G4VProcess* aProcess) const
>> 50 {
>> 51 G4ProcVector::iterator it;
>> 52 size_t j=0;
>> 53 for (it=pProcVector->begin();it!=pProcVector->end(); ++j,it++) {
>> 54 if (*(*it)==*aProcess) return j;
>> 55 }
>> 56 return -1;
>> 57 }
>> 58
>> 59 inline G4bool G4ProcessVector::contains(G4VProcess* aProcess) const
>> 60 {
>> 61 G4ProcVector::iterator it;
>> 62 for (it=pProcVector->begin();it!=pProcVector->end(); it++) {
>> 63 if (*(*it)==*aProcess) return true;
>> 64 }
>> 65 return false;
>> 66 }
>> 67
51 inline G4bool G4ProcessVector::insert(G4VProce 68 inline G4bool G4ProcessVector::insert(G4VProcess* aProcess)
52 { 69 {
53 pProcVector->push_back(aProcess); 70 pProcVector->push_back(aProcess);
54 return true; 71 return true;
55 } 72 }
56 73
>> 74 inline G4bool G4ProcessVector::insertAt(G4int i,G4VProcess* aProcess)
>> 75 {
>> 76 if ( (i<0) || (i>G4int(pProcVector->size())) ) return false;
>> 77 if (i==G4int(pProcVector->size())) {
>> 78 pProcVector->push_back(aProcess);
>> 79 } else {
>> 80 G4ProcVector::iterator it=pProcVector->begin();
>> 81 int j;
>> 82 for(j=0;j!=i;++j) it++;
>> 83 pProcVector->insert(it, aProcess);
>> 84 }
>> 85 return true;
>> 86 }
>> 87
>> 88 inline G4VProcess* G4ProcessVector::removeAt(G4int i)
>> 89 {
>> 90 G4ProcVector::iterator it=pProcVector->begin();
>> 91 for(size_t j=0;j<pProcVector->size() && G4int(j)<i;++j) it++;
>> 92 G4VProcess* rValue = *it;
>> 93 pProcVector->erase(it);
>> 94 return rValue;
>> 95 }
>> 96
57 inline G4VProcess* G4ProcessVector::removeLast 97 inline G4VProcess* G4ProcessVector::removeLast()
58 { 98 {
59 G4VProcess* rValue = pProcVector->back(); 99 G4VProcess* rValue = pProcVector->back();
60 pProcVector->pop_back(); 100 pProcVector->pop_back();
61 return rValue; 101 return rValue;
62 } 102 }
63 103
64 inline void G4ProcessVector::clear() 104 inline void G4ProcessVector::clear()
65 { 105 {
66 pProcVector->clear(); 106 pProcVector->clear();
67 } 107 }
68 108
69 inline G4VProcess* const& G4ProcessVector::ope 109 inline G4VProcess* const& G4ProcessVector::operator[](G4int i) const
70 { 110 {
71 return (*pProcVector)[i]; 111 return (*pProcVector)[i];
72 } 112 }
73 113
74 inline G4VProcess* const& G4ProcessVector::ope 114 inline G4VProcess* const& G4ProcessVector::operator()(G4int i) const
75 { 115 {
76 return (*pProcVector)[i]; 116 return (*pProcVector)[i];
77 } 117 }
78 118
79 inline G4VProcess* & G4ProcessVector::operator 119 inline G4VProcess* & G4ProcessVector::operator[](G4int i)
80 { 120 {
81 return (*pProcVector)[i]; 121 return (*pProcVector)[i];
82 } 122 }
83 123
84 inline G4VProcess* & G4ProcessVector::operator 124 inline G4VProcess* & G4ProcessVector::operator()(G4int i)
85 { 125 {
86 return (*pProcVector)[i]; 126 return (*pProcVector)[i];
87 } 127 }
>> 128
>> 129
>> 130
>> 131
88 132