19 std::vector< std::vector<size_t> >
const& tags_per_bridges,
23 const size_t N_HITS = bridges_per_hit.size();
25 tags_per_hit.resize(N_HITS);
27 for(
size_t i_hit=0; i_hit<N_HITS; i_hit++){
28 for(
size_t i_bridge=0; i_bridge<bridges_per_hit[i_hit].size(); i_bridge++){
29 tags_per_hit[i_hit].insert(tags_per_hit[i_hit].
end(),
30 tags_per_bridges[i_bridge].
begin(),
31 tags_per_bridges[i_bridge].
end());
38 std::vector<size_t>
const& tag_per_bridge,
42 const size_t N_HITS = bridges_per_hit.size();
45 tags_per_hit.resize(N_HITS);
47 for(
size_t i_hit=0; i_hit<N_HITS; i_hit++){
49 for(
size_t i_bridge=0; i_bridge<bridges_per_hit[i_hit].size(); i_bridge++){
51 if(i_bridge >= tag_per_bridge.size())
continue;
55 tags_per_hit[i_hit].push_back(tag_per_bridge[i_bridge]);
end
while True: pbar.update(maxval-len(onlies[E][S])) #print iS, "/", len(onlies[E][S]) found = False for...
HitTagAssociatorAlg(fhicl::ParameterSet const &p)
static int max(int a, int b)
decltype(auto) constexpr begin(T &&obj)
ADL-aware version of std::begin.
void MakeHitTagAssociations(std::vector< std::vector< size_t > > const &bridges_per_hit, std::vector< std::vector< size_t > > const &tags_per_bridges, std::vector< std::vector< size_t > > &tags_per_hit)