| 1 | //
|
|---|
| 2 | // ********************************************************************
|
|---|
| 3 | // * License and Disclaimer *
|
|---|
| 4 | // * *
|
|---|
| 5 | // * The Geant4 software is copyright of the Copyright Holders of *
|
|---|
| 6 | // * the Geant4 Collaboration. It is provided under the terms and *
|
|---|
| 7 | // * conditions of the Geant4 Software License, included in the file *
|
|---|
| 8 | // * LICENSE and available at http://cern.ch/geant4/license . These *
|
|---|
| 9 | // * include a list of copyright holders. *
|
|---|
| 10 | // * *
|
|---|
| 11 | // * Neither the authors of this software system, nor their employing *
|
|---|
| 12 | // * institutes,nor the agencies providing financial support for this *
|
|---|
| 13 | // * work make any representation or warranty, express or implied, *
|
|---|
| 14 | // * regarding this software system or assume any liability for its *
|
|---|
| 15 | // * use. Please see the license in the file LICENSE and URL above *
|
|---|
| 16 | // * for the full disclaimer and the limitation of liability. *
|
|---|
| 17 | // * *
|
|---|
| 18 | // * This code implementation is the result of the scientific and *
|
|---|
| 19 | // * technical work of the GEANT4 collaboration. *
|
|---|
| 20 | // * By using, copying, modifying or distributing the software (or *
|
|---|
| 21 | // * any work based on the software) you agree to acknowledge its *
|
|---|
| 22 | // * use in resulting scientific publications, and indicate your *
|
|---|
| 23 | // * acceptance of all terms of the Geant4 Software license. *
|
|---|
| 24 | // ********************************************************************
|
|---|
| 25 | //
|
|---|
| 26 | //
|
|---|
| 27 | // $Id: G4ProcessVector.icc,v 1.5 2006/06/29 21:07:42 gunter Exp $
|
|---|
| 28 | // GEANT4 tag $Name: geant4-09-03-beta-cand-01 $
|
|---|
| 29 | //
|
|---|
| 30 | inline G4bool G4ProcessVector::operator==(const G4ProcessVector &right) const
|
|---|
| 31 | {
|
|---|
| 32 | return (this == (G4ProcessVector *) &right);
|
|---|
| 33 | }
|
|---|
| 34 |
|
|---|
| 35 | inline G4int G4ProcessVector::entries() const
|
|---|
| 36 | {
|
|---|
| 37 | return pProcVector->size();
|
|---|
| 38 | }
|
|---|
| 39 |
|
|---|
| 40 | inline G4int G4ProcessVector::size() const
|
|---|
| 41 | {
|
|---|
| 42 | return pProcVector->size();
|
|---|
| 43 | }
|
|---|
| 44 |
|
|---|
| 45 | inline G4int G4ProcessVector::length() const
|
|---|
| 46 | {
|
|---|
| 47 | return pProcVector->size();
|
|---|
| 48 | }
|
|---|
| 49 |
|
|---|
| 50 | inline G4int G4ProcessVector::index(G4VProcess* aProcess) const
|
|---|
| 51 | {
|
|---|
| 52 | G4ProcVector::iterator it;
|
|---|
| 53 | size_t j=0;
|
|---|
| 54 | for (it=pProcVector->begin();it!=pProcVector->end(); ++j,it++) {
|
|---|
| 55 | if (*(*it)==*aProcess) return j;
|
|---|
| 56 | }
|
|---|
| 57 | return -1;
|
|---|
| 58 | }
|
|---|
| 59 |
|
|---|
| 60 | inline G4bool G4ProcessVector::contains(G4VProcess* aProcess) const
|
|---|
| 61 | {
|
|---|
| 62 | G4ProcVector::iterator it;
|
|---|
| 63 | for (it=pProcVector->begin();it!=pProcVector->end(); it++) {
|
|---|
| 64 | if (*(*it)==*aProcess) return true;
|
|---|
| 65 | }
|
|---|
| 66 | return false;
|
|---|
| 67 | }
|
|---|
| 68 |
|
|---|
| 69 | inline G4bool G4ProcessVector::insert(G4VProcess* aProcess)
|
|---|
| 70 | {
|
|---|
| 71 | pProcVector->push_back(aProcess);
|
|---|
| 72 | return true;
|
|---|
| 73 | }
|
|---|
| 74 |
|
|---|
| 75 | inline G4bool G4ProcessVector::insertAt(G4int i,G4VProcess* aProcess)
|
|---|
| 76 | {
|
|---|
| 77 | if ( (i<0) || (i>G4int(pProcVector->size())) ) return false;
|
|---|
| 78 | if (i==G4int(pProcVector->size())) {
|
|---|
| 79 | pProcVector->push_back(aProcess);
|
|---|
| 80 | } else {
|
|---|
| 81 | G4ProcVector::iterator it=pProcVector->begin();
|
|---|
| 82 | int j;
|
|---|
| 83 | for(j=0;j!=i;++j) it++;
|
|---|
| 84 | pProcVector->insert(it, aProcess);
|
|---|
| 85 | }
|
|---|
| 86 | return true;
|
|---|
| 87 | }
|
|---|
| 88 |
|
|---|
| 89 | inline G4VProcess* G4ProcessVector::removeAt(G4int i)
|
|---|
| 90 | {
|
|---|
| 91 | G4ProcVector::iterator it=pProcVector->begin();
|
|---|
| 92 | for(size_t j=0;j<pProcVector->size() && G4int(j)<i;++j) it++;
|
|---|
| 93 | G4VProcess* rValue = *it;
|
|---|
| 94 | pProcVector->erase(it);
|
|---|
| 95 | return rValue;
|
|---|
| 96 | }
|
|---|
| 97 |
|
|---|
| 98 | inline G4VProcess* G4ProcessVector::removeLast()
|
|---|
| 99 | {
|
|---|
| 100 | G4VProcess* rValue = pProcVector->back();
|
|---|
| 101 | pProcVector->pop_back();
|
|---|
| 102 | return rValue;
|
|---|
| 103 | }
|
|---|
| 104 |
|
|---|
| 105 | inline void G4ProcessVector::clear()
|
|---|
| 106 | {
|
|---|
| 107 | pProcVector->clear();
|
|---|
| 108 | }
|
|---|
| 109 |
|
|---|
| 110 | inline G4VProcess* const& G4ProcessVector::operator[](G4int i) const
|
|---|
| 111 | {
|
|---|
| 112 | return (*pProcVector)[i];
|
|---|
| 113 | }
|
|---|
| 114 |
|
|---|
| 115 | inline G4VProcess* const& G4ProcessVector::operator()(G4int i) const
|
|---|
| 116 | {
|
|---|
| 117 | return (*pProcVector)[i];
|
|---|
| 118 | }
|
|---|
| 119 |
|
|---|
| 120 | inline G4VProcess* & G4ProcessVector::operator[](G4int i)
|
|---|
| 121 | {
|
|---|
| 122 | return (*pProcVector)[i];
|
|---|
| 123 | }
|
|---|
| 124 |
|
|---|
| 125 | inline G4VProcess* & G4ProcessVector::operator()(G4int i)
|
|---|
| 126 | {
|
|---|
| 127 | return (*pProcVector)[i];
|
|---|
| 128 | }
|
|---|
| 129 |
|
|---|
| 130 |
|
|---|
| 131 |
|
|---|
| 132 |
|
|---|
