15 {
16
17
18
19
20
21 if (siblings.empty()){
23 return;
24 }
25
26 for (const auto& s : siblings){
27 if (satisfiedBy.at(s).empty()) {
29 return;
30 }
31 }
32
33 std::vector<std::size_t> satisfying;
34
35 for (const auto& s :siblings){
36 satisfying.insert(satisfying.end(),
37 satisfiedBy.at(s).cbegin(),
38 satisfiedBy.at(s).cend()
39 );
40 }
41
42
43
44
45
46 auto end = satisfying.end();
47 if (siblings.size() > 1) {
49 satisfying.end());
50
52 satisfying.end());
53 }
54
55 std::vector<std::size_t> jet_indices;
56 for(auto iter = satisfying.begin(); iter != end; ++iter) {
57 jet_indices.insert(jet_indices.end(),
58 jg2elemjgs.at(*iter).begin(),
59 jg2elemjgs.at(*iter).end());
60 }
61
63 jet_indices.end());
64
66 jet_indices.end());
67
68
69 jet_indices.resize(final_end-jet_indices.begin());
70
72 jg2elemjgs);
74 }
std::vector< std::size_t > m_jetIndices
std::vector< std::size_t > elementalJetGroups(const std::vector< std::size_t > &non_elemental, const JetGroupInd2ElemInds &jg2elemjg)
DataModel_detail::iterator< DVL > unique(typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end)
Specialization of unique for DataVector/List.
void sort(typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end)
Specialization of sort for DataVector/List.