APRILContent
Algorithm of Particle Reconstruction for ILC - implementation with PandoraSDK
|
Header file for the kd tree linker tools template class. More...
#include "Api/PandoraContentApi.h"
#include "Objects/CaloHit.h"
#include "Objects/Track.h"
#include "Objects/CartesianVector.h"
#include "Pandora/PandoraInternal.h"
#include <array>
Go to the source code of this file.
Classes | |
class | april_content::KDTreeBoxT< DIM > |
Box structure used to define 2D field. It's used in KDTree building step to divide the detector space (ECAL, HCAL...) and in searching step to create a bounding box around the demanded point (Track collision point, PS projection...). More... | |
class | april_content::KDTreeNodeInfoT< typename, int > |
Data stored in each KDTree node. The dim1/dim2 fields are usually the duplication of some PFRecHit values (eta/phi or x/y). But in some situations, phi field is shifted by +-2.Pi. More... | |
class | april_content::KDTreeNodeT< DATA, DIM > |
KDTree node. More... | |
class | april_content::kdtree_type_adaptor< T > |
kdtree_type_adaptor More... | |
Namespaces | |
april_content | |
Header file for the fragment removal helper class. | |
Typedefs | |
typedef KDTreeBoxT< 2 > | april_content::KDTreeBox |
typedef KDTreeBoxT< 3 > | april_content::KDTreeCube |
typedef KDTreeBoxT< 4 > | april_content::KDTreeTesseract |
Functions | |
std::pair< float, float > | april_content::minmax (const float a, const float b) |
minmax More... | |
template<typename T > | |
KDTreeCube | april_content::fill_and_bound_3d_kd_tree (const MANAGED_CONTAINER< const T * > &points, std::vector< KDTreeNodeInfoT< const T *, 3 > > &nodes) |
fill_and_bound_3d_kd_tree More... | |
template<typename T > | |
KDTreeCube | april_content::fill_and_bound_3d_kd_tree_by_index (const std::vector< const T * > &points, std::vector< KDTreeNodeInfoT< unsigned, 3 > > &nodes) |
fill_and_bound_3d_kd_tree_by_index More... | |
template<typename T > | |
KDTreeCube | april_content::fill_and_bound_3d_kd_tree (const pandora::Algorithm *const caller, const MANAGED_CONTAINER< const T * > &points, std::vector< KDTreeNodeInfoT< const T *, 3 > > &nodes, bool passthru=false) |
fill_and_bound_3d_kd_tree More... | |
KDTreeTesseract | april_content::fill_and_bound_4d_kd_tree (const pandora::Algorithm *const caller, const MANAGED_CONTAINER< const pandora::CaloHit * > &points, std::vector< KDTreeNodeInfoT< const pandora::CaloHit *, 4 > > &nodes, bool passthru=false) |
fill_and_bound_4d_kd_tree More... | |
KDTreeCube | april_content::build_3d_kd_search_region (const pandora::CaloHit *const point, const float x_span, const float y_span, const float z_span) |
build_3d_kd_search_region More... | |
KDTreeTesseract | april_content::build_4d_kd_search_region (const pandora::CaloHit *const point, const float x_span, const float y_span, const float z_span, const float search_layer) |
build_4d_kd_search_region More... | |
KDTreeTesseract | april_content::build_4d_kd_search_region (const pandora::CartesianVector &pos, const float x_span, const float y_span, const float z_span, const float search_layer) |
build_4d_kd_search_region More... | |
april_content::right (nullptr) | |
Header file for the kd tree linker tools template class.