| Geant4 Cross Reference |
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 // Author: Ivana Hrivnacova, IJCLab IN2P3/CNRS, 04/07/2012
28
29 #ifndef G4MergeMode_h
30 #define G4MergeMode_h 1
31
32 #include "globals.hh"
33 #include "G4Exception.hh"
34
35 #include <functional>
36 #include <cmath>
37
38 // Enumeration for definition available binning schemes
39
40 enum class G4MergeMode {
41 kAddition, // "Or" if boolean type
42 kMultiplication, // "And" if boolean type
43 kMaximum, // "Or" if boolean type
44 kMinimum // "And" if boolean type
45 };
46
47 // Generic merge function
48 template <typename T>
49 using G4MergeFunction = std::function<T(const T&, const T&)>;
50
51 // Utility functions
52 namespace G4Accumulables {
53
54 G4MergeMode GetMergeMode(const G4String& mergeModeName);
55
56 template <typename T>
57 G4MergeFunction<T> GetMergeFunction(G4MergeMode mergeMode)
58 {
59 switch ( mergeMode ) {
60 case G4MergeMode::kAddition:
61 return std::plus<T>();
62
63 case G4MergeMode::kMultiplication:
64 return std::multiplies<T>();
65
66 case G4MergeMode::kMaximum:
67 return [](const T& x, const T& y) { return std::max(x,y); };
68
69 case G4MergeMode::kMinimum:
70 return [](const T& x, const T& y) { return std::min(x,y); };
71 }
72
73 // Must never get here, but we need a return to satisfy MSVC
74 G4Exception("G4Accumulables::GetMergeFunction<T>",
75 "Analysis_F001", FatalException,
76 "Undefined merge mode");
77 return [](const T&, const T&) { return T(); };
78 }
79
80 template <G4bool>
81 G4MergeFunction<G4bool> GetMergeFunction(G4MergeMode mergeMode)
82 {
83 switch ( mergeMode ) {
84 case G4MergeMode::kAddition:
85 case G4MergeMode::kMaximum:
86 // return std::bind([](const T& x, const T& y) { return x + y; });
87 return [](const G4bool& x, const G4bool& y) { return x || y; };
88
89 case G4MergeMode::kMultiplication:
90 case G4MergeMode::kMinimum:
91 return [](const G4bool& x, const G4bool& y) { return x && y; };
92 }
93 }
94
95 }
96
97 #endif
98