G4AllITFinder.hh

Go to the documentation of this file.

//
// ********************************************************************
// * License and Disclaimer                                           *
// *                                                                  *
// * The  Geant4 software  is  copyright of the Copyright Holders  of *
// * the Geant4 Collaboration.  It is provided  under  the terms  and *
// * conditions of the Geant4 Software License,  included in the file *
// * LICENSE and available at  http://cern.ch/geant4/license .  These *
// * include a list of copyright holders.                             *
// *                                                                  *
// * Neither the authors of this software system, nor their employing *
// * institutes,nor the agencies providing financial support for this *
// * work  make  any representation or  warranty, express or implied, *
// * regarding  this  software system or assume any liability for its *
// * use.  Please see the license in the file  LICENSE  and URL above *
// * for the full disclaimer and the limitation of liability.         *
// *                                                                  *
// * This  code  implementation is the result of  the  scientific and *
// * technical work of the GEANT4 collaboration.                      *
// * By using,  copying,  modifying or  distributing the software (or *
// * any work based  on the software)  you  agree  to acknowledge its *
// * use  in  resulting  scientific  publications,  and indicate your *
// * acceptance of all terms of the Geant4 Software license.          *
// ********************************************************************
//
//
// Author: Mathieu Karamitros
 
// The code is developed in the framework of the ESA AO7146
//
// We would be very happy hearing from you, send us your feedback! :)
//
// In order for Geant4-DNA to be maintained and still open-source,
// article citations are crucial. 
// If you use Geant4-DNA chemistry and you publish papers about your software, 
// in addition to the general paper on Geant4-DNA:
//
// Int. J. Model. Simul. Sci. Comput. 1 (2010) 157–178
//
// we would be very happy if you could please also cite the following
// reference papers on chemistry:
//
// J. Comput. Phys. 274 (2014) 841-882
// Prog. Nucl. Sci. Tec. 2 (2011) 503-508 
 
#ifndef G4AllITFinder_h
#define G4AllITFinder_h 1
#include "globals.hh"
#include "G4ITType.hh"
#include "G4ThreeVector.hh"
#include "G4KDTreeResult.hh"
 
#include <map>
#include <vector>
#include <memory>
 
class G4IT;
class G4VITFinder;
class G4ITBox;
class G4Track;
template<typename T>
  class G4ITFinder;
 
/**
 * Holds all IT Manager, and take care of deleting them
 * when AllITManager is deleted
 * Set general verbose for all IT Manager
 */
 
class G4AllITFinder
{
public:
  static G4AllITFinder* Instance();
  static void DeleteInstance();
  /**
   * To delete the Instance you should use DeleteInstance()
   * rather than the destructor
   */
 
  ~G4AllITFinder();
 
  G4VITFinder* GetInstance(G4ITType);
  G4ITBox* GetBox(const G4Track*);
 
  void RegisterManager(G4VITFinder* manager);
  void Push(G4Track* track);
 
  /**
   * Set General verbose for all IT Manager
   * See ITManager builder
   */
  void SetVerboseLevel(G4int level)
  {
    fVerbose = level;
  }
  void SetVerboseLevel(G4int level) {…}
  G4int GetVerboseLevel()
  {
    return fVerbose;
  }
  G4int GetVerboseLevel() {…}
 
  void UpdatePositionMap();
 
  template<typename T>
    inline G4KDTreeResultHandle FindNearest(const G4ThreeVector& pos,
                                            const T* it);
  template<typename T>
    inline G4KDTreeResultHandle FindNearest(const T* it0, const T* it);
  template<typename T>
    inline G4KDTreeResultHandle FindNearestInRange(const G4ThreeVector& pos,
                                                   const T* it,
                                                   G4double range);
  template<typename T>
    inline G4KDTreeResultHandle FindNearestInRange(const T* it0,
                                                   const T* it,
                                                   G4double range);
 
private:
  G4AllITFinder();
  static G4ThreadLocal G4AllITFinder* fpInstance;
  std::map<G4ITType, G4VITFinder*> fITSubManager;
 
  int fVerbose;
};
class G4AllITFinder {…};
 
template<typename T>
  inline G4KDTreeResultHandle G4AllITFinder::FindNearest(const G4ThreeVector& pos,
                                                         const T* it)
  {
    return G4ITFinder<T>::Instance()->FindNearest(pos, it);
  }
  inline G4KDTreeResultHandle G4AllITFinder::FindNearest(const G4ThreeVector& pos, {…}
 
template<typename T>
  inline G4KDTreeResultHandle G4AllITFinder::FindNearest(const T* it0,
                                                         const T* it)
  {
    return G4ITFinder<T>::Instance()->FindNearest(it0, it);
  }
  inline G4KDTreeResultHandle G4AllITFinder::FindNearest(const T* it0, {…}
 
template<typename T>
  inline G4KDTreeResultHandle G4AllITFinder::FindNearestInRange(const G4ThreeVector& pos,
                                                                const T* it,
                                                                G4double range)
  {
    return G4ITFinder<T>::Instance()->FindNearestInRange(pos, it, range);
  }
  inline G4KDTreeResultHandle G4AllITFinder::FindNearestInRange(const G4ThreeVector& pos, {…}
 
template<typename T>
  inline G4KDTreeResultHandle G4AllITFinder::FindNearestInRange(const T* it0,
                                                                const T* it,
                                                                G4double range)
  {
    return G4ITFinder<T>::Instance()->FindNearestInRange(it0, it, range);
  }
  inline G4KDTreeResultHandle G4AllITFinder::FindNearestInRange(const T* it0, {…}
 
#endif