39 #ifndef G4ITManager_hh
40 #define G4ITManager_hh 1
156 typedef std::map<T,G4ITBox* > BoxMap;
159 typedef std::map<T, G4KDTree* > TreeMap;
161 TreeMap fPrevious_tree;
193 typename BoxMap::const_iterator it = fBox.find(*IT);
194 if(it == fBox.end())
return 0;
200 const T* myIT =
dynamic_cast<const T*
>(
IT);
215 typename BoxMap::iterator it = fBox.begin();
234 typename BoxMap::reverse_iterator it = fBox.rbegin();
235 if(it != fBox.rend())
248 #define TEMPLATE template<typename T>
249 #define G4ITMANAGER G4ITManager<T>
251 #include "G4ITManager.icc"
virtual ~allbox_iterator()
allbox_iterator & operator++(G4int)
allbox_iterator & operator=(const allbox_iterator &i)
iterator & operator++(G4int)
std::ostringstream G4ExceptionDescription
static void iUpdatePositionMap()
G4KDTreeResultHandle FindNearest(const G4ThreeVector &, const T *it)
virtual ~const_iterator()
void SetVerboseLevel(G4int level)
virtual void Push(G4Track *)
G4KDTreeResultHandle FindNearestInRange(const T *, const T *, G4double)
virtual void Push(G4Track *)=0
virtual G4ITBox * GetNextBox(G4ITBox *)=0
G4IT * GetIT(const G4Track *track)
virtual G4ITBox * GetFirstBox()
virtual G4ITBox * GetFirstBox()=0
static G4ITManager< T > * Instance()
const_iterator(G4ITBox *)
virtual G4ITBox * GetLastBox()
virtual G4ITBox * GetBox(const G4IT *IT)
iterator & operator=(const iterator &i)
virtual void CreateTree()
void G4Exception(const char *originOfException, const char *exceptionCode, G4ExceptionSeverity severity, const char *comments)
virtual G4ITBox * GetLastBox()=0
allbox_iterator(G4ITType)
G4int NbElements(const G4IT *)
G4ITBox * GetBox(const G4Track *track)
G4ITBox * GetBox(const T *IT)
virtual void UpdatePositionMap()=0
void SetVerboseLevel(G4int level)
virtual void UpdatePositionMap()
virtual G4ITBox * GetNextBox(G4ITBox *box)