| 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: G4PhysicsOrderedFreeVector.icc,v 1.9 2009/06/25 10:05:26 vnivanch Exp $
|
|---|
| 28 | // GEANT4 tag $Name: global-V09-02-10 $
|
|---|
| 29 | //
|
|---|
| 30 | ////////////////////////////////////////////////////////////////////////
|
|---|
| 31 | // PhysicsOrderedFreeVector Class Inline Functions Definitions
|
|---|
| 32 | ////////////////////////////////////////////////////////////////////////
|
|---|
| 33 | //
|
|---|
| 34 | // File: G4PhysicsOrderedFreeVector.icc
|
|---|
| 35 | // Version: 1.0
|
|---|
| 36 | // Author: Juliet Armstrong
|
|---|
| 37 | // mail: gum@triumf.ca
|
|---|
| 38 | //
|
|---|
| 39 | // Updated:
|
|---|
| 40 | // 2000-11-11 by H.Kurashige
|
|---|
| 41 | // > use STL vector for dataVector and binVector
|
|---|
| 42 | ////////////////////////////////////////////////////////////////////////
|
|---|
| 43 |
|
|---|
| 44 | ////////////////////
|
|---|
| 45 | // Inline methods
|
|---|
| 46 | ////////////////////
|
|---|
| 47 |
|
|---|
| 48 | inline
|
|---|
| 49 | G4double G4PhysicsOrderedFreeVector::GetMaxValue()
|
|---|
| 50 | {
|
|---|
| 51 | return dataVector.back();
|
|---|
| 52 | }
|
|---|
| 53 |
|
|---|
| 54 | inline
|
|---|
| 55 | G4double G4PhysicsOrderedFreeVector::GetMinValue()
|
|---|
| 56 | {
|
|---|
| 57 | return dataVector.front();
|
|---|
| 58 | }
|
|---|
| 59 |
|
|---|
| 60 | inline
|
|---|
| 61 | G4double G4PhysicsOrderedFreeVector::GetMaxLowEdgeEnergy()
|
|---|
| 62 | {
|
|---|
| 63 | return binVector.back();
|
|---|
| 64 | }
|
|---|
| 65 |
|
|---|
| 66 | inline
|
|---|
| 67 | G4double G4PhysicsOrderedFreeVector::GetMinLowEdgeEnergy()
|
|---|
| 68 | {
|
|---|
| 69 | return binVector.front();
|
|---|
| 70 | }
|
|---|
| 71 |
|
|---|
| 72 | inline
|
|---|
| 73 | void G4PhysicsOrderedFreeVector::DumpValues()
|
|---|
| 74 | {
|
|---|
| 75 | for (size_t i = 0; i < numberOfNodes; i++)
|
|---|
| 76 | {
|
|---|
| 77 | G4cout << binVector[i] << "\t" << dataVector[i] << G4endl;
|
|---|
| 78 | }
|
|---|
| 79 | }
|
|---|
| 80 |
|
|---|
| 81 | inline
|
|---|
| 82 | size_t G4PhysicsOrderedFreeVector::FindBinLocation(G4double theEnergy) const
|
|---|
| 83 | {
|
|---|
| 84 | G4int n1 = 0;
|
|---|
| 85 | G4int n2 = numberOfNodes/2;
|
|---|
| 86 | G4int n3 = numberOfNodes - 1;
|
|---|
| 87 | while (n1 != n3 - 1)
|
|---|
| 88 | {
|
|---|
| 89 | if (theEnergy > binVector[n2])
|
|---|
| 90 | { n1 = n2; }
|
|---|
| 91 | else
|
|---|
| 92 | { n3 = n2; }
|
|---|
| 93 | n2 = n1 + (n3 - n1 + 1)/2;
|
|---|
| 94 | }
|
|---|
| 95 | return (size_t)n1;
|
|---|
| 96 | }
|
|---|
