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