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 // ------------------------------------------------------------------- 28 // GEANT4 Class file 29 // 30 // 31 // File name: G4LegendrePolynomial 32 // 33 // Author: Jason Detwiler (jasondet@gmail.com) 34 // 35 // Creation date: February 2015 36 // 37 // Modifications: 29 October 2024 Isaac Kunen 38 // 39 // Legendre Polynomial 40 // 41 // ------------------------------------------------------------------- 42 43 #ifndef G4LEGENDREPOLYNOMIAL_HH 44 #define G4LEGENDREPOLYNOMIAL_HH 45 46 #include "globals.hh" 47 #include <vector> 48 #include <map> 49 50 class G4LegendrePolynomial 51 { 52 public: 53 // Access to coefficients 54 static std::size_t GetNCoefficients(std::size_t order) { return order+1; } 55 G4double GetCoefficient(std::size_t i, std::size_t order); 56 57 // Evaluation functions 58 G4double EvalLegendrePoly(G4int order, G4double x); 59 60 G4double EvalAssocLegendrePoly(G4int l, G4int m, G4double x); 61 62 // cache is not used; use EvalAssocLegendrePoly(l, m, x) instead. 63 G4double EvalAssocLegendrePoly(G4int l, G4int m, G4double x, 64 std::map<G4int, std::map<G4int, G4double> >* cache) 65 { 66 (void) cache; // suppress compiler warning for unused cache 67 return EvalAssocLegendrePoly(l, m, x); 68 } 69 70 protected: // Cache coefficients for speed 71 void BuildUpToOrder(std::size_t order); 72 std::vector< std::vector<G4double> > fCoefficients; 73 }; 74 75 #endif 76