| 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 // G4VWeightWindowAlgorithm << 23 //
>> 24 // $Id: G4VWeightWindowAlgorithm.hh,v 1.7 2003/08/19 15:44:57 dressel Exp $
>> 25 // GEANT4 tag $Name: geant4-06-00 $
>> 26 //
>> 27 // ----------------------------------------------------------------------
>> 28 // Class G4VWeightWindowAlgorithm
27 // 29 //
28 // Class description: 30 // Class description:
29 // 31 //
30 // Interface class for a weight window algorit << 32 // Interface class for an weight window algorithm. It calculates
31 // the number of tracks and their weight accor 33 // the number of tracks and their weight according to the inital
32 // track weight and the lower energy bound in 34 // track weight and the lower energy bound in the energy-space
33 // cell. 35 // cell.
>> 36 //
34 37
35 // Author: Michael Dressel (CERN), 2003 << 38 // Author: Michael Dressel (Michael.Dressel@cern.ch)
36 // ------------------------------------------- 39 // ----------------------------------------------------------------------
37 #ifndef G4VWEIGHTWINDOWALGORITHM_HH << 40 #ifndef G4VWeightWindowAlgorithm_hh
38 #define G4VWEIGHTWINDOWALGORITHM_HH 1 << 41 #define G4VWeightWindowAlgorithm_hh G4VWeightWindowAlgorithm_hh
39 42
40 #include "G4Nsplit_Weight.hh" 43 #include "G4Nsplit_Weight.hh"
41 44
42 class G4VWeightWindowAlgorithm 45 class G4VWeightWindowAlgorithm
43 { 46 {
44 public: // with description <<
45 47
46 G4VWeightWindowAlgorithm(); << 48 public: // with description
47 virtual ~G4VWeightWindowAlgorithm(); << 49
>> 50 G4VWeightWindowAlgorithm();
>> 51
>> 52 virtual ~G4VWeightWindowAlgorithm();
>> 53
>> 54 virtual G4Nsplit_Weight Calculate(G4double init_w,
>> 55 G4double lowerWeightBound) const = 0;
>> 56 // calculate number of tracks and their weight according
>> 57 // to the initial track weight and the lower energy bound
48 58
49 virtual G4Nsplit_Weight Calculate(G4double <<
50 G4double <<
51 // calculate number of tracks and their <<
52 // to the initial track weight and the l <<
53 }; 59 };
54 60
55 #endif 61 #endif
56 62