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