Geant4.10
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
G4VCurvedTrajectoryFilter.hh
Go to the documentation of this file.
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 // $Id: G4VCurvedTrajectoryFilter.hh 66356 2012-12-18 09:02:32Z gcosmo $
28 //
29 //
30 // class G4VCurevedTrajectoryFilter
31 //
32 // Class description:
33 //
34 // Decides which intermediate points on a curved trajectory merit
35 // being stored. Defines the compromise between accuracy of
36 // representation of the curved trajectory and memory use.
37 //
38 // Derived classes should implement the filtering algorithm in the
39 // method TakeIntermediatePoint().
40 //
41 // IMPORTANT: This class heap allocates vectors of auxiliary points,
42 // which it does not delete. The vectors must find their way to a
43 // subclass of G4VTrajectoryPoint, which must take responsibility for
44 // deleting them.
45 
46 // History
47 //
48 // - First version: Oct 30, 2002 Jacek Generowicz
49 // ------------------------------------------------------------------------
50 #ifndef G4VCurvedTrajectoryFilter_hh
51 #define G4VCurvedTrajectoryFilter_hh
52 
53 #include "G4ThreeVector.hh"
54 #include <vector>
55 
57 {
58 
59 public: // with description
60 
63 
64  // Probably do not want these objects to be copied,
65  // so make the copy constructor private
66 
68  // Each segment stores the auxiliary points of a single step.
69 
70  virtual void TakeIntermediatePoint( G4ThreeVector newPoint ) = 0;
71  // Submit intermediate points for the filter to consider keeping or
72  // rejecting. Derived classes should implement the filtering algorithm
73  // in this method.
74 
75  std::vector<G4ThreeVector>* GimmeThePointsAndForgetThem();
76 
77 protected:
78 
79  std::vector<G4ThreeVector>* fpFilteredPoints;
80 };
81 
82 #endif /* End of ifndef G4VCurvedTrajectoryFilter_hh */
std::vector< G4ThreeVector > * fpFilteredPoints
virtual void TakeIntermediatePoint(G4ThreeVector newPoint)=0
std::vector< G4ThreeVector > * GimmeThePointsAndForgetThem()