Import Geant4 11.1.0.beta source tree

source/global/HEPNumerics/include/G4ConvergenceTester.hh

@@ -109,8 +109,8 @@ class G4ConvergenceTester
     void calc_stat_history();
     void check_stat_history(std::ostream& out = G4cout);
     G4double calc_Pearson_r(G4int,std::vector<G4double>,std::vector<G4double>);
-    G4bool is_monotonically_decrease(std::vector<G4double>);
-    void calc_slope_fit(std::vector<G4double>);
+    G4bool is_monotonically_decrease(const std::vector<G4double>&);
+    void calc_slope_fit(const std::vector<G4double>&);
     G4double slope_fitting_function(std::vector<G4double>);
 
   private:

source/global/HEPNumerics/include/G4GaussChebyshevQ.hh

@@ -47,7 +47,7 @@ class G4GaussChebyshevQ : public G4VGaussianQuadrature
   G4GaussChebyshevQ(function pFunction, G4int nChebyshev);
   // Constructor for Gauss-Chebyshev quadrature method
 
-  ~G4GaussChebyshevQ();
+  ~G4GaussChebyshevQ() = default;
 
   G4GaussChebyshevQ(const G4GaussChebyshevQ&) = delete;
   G4GaussChebyshevQ& operator=(const G4GaussChebyshevQ&) = delete;

source/global/HEPNumerics/include/G4JTPolynomialSolver.hh

@@ -66,8 +66,8 @@
 class G4JTPolynomialSolver
 {
  public:
-  G4JTPolynomialSolver();
-  ~G4JTPolynomialSolver();
+  G4JTPolynomialSolver() = default;
+  ~G4JTPolynomialSolver() = default;
 
   G4int FindRoots(G4double* op, G4int degree, G4double* zeror, G4double* zeroi);
 

source/global/HEPNumerics/include/G4SimpleIntegration.hh

@@ -49,7 +49,7 @@ class G4SimpleIntegration
 
   G4SimpleIntegration(function pFunction, G4double pTolerance);
 
-  ~G4SimpleIntegration();
+  ~G4SimpleIntegration() = default;
 
   G4SimpleIntegration(const G4SimpleIntegration&) = delete;
   G4SimpleIntegration& operator=(const G4SimpleIntegration&) = delete;

source/global/HEPNumerics/include/G4StatDouble.hh

@@ -42,7 +42,7 @@ class G4StatDouble
  public:
   G4StatDouble();
   G4StatDouble(G4double);
-  virtual ~G4StatDouble();
+  virtual ~G4StatDouble() = default;
 
   G4StatDouble(const G4StatDouble&) = default;