- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
external/fastjet/contribs/RecursiveTools/RecursiveSoftDrop.cc
rb7b836a rcb80e6f 1 // $Id: RecursiveSoftDrop.cc 11 11 2018-04-04 10:06:11Z gsoyez $1 // $Id: RecursiveSoftDrop.cc 1192 2018-10-30 16:08:36Z gsoyez $ 2 2 // 3 3 // Copyright (c) 2017-, Gavin P. Salam, Gregory Soyez, Jesse Thaler, … … 148 148 const vector<PseudoJet> &cs_jets = cs->jets(); 149 149 150 // initiali ze counter to 1 subjet (i.e. the full ca_jet)150 // initialise counter to 1 subjet (i.e. the full ca_jet) 151 151 int n_tagged = 0; 152 152 int max_njet = ca_jet.constituents().size(); … … 163 163 164 164 // create a priority queue containing the subjets and a comparison definition 165 // initialise to the full ca_jet166 165 priority_queue<internal_recursive_softdrop::RSDHistoryElement*, vector<internal_recursive_softdrop::RSDHistoryElement*>, internal_recursive_softdrop::OrderRSDHistoryElements> active_branches; 167 166 active_branches.push(& (history[0])); … … 169 168 PseudoJet parent, piece1, piece2; 170 169 double sym, mu2; 171 172 // which R0 to use173 //double R0sqr = _R0sqr;174 170 175 171 // loop over C/A tree until we reach the appropriate number of subjets 176 172 while ((continue_grooming(n_tagged)) && (active_branches.size())) { 177 // get the element corresponding to the max dR 178 // and the associated PJ 173 // get the element corresponding to the max dR and the associated PJ 179 174 internal_recursive_softdrop::RSDHistoryElement * elm = active_branches.top(); 180 175 PseudoJet parent = cs_jets[cs_history[elm->current_in_ca_tree].jetp_index]; … … 217 212 active_branches.pop(); 218 213 // tagging failed and the softest branch should be dropped 219 // keep track of what has een groomed away214 // keep track of what has been groomed away 220 215 max_njet -= piece2.constituents().size(); 221 216 elm->dropped_delta_R .push_back((elm->theta_squared >= 0) ? sqrt(elm->theta_squared) : -sqrt(elm->theta_squared)); … … 223 218 elm->dropped_mu .push_back((mu2>=0) ? sqrt(mu2) : -sqrt(mu2)); 224 219 225 // keep the hardest b hanch in the recursion220 // keep the hardest branch in the recursion 226 221 elm->reset(piece1, this); 227 222 active_branches.push(elm); … … 256 251 const internal_recursive_softdrop::RSDHistoryElement & elm = history[history_index]; 257 252 258 // two kinds of events: either just a final leave, pote itiallywith grooming253 // two kinds of events: either just a final leave, potentially with grooming 259 254 // or a brandhing (also with potential grooming at the end) 260 255 if (elm.child1_in_history<0){ 261 // this is a leaf, i.e. with no further su structure256 // this is a leaf, i.e. with no further substructure 262 257 PseudoJet & subjet = mapped_to_history[history_index] 263 258 = cs_jets[cs_history[elm.current_in_ca_tree].jetp_index]; … … 303 298 const vector<PseudoJet> &cs_jets = cs->jets(); 304 299 305 // initiali ze counter to 1 subjet (i.e. the full ca_jet)300 // initialise counter to 1 subjet (i.e. the full ca_jet) 306 301 int n_depth = 0; 307 302 int max_njet = ca_jet.constituents().size(); … … 319 314 320 315 // create a priority queue containing the subjets and a comparison definition 321 // initialize counter to 1 subjet (i.e. the full ca_jet)322 316 list<internal_recursive_softdrop::RSDHistoryElement*> active_branches; 323 317 active_branches.push_back(& (history[0])); … … 329 323 list<internal_recursive_softdrop::RSDHistoryElement*>::iterator hist_it=active_branches.begin(); 330 324 while (hist_it!=active_branches.end()){ 331 // get the element corresponding to the max dR 332 // and the associated PJ 325 // get the element corresponding to the max dR and the associated PJ 333 326 internal_recursive_softdrop::RSDHistoryElement * elm = (*hist_it); 334 327 PseudoJet parent = cs_jets[cs_history[elm->current_in_ca_tree].jetp_index];
Note:
See TracChangeset
for help on using the changeset viewer.