mkfit::binnor< C, A1, A2, NB_first, NB_count > Struct Template Reference

#include <binnor.h>

Classes
struct	B_pair
struct	C_pair

Public Member Functions
void	begin_registration (C n_items)
	binnor (const A1 &a1, const A2 &a2)
void	finalize_registration ()
C_pair	get_content (B_pair n_bin) const
C_pair	get_content (typename A1::index_t n1, typename A2::index_t n2) const
C_pair	get_content (typename A1::real_t r1, typename A2::real_t r2) const
B_pair	get_n_bin (typename A1::index_t n1, typename A2::index_t n2) const
B_pair	get_n_bin (typename A1::real_t r1, typename A2::real_t r2) const
B_pair	m_bin_to_n_bin (B_pair m_bin)
C_pair &	ref_content (B_pair n_bin)
void	register_entry (typename A1::real_t r1, typename A2::real_t r2)
void	register_entry_safe (typename A1::real_t r1, typename A2::real_t r2)
void	register_m_bins (typename A1::index_t m1, typename A2::index_t m2)
void	reset_contents ()

Public Attributes
const A1 &	m_a1
const A2 &	m_a2
std::vector< C_pair >	m_bins
std::vector< B_pair >	m_cons
std::vector< C >	m_ranks

Static Public Attributes
static constexpr unsigned int	c_A1_mask = (1 << A1::c_M) - 1
static constexpr unsigned int	c_A2_Mout_mask = ~(((1 << A2::c_M2N_shift) - 1) << A1::c_M)

Detailed Description

template<typename C, typename A1, typename A2, unsigned NB_first = 8 * sizeof(C), unsigned NB_count = 8 * sizeof(C)>
struct mkfit::binnor< C, A1, A2, NB_first, NB_count >

Definition at line 158 of file binnor.h.

Constructor & Destructor Documentation

template<typename C, typename A1, typename A2, unsigned NB_first = 8 * sizeof(C), unsigned NB_count = 8 * sizeof(C)>

mkfit::binnor< C, A1, A2, NB_first, NB_count >::binnor ( const A1 &  a1, const A2 &  a2  )

inline

Definition at line 195 of file binnor.h.

: m_a1(a1), m_a2(a2), m_bins(m_a1.size_of_N() * m_a2.size_of_N()) {}

Member Function Documentation

template<typename C, typename A1, typename A2, unsigned NB_first = 8 * sizeof(C), unsigned NB_count = 8 * sizeof(C)>

void mkfit::binnor< C, A1, A2, NB_first, NB_count >::begin_registration ( C  n_items )

inline

Definition at line 229 of file binnor.h.

References mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_cons.

Referenced by mkfit::StdSeq::clean_cms_seedtracks_iter().

{ m_cons.reserve(n_items); }

template<typename C, typename A1, typename A2, unsigned NB_first = 8 * sizeof(C), unsigned NB_count = 8 * sizeof(C)>

void mkfit::binnor< C, A1, A2, NB_first, NB_count >::finalize_registration ( )

inline

Definition at line 242 of file binnor.h.

References a, b, mkfit::binnor< C, A1, A2, NB_first, NB_count >::B_pair::bin1(), mkfit::binnor< C, A1, A2, NB_first, NB_count >::B_pair::bin2(), gen::C, mkfit::binnor< C, A1, A2, NB_first, NB_count >::C_pair::count, mkfit::binnor< C, A1, A2, NB_first, NB_count >::C_pair::first, mps_fire::i, dqmiolumiharvest::j, mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_bin_to_n_bin(), mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_cons, mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_ranks, gpuVertexFinder::printf(), and mkfit::binnor< C, A1, A2, NB_first, NB_count >::ref_content().

Referenced by mkfit::StdSeq::clean_cms_seedtracks_iter().

                                 {
      // call internal sort, bin building from icc where template instantiation has to be made.

      m_ranks.resize(m_cons.size());
      std::iota(m_ranks.begin(), m_ranks.end(), 0);

      std::sort(m_ranks.begin(), m_ranks.end(), [&](auto &a, auto &b) {
        return m_cons[a].mask_A2_M_bins() < m_cons[b].mask_A2_M_bins();
      });

      for (C i = 0; i < m_ranks.size(); ++i) {
        C j = m_ranks[i];
        C_pair &c_bin = ref_content(m_bin_to_n_bin(m_cons[j]));
        if (c_bin.count == 0)
          c_bin.first = i;
        ++c_bin.count;

#ifdef DEBUG
        B_pair n_pair = m_bin_to_n_bin(m_cons[j]);
        printf("i=%4u j=%4u  %u %u %u %u\n", i, j, n_pair.bin1, n_pair.bin2, c_bin.first, c_bin.count);
#endif
      }

      // Those could be kept to do preselection when determining search ranges.
      // Especially since additional precision on Axis2 is screened out during sorting.
      m_cons.clear();
      m_cons.shrink_to_fit();
    }

template<typename C, typename A1, typename A2, unsigned NB_first = 8 * sizeof(C), unsigned NB_count = 8 * sizeof(C)>

C_pair mkfit::binnor< C, A1, A2, NB_first, NB_count >::get_content ( B_pair  n_bin ) const

inline

Definition at line 211 of file binnor.h.

References mkfit::binnor< C, A1, A2, NB_first, NB_count >::B_pair::bin1(), mkfit::binnor< C, A1, A2, NB_first, NB_count >::B_pair::bin2(), mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_a1, and mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_bins.

Referenced by mkfit::StdSeq::clean_cms_seedtracks_iter(), and mkfit::binnor< C, A1, A2, NB_first, NB_count >::get_content().

{ return m_bins[n_bin.bin2() * m_a1.size_of_N() + n_bin.bin1()]; }

template<typename C, typename A1, typename A2, unsigned NB_first = 8 * sizeof(C), unsigned NB_count = 8 * sizeof(C)>

C_pair mkfit::binnor< C, A1, A2, NB_first, NB_count >::get_content ( typename A1::index_t  n1, typename A2::index_t  n2  ) const

inline

Definition at line 213 of file binnor.h.

References mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_a1, and mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_bins.

                                                                           {
      return m_bins[n2 * m_a1.size_of_N() + n1];
    }

template<typename C, typename A1, typename A2, unsigned NB_first = 8 * sizeof(C), unsigned NB_count = 8 * sizeof(C)>

C_pair mkfit::binnor< C, A1, A2, NB_first, NB_count >::get_content ( typename A1::real_t  r1, typename A2::real_t  r2  ) const

inline

Definition at line 217 of file binnor.h.

References mkfit::binnor< C, A1, A2, NB_first, NB_count >::get_content(), mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_a1, and mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_a2.

                                                                         {
      return get_content(m_a1.from_R_to_N_bin(r1), m_a2.from_R_to_N_bin(r2));
    }

template<typename C, typename A1, typename A2, unsigned NB_first = 8 * sizeof(C), unsigned NB_count = 8 * sizeof(C)>

B_pair mkfit::binnor< C, A1, A2, NB_first, NB_count >::get_n_bin ( typename A1::index_t  n1, typename A2::index_t  n2  ) const

inline

Definition at line 203 of file binnor.h.

{ return {n1, n2}; }

template<typename C, typename A1, typename A2, unsigned NB_first = 8 * sizeof(C), unsigned NB_count = 8 * sizeof(C)>

B_pair mkfit::binnor< C, A1, A2, NB_first, NB_count >::get_n_bin ( typename A1::real_t  r1, typename A2::real_t  r2  ) const

inline

Definition at line 205 of file binnor.h.

References mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_a1, and mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_a2.

                                                                       {
      return {m_a1.from_R_to_N_bin(r1), m_a2.from_R_to_N_bin(r2)};
    }

template<typename C, typename A1, typename A2, unsigned NB_first = 8 * sizeof(C), unsigned NB_count = 8 * sizeof(C)>

B_pair mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_bin_to_n_bin ( B_pair  m_bin )

inline

Definition at line 199 of file binnor.h.

References mkfit::binnor< C, A1, A2, NB_first, NB_count >::B_pair::bin1(), mkfit::binnor< C, A1, A2, NB_first, NB_count >::B_pair::bin2(), mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_a1, and mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_a2.

Referenced by mkfit::binnor< C, A1, A2, NB_first, NB_count >::finalize_registration().

                                        {
      return {m_a1.from_M_bin_to_N_bin(m_bin.bin1()), m_a2.from_M_bin_to_N_bin(m_bin.bin2())};
    }

template<typename C, typename A1, typename A2, unsigned NB_first = 8 * sizeof(C), unsigned NB_count = 8 * sizeof(C)>

C_pair& mkfit::binnor< C, A1, A2, NB_first, NB_count >::ref_content ( B_pair  n_bin )

inline

Definition at line 209 of file binnor.h.

References mkfit::binnor< C, A1, A2, NB_first, NB_count >::B_pair::bin1(), mkfit::binnor< C, A1, A2, NB_first, NB_count >::B_pair::bin2(), mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_a1, and mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_bins.

Referenced by mkfit::binnor< C, A1, A2, NB_first, NB_count >::finalize_registration().

{ return m_bins[n_bin.bin2() * m_a1.size_of_N() + n_bin.bin1()]; }

template<typename C, typename A1, typename A2, unsigned NB_first = 8 * sizeof(C), unsigned NB_count = 8 * sizeof(C)>

void mkfit::binnor< C, A1, A2, NB_first, NB_count >::register_entry ( typename A1::real_t  r1, typename A2::real_t  r2  )

inline

Definition at line 231 of file binnor.h.

References mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_a1, mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_a2, and mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_cons.

                                                                    {
      m_cons.push_back({m_a1.from_R_to_M_bin(r1), m_a2.from_R_to_M_bin(r2)});
    }

template<typename C, typename A1, typename A2, unsigned NB_first = 8 * sizeof(C), unsigned NB_count = 8 * sizeof(C)>

void mkfit::binnor< C, A1, A2, NB_first, NB_count >::register_entry_safe ( typename A1::real_t  r1, typename A2::real_t  r2  )

inline

Definition at line 235 of file binnor.h.

References mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_a1, mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_a2, and mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_cons.

Referenced by mkfit::StdSeq::clean_cms_seedtracks_iter().

                                                                         {
      m_cons.push_back({m_a1.from_R_to_M_bin_safe(r1), m_a2.from_R_to_M_bin_safe(r2)});
    }

template<typename C, typename A1, typename A2, unsigned NB_first = 8 * sizeof(C), unsigned NB_count = 8 * sizeof(C)>

void mkfit::binnor< C, A1, A2, NB_first, NB_count >::register_m_bins ( typename A1::index_t  m1, typename A2::index_t  m2  )

inline

Definition at line 240 of file binnor.h.

References mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_cons.

{ m_cons.push_back({m1, m2}); }

template<typename C, typename A1, typename A2, unsigned NB_first = 8 * sizeof(C), unsigned NB_count = 8 * sizeof(C)>

void mkfit::binnor< C, A1, A2, NB_first, NB_count >::reset_contents ( )

inline

Definition at line 223 of file binnor.h.

References mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_bins, and mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_ranks.

                          {
      m_bins.assign(m_bins.size(), C_pair());
      m_ranks.clear();
      m_ranks.shrink_to_fit();
    }

Member Data Documentation

template<typename C, typename A1, typename A2, unsigned NB_first = 8 * sizeof(C), unsigned NB_count = 8 * sizeof(C)>

constexpr unsigned int mkfit::binnor< C, A1, A2, NB_first, NB_count >::c_A1_mask = (1 << A1::c_M) - 1

static

Definition at line 162 of file binnor.h.

Referenced by mkfit::binnor< C, A1, A2, NB_first, NB_count >::B_pair::bin1().

template<typename C, typename A1, typename A2, unsigned NB_first = 8 * sizeof(C), unsigned NB_count = 8 * sizeof(C)>

constexpr unsigned int mkfit::binnor< C, A1, A2, NB_first, NB_count >::c_A2_Mout_mask = ~(((1 << A2::c_M2N_shift) - 1) << A1::c_M)

static

Definition at line 163 of file binnor.h.

Referenced by mkfit::binnor< C, A1, A2, NB_first, NB_count >::B_pair::mask_A2_M_bins().

template<typename C, typename A1, typename A2, unsigned NB_first = 8 * sizeof(C), unsigned NB_count = 8 * sizeof(C)>

const A1& mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_a1

Definition at line 189 of file binnor.h.

Referenced by mkfit::binnor< C, A1, A2, NB_first, NB_count >::get_content(), mkfit::binnor< C, A1, A2, NB_first, NB_count >::get_n_bin(), mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_bin_to_n_bin(), mkfit::binnor< C, A1, A2, NB_first, NB_count >::ref_content(), mkfit::binnor< C, A1, A2, NB_first, NB_count >::register_entry(), and mkfit::binnor< C, A1, A2, NB_first, NB_count >::register_entry_safe().

template<typename C, typename A1, typename A2, unsigned NB_first = 8 * sizeof(C), unsigned NB_count = 8 * sizeof(C)>

const A2& mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_a2

Definition at line 190 of file binnor.h.

Referenced by mkfit::binnor< C, A1, A2, NB_first, NB_count >::get_content(), mkfit::binnor< C, A1, A2, NB_first, NB_count >::get_n_bin(), mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_bin_to_n_bin(), mkfit::binnor< C, A1, A2, NB_first, NB_count >::register_entry(), and mkfit::binnor< C, A1, A2, NB_first, NB_count >::register_entry_safe().

template<typename C, typename A1, typename A2, unsigned NB_first = 8 * sizeof(C), unsigned NB_count = 8 * sizeof(C)>

std::vector<C_pair> mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_bins

Definition at line 192 of file binnor.h.

Referenced by mkfit::binnor< C, A1, A2, NB_first, NB_count >::get_content(), mkfit::binnor< C, A1, A2, NB_first, NB_count >::ref_content(), and mkfit::binnor< C, A1, A2, NB_first, NB_count >::reset_contents().

template<typename C, typename A1, typename A2, unsigned NB_first = 8 * sizeof(C), unsigned NB_count = 8 * sizeof(C)>

std::vector<B_pair> mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_cons

Definition at line 191 of file binnor.h.

Referenced by mkfit::binnor< C, A1, A2, NB_first, NB_count >::begin_registration(), mkfit::binnor< C, A1, A2, NB_first, NB_count >::finalize_registration(), mkfit::binnor< C, A1, A2, NB_first, NB_count >::register_entry(), mkfit::binnor< C, A1, A2, NB_first, NB_count >::register_entry_safe(), and mkfit::binnor< C, A1, A2, NB_first, NB_count >::register_m_bins().

template<typename C, typename A1, typename A2, unsigned NB_first = 8 * sizeof(C), unsigned NB_count = 8 * sizeof(C)>

std::vector<C> mkfit::binnor< C, A1, A2, NB_first, NB_count >::m_ranks

Definition at line 193 of file binnor.h.

Referenced by mkfit::StdSeq::clean_cms_seedtracks_iter(), mkfit::binnor< C, A1, A2, NB_first, NB_count >::finalize_registration(), and mkfit::binnor< C, A1, A2, NB_first, NB_count >::reset_contents().