lar_content::KDTreeBoxT< DIM > Class Template Reference

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...

#include <KDTreeLinkerToolsT.h>

Public Member Functions
	KDTreeBoxT ()
	Default constructor. More...
template<typename... Ts>
	KDTreeBoxT (Ts...dimargs)
	Constructor. More...

Public Attributes
std::array< float, DIM >	dimmin
std::array< float, DIM >	dimmax

Detailed Description

template<unsigned DIM>
class lar_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...).

Definition at line 36 of file KDTreeLinkerToolsT.h.

Constructor & Destructor Documentation

template<unsigned DIM>

lar_content::KDTreeBoxT< DIM >::KDTreeBoxT ( )

inline

Default constructor.

Definition at line 225 of file KDTreeLinkerToolsT.h.

{
}

template<unsigned DIM>

template<typename... Ts>

lar_content::KDTreeBoxT< DIM >::KDTreeBoxT ( Ts...  dimargs )

inline

Constructor.

Parameters

dimargs

Definition at line 233 of file KDTreeLinkerToolsT.h.

{
    static_assert(sizeof...(dimargs) == 2 * DIM, "Constructor requires 2*DIM args");
    std::vector<float> dims = {dimargs...};

    for (unsigned i = 0; i < DIM; ++i)
    {
        dimmin[i] = dims[2 * i];
        dimmax[i] = dims[2 * i + 1];
    }
}

Member Data Documentation

template<unsigned DIM>

std::array<float, DIM> lar_content::KDTreeBoxT< DIM >::dimmax

Definition at line 53 of file KDTreeLinkerToolsT.h.

template<unsigned DIM>

std::array<float, DIM> lar_content::KDTreeBoxT< DIM >::dimmin

Definition at line 52 of file KDTreeLinkerToolsT.h.

---

The documentation for this class was generated from the following file:

• larpandoracontent/larpandoracontent/LArUtility/KDTreeLinkerToolsT.h