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 // G4VCurvedTrajectoryFilter 27 // 28 // Class description: 29 // 30 // Decides which intermediate points on a curved trajectory merit 31 // being stored. Defines the compromise between accuracy of 32 // representation of the curved trajectory and memory use. 33 // 34 // Derived classes should implement the filtering algorithm in the 35 // method TakeIntermediatePoint(). 36 // 37 // IMPORTANT: This class heap allocates vectors of auxiliary points, 38 // which it does not delete. The vectors must find their way to a 39 // subclass of G4VTrajectoryPoint, which must take responsibility for 40 // deleting them. 41 42 // First version: Oct 30, 2002 - Jacek Generowicz 43 // ------------------------------------------------------------------------ 44 #ifndef G4VCURVEDTRAJECTORYFILTER_HH 45 #define G4VCURVEDTRAJECTORYFILTER_HH 1 46 47 #include "G4ThreeVector.hh" 48 #include <vector> 49 50 class G4VCurvedTrajectoryFilter 51 { 52 53 public: 54 55 G4VCurvedTrajectoryFilter() = default; 56 virtual ~G4VCurvedTrajectoryFilter() = default; 57 58 // Probably do not want these objects to be copied, 59 // so make the copy constructor private 60 61 void CreateNewTrajectorySegment(); 62 // Each segment stores the auxiliary points of a single step. 63 64 virtual void TakeIntermediatePoint( G4ThreeVector newPoint ) = 0; 65 // Submit intermediate points for the filter to consider keeping or 66 // rejecting. Derived classes should implement the filtering algorithm 67 // in this method. 68 69 std::vector<G4ThreeVector>* GimmeThePointsAndForgetThem(); 70 71 protected: 72 73 std::vector<G4ThreeVector>* fpFilteredPoints = nullptr; 74 }; 75 76 #endif 77