Fork me on GitHub

source: git/external/fastjet/LazyTiling9Alt.cc@ 7278220

ImprovedOutputFile Timing dual_readout llp
Last change on this file since 7278220 was 35cdc46, checked in by Pavel Demin <demin@…>, 10 years ago

upgrade FastJet to version 3.1.0-beta.1, upgrade Nsubjettiness to version 2.1.0, add SoftKiller version 1.0.0
  • Property mode set to 100644
File size: 28.2 KB
RevLine 
[35cdc46]1//FJSTARTHEADER
2// $Id: LazyTiling9Alt.cc 3477 2014-07-29 14:34:39Z salam $
3//
4// Copyright (c) 2005-2014, Matteo Cacciari, Gavin P. Salam and Gregory Soyez
5//
6//----------------------------------------------------------------------
7// This file is part of FastJet.
8//
9// FastJet is free software; you can redistribute it and/or modify
10// it under the terms of the GNU General Public License as published by
11// the Free Software Foundation; either version 2 of the License, or
12// (at your option) any later version.
13//
14// The algorithms that underlie FastJet have required considerable
15// development. They are described in the original FastJet paper,
16// hep-ph/0512210 and in the manual, arXiv:1111.6097. If you use
17// FastJet as part of work towards a scientific publication, please
18// quote the version you use and include a citation to the manual and
19// optionally also to hep-ph/0512210.
20//
21// FastJet is distributed in the hope that it will be useful,
22// but WITHOUT ANY WARRANTY; without even the implied warranty of
23// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
24// GNU General Public License for more details.
25//
26// You should have received a copy of the GNU General Public License
27// along with FastJet. If not, see <http://www.gnu.org/licenses/>.
28//----------------------------------------------------------------------
29//FJENDHEADER
30
31#include <iomanip>
32#include "fastjet/internal/LazyTiling9Alt.hh"
33#include "fastjet/internal/TilingExtent.hh"
34using namespace std;
35
36FASTJET_BEGIN_NAMESPACE // defined in fastjet/internal/base.hh
37
38LazyTiling9Alt::LazyTiling9Alt(ClusterSequence & cs) :
39 _cs(cs), _jets(cs.jets())
40 //, _minheap(_jets.size())
41{
42 _Rparam = cs.jet_def().R();
43 _R2 = _Rparam * _Rparam;
44 _invR2 = 1.0 / _R2;
45 _initialise_tiles();
46}
47
48
49//----------------------------------------------------------------------
50/// Set up the tiles:
51/// - decide the range in eta
52/// - allocate the tiles
53/// - set up the cross-referencing info between tiles
54///
55/// The neighbourhood of a tile is set up as follows
56///
57/// LRR
58/// LXR
59/// LLR
60///
61/// such that tiles is an array containing XLLLLRRRR with pointers
62/// | \ RH_tiles
63/// \ surrounding_tiles
64///
65/// with appropriate precautions when close to the edge of the tiled
66/// region.
67///
68void LazyTiling9Alt::_initialise_tiles() {
69
70 // first decide tile sizes (with a lower bound to avoid huge memory use with
71 // very small R)
72 double default_size = max(0.1,_Rparam);
73 _tile_size_eta = default_size;
74 // it makes no sense to go below 3 tiles in phi -- 3 tiles is
75 // sufficient to make sure all pair-wise combinations up to pi in
76 // phi are possible
77 _n_tiles_phi = max(3,int(floor(twopi/default_size)));
78 _tile_size_phi = twopi / _n_tiles_phi; // >= _Rparam and fits in 2pi
79
80 // always include zero rapidity in the tiling region
81 _tiles_eta_min = 0.0;
82 _tiles_eta_max = 0.0;
83 // but go no further than following
84 const double maxrap = 7.0;
85
86 // and find out how much further one should go
87 for(unsigned int i = 0; i < _jets.size(); i++) {
88 double eta = _jets[i].rap();
89 // first check if eta is in range -- to avoid taking into account
90 // very spurious rapidities due to particles with near-zero kt.
91 if (abs(eta) < maxrap) {
92 if (eta < _tiles_eta_min) {_tiles_eta_min = eta;}
93 if (eta > _tiles_eta_max) {_tiles_eta_max = eta;}
94 }
95 }
96
97 // now adjust the values
98 _tiles_ieta_min = int(floor(_tiles_eta_min/_tile_size_eta));
99 _tiles_ieta_max = int(floor( _tiles_eta_max/_tile_size_eta));
100 _tiles_eta_min = _tiles_ieta_min * _tile_size_eta;
101 _tiles_eta_max = _tiles_ieta_max * _tile_size_eta;
102
103 _tile_half_size_eta = _tile_size_eta * 0.5;
104 _tile_half_size_phi = _tile_size_phi * 0.5;
105
106 // set up information about whether we need to allow for "periodic"
107 // wrapping tests in delta_phi calculations
108 vector<bool> use_periodic_delta_phi(_n_tiles_phi, false);
109 if (_n_tiles_phi <= 3) {
110 fill(use_periodic_delta_phi.begin(), use_periodic_delta_phi.end(), true);
111 } else {
112 use_periodic_delta_phi[0] = true;
113 use_periodic_delta_phi[_n_tiles_phi-1] = true;
114 }
115
116 // allocate the tiles
117 _tiles.resize((_tiles_ieta_max-_tiles_ieta_min+1)*_n_tiles_phi);
118
119 // now set up the cross-referencing between tiles
120 for (int ieta = _tiles_ieta_min; ieta <= _tiles_ieta_max; ieta++) {
121 for (int iphi = 0; iphi < _n_tiles_phi; iphi++) {
122 Tile * tile = & _tiles[_tile_index(ieta,iphi)];
123 // no jets in this tile yet
124 tile->head = NULL; // first element of tiles points to itself
125 tile->begin_tiles[0] = Tile::TileFnPair(tile,&Tile::distance_to_centre);
126 Tile::TileFnPair * pptile = & (tile->begin_tiles[0]);
127 pptile++;
128 //
129 // set up L's in column to the left of X
130 tile->surrounding_tiles = pptile;
131 if (ieta > _tiles_ieta_min) {
132 // with the itile subroutine, we can safely run tiles from
133 // idphi=-1 to idphi=+1, because it takes care of
134 // negative and positive boundaries
135 //for (int idphi = -1; idphi <=+1; idphi++) {
136 // *pptile = & _tiles[_tile_index(ieta-1,iphi+idphi)];
137 // pptile++;
138 //}
139 *pptile = Tile::TileFnPair(& _tiles[_tile_index(ieta-1,iphi-1)],
140 &Tile::distance_to_left_bottom);
141 pptile++;
142 *pptile = Tile::TileFnPair(& _tiles[_tile_index(ieta-1,iphi)],
143 &Tile::distance_to_left);
144 pptile++;
145 *pptile = Tile::TileFnPair(& _tiles[_tile_index(ieta-1,iphi+1)],
146 &Tile::distance_to_left_top);
147 pptile++;
148 }
149 // now set up last L (below X)
150 *pptile = Tile::TileFnPair(& _tiles[_tile_index(ieta,iphi-1)],
151 &Tile::distance_to_bottom);
152 pptile++;
153 // set up first R (above X)
154 tile->RH_tiles = pptile;
155 *pptile = Tile::TileFnPair(& _tiles[_tile_index(ieta,iphi+1)],
156 &Tile::distance_to_top);
157 pptile++;
158 // set up remaining R's, to the right of X
159 if (ieta < _tiles_ieta_max) {
160 //for (int idphi = -1; idphi <= +1; idphi++) {
161 // *pptile = & _tiles[_tile_index(ieta+1,iphi+idphi)];
162 // pptile++;
163 //}
164 *pptile = Tile::TileFnPair(& _tiles[_tile_index(ieta+1,iphi-1)],
165 &Tile::distance_to_right_bottom);
166 pptile++;
167 *pptile = Tile::TileFnPair(& _tiles[_tile_index(ieta+1,iphi)],
168 &Tile::distance_to_right);
169 pptile++;
170 *pptile = Tile::TileFnPair(& _tiles[_tile_index(ieta+1,iphi+1)],
171 &Tile::distance_to_right_top);
172 pptile++;
173 }
174 // now put semaphore for end tile
175 tile->end_tiles = pptile;
176 // finally make sure tiles are untagged
177 tile->tagged = false;
178 // and store the information about periodicity in phi
179 tile->use_periodic_delta_phi = use_periodic_delta_phi[iphi];
180 // and ensure max distance is sensibly initialised
181 tile->max_NN_dist = 0;
182 // and also position of centre of tile
183 tile->eta_min = ieta*_tile_size_eta;
184 tile->eta_max = (ieta+1)*_tile_size_eta;
185 tile->phi_min = iphi*_tile_size_phi;
186 tile->phi_max = (iphi+1)*_tile_size_phi;
187 }
188 }
189
190}
191
192//----------------------------------------------------------------------
193/// return the tile index corresponding to the given eta,phi point
194int LazyTiling9Alt::_tile_index(const double eta, const double phi) const {
195 int ieta, iphi;
196 if (eta <= _tiles_eta_min) {ieta = 0;}
197 else if (eta >= _tiles_eta_max) {ieta = _tiles_ieta_max-_tiles_ieta_min;}
198 else {
199 //ieta = int(floor((eta - _tiles_eta_min) / _tile_size_eta));
200 ieta = int(((eta - _tiles_eta_min) / _tile_size_eta));
201 // following needed in case of rare but nasty rounding errors
202 if (ieta > _tiles_ieta_max-_tiles_ieta_min) {
203 ieta = _tiles_ieta_max-_tiles_ieta_min;}
204 }
205 // allow for some extent of being beyond range in calculation of phi
206 // as well
207 //iphi = (int(floor(phi/_tile_size_phi)) + _n_tiles_phi) % _n_tiles_phi;
208 // with just int and no floor, things run faster but beware
209 iphi = int((phi+twopi)/_tile_size_phi) % _n_tiles_phi;
210 return (iphi + ieta * _n_tiles_phi);
211}
212
213
214//----------------------------------------------------------------------
215// sets up information regarding the tiling of the given jet
216inline void LazyTiling9Alt::_tj_set_jetinfo( TiledJet * const jet,
217 const int _jets_index) {
218 // first call the generic setup
219 _bj_set_jetinfo<>(jet, _jets_index);
220
221 // Then do the setup specific to the tiled case.
222
223 // Find out which tile it belonds to
224 jet->tile_index = _tile_index(jet->eta, jet->phi);
225
226 // Insert it into the tile's linked list of jets
227 Tile * tile = &_tiles[jet->tile_index];
228 jet->previous = NULL;
229 jet->next = tile->head;
230 if (jet->next != NULL) {jet->next->previous = jet;}
231 tile->head = jet;
232}
233
234
235//----------------------------------------------------------------------
236void LazyTiling9Alt::_bj_remove_from_tiles(TiledJet * const jet) {
237 Tile * tile = & _tiles[jet->tile_index];
238
239 if (jet->previous == NULL) {
240 // we are at head of the tile, so reset it.
241 // If this was the only jet on the tile then tile->head will now be NULL
242 tile->head = jet->next;
243 } else {
244 // adjust link from previous jet in this tile
245 jet->previous->next = jet->next;
246 }
247 if (jet->next != NULL) {
248 // adjust backwards-link from next jet in this tile
249 jet->next->previous = jet->previous;
250 }
251}
252
253
254//----------------------------------------------------------------------
255/// output the contents of the tiles
256void LazyTiling9Alt::_print_tiles(TiledJet * briefjets ) const {
257 for (vector<Tile>::const_iterator tile = _tiles.begin();
258 tile < _tiles.end(); tile++) {
259 cout << "Tile " << tile - _tiles.begin()<<" = ";
260 vector<int> list;
261 for (TiledJet * jetI = tile->head; jetI != NULL; jetI = jetI->next) {
262 list.push_back(jetI-briefjets);
263 //cout <<" "<<jetI-briefjets;
264 }
265 sort(list.begin(),list.end());
266 for (unsigned int i = 0; i < list.size(); i++) {cout <<" "<<list[i];}
267 cout <<"\n";
268 }
269}
270
271
272//----------------------------------------------------------------------
273/// Add to the vector tile_union the tiles that are in the neighbourhood
274/// of the specified tile_index, including itself -- start adding
275/// from position n_near_tiles-1, and increase n_near_tiles as
276/// you go along (could have done it more C++ like with vector with reserved
277/// space, but fear is that it would have been slower, e.g. checking
278/// for end of vector at each stage to decide whether to resize it)
279void LazyTiling9Alt::_add_neighbours_to_tile_union(const int tile_index,
280 vector<int> & tile_union, int & n_near_tiles) const {
281 for (Tile::TileFnPair const * near_tile = _tiles[tile_index].begin_tiles;
282 near_tile != _tiles[tile_index].end_tiles; near_tile++){
283 // get the tile number
284 tile_union[n_near_tiles] = near_tile->first - & _tiles[0];
285 n_near_tiles++;
286 }
287}
288
289
290//----------------------------------------------------------------------
291/// Like _add_neighbours_to_tile_union, but only adds neighbours if
292/// their "tagged" status is false; when a neighbour is added its
293/// tagged status is set to true.
294inline void LazyTiling9Alt::_add_untagged_neighbours_to_tile_union(
295 const int tile_index,
296 vector<int> & tile_union, int & n_near_tiles) {
297 for (Tile::TileFnPair * near_tile = _tiles[tile_index].begin_tiles;
298 near_tile != _tiles[tile_index].end_tiles; near_tile++){
299 if (! (near_tile->first)->tagged) {
300 (near_tile->first)->tagged = true;
301 // get the tile number
302 tile_union[n_near_tiles] = near_tile->first - & _tiles[0];
303 n_near_tiles++;
304 }
305 }
306}
307
308//----------------------------------------------------------------------
309/// Like _add_neighbours_to_tile_union, but adds tiles that are
310/// "neighbours" of a jet (rather than a tile) and only if a
311/// neighbouring tile's max_NN_dist is >= the distance between the jet
312/// and the nearest point on the tile. It ignores tiles that have
313/// already been tagged.
314inline void LazyTiling9Alt::_add_untagged_neighbours_to_tile_union_using_max_info(
315 const TiledJet * jet,
316 vector<int> & tile_union, int & n_near_tiles) {
317 Tile & tile = _tiles[jet->tile_index];
318
319 for (Tile::TileFnPair * near_tile = tile.begin_tiles; near_tile != tile.end_tiles; near_tile++){
320 if ((near_tile->first)->tagged) continue;
321 double dist = (tile.*(near_tile->second))(jet);
322 // cout << " max info looked at tile " << *near_tile - &_tiles[0]
323 // << ", dist = " << dist << " " << (*near_tile)->max_NN_dist
324 // << endl;
325 if (dist > (near_tile->first)->max_NN_dist) continue;
326
327 // cout << " max info tagged tile " << *near_tile - &_tiles[0] << endl;
328 (near_tile->first)->tagged = true;
329 // get the tile number
330 tile_union[n_near_tiles] = near_tile->first - & _tiles[0];
331 n_near_tiles++;
332 }
333}
334
335//--------TMPTMPTMPTMPTMP-----GPS TEMP--------------------
336ostream & operator<<(ostream & ostr, const TiledJet & jet) {
337 ostr << "j" << setw(3) << jet._jets_index << ":pt2,rap,phi=" ; ostr.flush();
338 ostr << jet.kt2 << ","; ostr.flush();
339 ostr << jet.eta << ","; ostr.flush();
340 ostr << jet.phi; ostr.flush();
341 ostr << ", tile=" << jet.tile_index; ostr.flush();
342 return ostr;
343}
344
345
346// //----------------------------------------------------------------------
347// /// returns a particle's distance to the edge of the specified tile
348// inline double LazyTiling9Alt::_distance_to_tile(const TiledJet * bj, const Tile * tile) const {
349//
350// // // Note the careful way of checking the minimum potential deta:
351// // // unlike the phi case below, we don't calculate the distance to the
352// // // centre and subtract spacing/2. This is because of issue of
353// // // boundary tiles, which can extend far beyond spacing/2 in eta.
354// // // Using the positions of tile centers should instead be safe.
355// // double deta;
356// // if (_tiles[bj->tile_index].eta_centre == tile->eta_centre) deta = 0;
357// // //else deta = std::abs(bj->eta - tile->eta_centre) - 0.5*_tile_size_eta;
358// // else deta = std::abs(bj->eta - tile->eta_centre) - _tile_half_size_eta;
359// // // ------
360// // // |
361// // // A | B
362// // // ------
363// // // |
364// // // C | D
365// // // ------
366// //
367// // double dphi = std::abs(bj->phi - tile->phi_centre);
368// // if (dphi > pi) dphi = twopi-dphi;
369// // dphi -= _tile_half_size_phi;
370// // //dphi -= 0.5*_tile_size_phi;
371// // if (dphi < 0) dphi = 0;
372// //
373// // return dphi*dphi + deta*deta;
374//
375// return 0.0;
376// }
377
378
379
380
381//----------------------------------------------------------------------
382/// looks at distance between jetX and jetI and updates the NN
383/// information if relevant; also pushes identity of jetI onto
384/// the vector of jets for minheap, to signal that it will have
385/// to be handled later.
386///
387/// GPS TEMP GPS TMP: REMOVE THIS LATER: EVEN LABELLED AS INLINE, THE
388/// CALL ADDS A SUBSTANTIAL PENALTY...
389inline void LazyTiling9Alt::_update_jetX_jetI_NN(TiledJet * jetX, TiledJet * jetI, vector<TiledJet *> & jets_for_minheap) {
390 double dist = _bj_dist(jetI,jetX);
391 if (dist < jetI->NN_dist) {
392 if (jetI != jetX) {
393 jetI->NN_dist = dist;
394 jetI->NN = jetX;
395 // label jetI as needing heap action...
396 if (!jetI->minheap_update_needed()) {
397 jetI->label_minheap_update_needed();
398 jets_for_minheap.push_back(jetI);
399 }
400 }
401 }
402 if (dist < jetX->NN_dist) {
403 if (jetI != jetX) {
404 jetX->NN_dist = dist;
405 jetX->NN = jetI;}
406 }
407}
408
409
410inline void LazyTiling9Alt::_set_NN(TiledJet * jetI,
411 vector<TiledJet *> & jets_for_minheap) {
412 jetI->NN_dist = _R2;
413 jetI->NN = NULL;
414 // label jetI as needing heap action...
415 if (!jetI->minheap_update_needed()) {
416 jetI->label_minheap_update_needed();
417 jets_for_minheap.push_back(jetI);}
418 // now go over tiles that are neighbours of I (include own tile)
419 Tile * tile_ptr = &_tiles[jetI->tile_index];
420 //if (tile_ptr->is_near_zero_phi(_tile_half_size_phi)) {
421 for (Tile::TileFnPair * near_tile = tile_ptr->begin_tiles;
422 near_tile != tile_ptr->end_tiles; near_tile++) {
423 // for own tile, this will be zero automatically: should we be clever
424 // and skip the test? (With some doubling of code?)
425 if (jetI->NN_dist < (tile_ptr->*(near_tile->second))(jetI)) continue;
426 // and then over the contents of that tile
427 for (TiledJet * jetJ = (near_tile->first)->head;
428 jetJ != NULL; jetJ = jetJ->next) {
429 double dist = _bj_dist(jetI,jetJ);
430 if (dist < jetI->NN_dist && jetJ != jetI) {
431 jetI->NN_dist = dist; jetI->NN = jetJ;
432 }
433 }
434 }
435 // } else {
436 // // second copy that exploits the fact that for this tile we needn't worry
437 // // about periodicity
438 // for (Tile::TileFnPair * near_tile = tile_ptr->begin_tiles;
439 // near_tile != tile_ptr->end_tiles; near_tile++) {
440 // // for own tile, this will be zero automatically: should we be clever
441 // // and skip the test? (With some doubling of code?)
442 // if (jetI->NN_dist < tile_ptr->(*(near_tile->second)(jetI))) continue;
443 // // and then over the contents of that tile
444 // for (TiledJet * jetJ = (*near_tile)->head;
445 // jetJ != NULL; jetJ = jetJ->next) {
446 // double dist = _bj_dist_not_periodic(jetI,jetJ);
447 // if (dist < jetI->NN_dist && jetJ != jetI) {
448 // jetI->NN_dist = dist; jetI->NN = jetJ;
449 // }
450 // }
451 // }
452 // }
453}
454
455
456void LazyTiling9Alt::run() {
457
458 //_initialise_tiles();
459
460 int n = _jets.size();
461 TiledJet * briefjets = new TiledJet[n];
462 TiledJet * jetA = briefjets, * jetB;
463 TiledJet oldB;
464
465
466 // will be used quite deep inside loops, but declare it here so that
467 // memory (de)allocation gets done only once
468 vector<int> tile_union(3*n_tile_neighbours);
469
470 // initialise the basic jet info
471 for (int i = 0; i< n; i++) {
472 _tj_set_jetinfo(jetA, i);
473 //cout << i<<": "<<jetA->tile_index<<"\n";
474 jetA++; // move on to next entry of briefjets
475 }
476 TiledJet * head = briefjets; // a nicer way of naming start
477
478 // set up the initial nearest neighbour information
479 vector<Tile>::iterator tile;
480 for (tile = _tiles.begin(); tile != _tiles.end(); tile++) {
481 // first do it on this tile
482 for (jetA = tile->head; jetA != NULL; jetA = jetA->next) {
483 for (jetB = tile->head; jetB != jetA; jetB = jetB->next) {
484 double dist = _bj_dist_not_periodic(jetA,jetB);
485 if (dist < jetA->NN_dist) {jetA->NN_dist = dist; jetA->NN = jetB;}
486 if (dist < jetB->NN_dist) {jetB->NN_dist = dist; jetB->NN = jetA;}
487 }
488 }
489 for (jetA = tile->head; jetA != NULL; jetA = jetA->next) {
490 if (jetA->NN_dist > tile->max_NN_dist) tile->max_NN_dist = jetA->NN_dist;
491 }
492 }
493 for (tile = _tiles.begin(); tile != _tiles.end(); tile++) {
494 if (tile->use_periodic_delta_phi) {
495 // then do it for RH tiles;
496 for (Tile::TileFnPair * RTileFnPair = tile->RH_tiles;
497 RTileFnPair != tile->end_tiles; RTileFnPair++) {
498 Tile *RTile = RTileFnPair->first;
499 for (jetA = tile->head; jetA != NULL; jetA = jetA->next) {
500 double dist_to_tile = ((*tile).*(RTileFnPair->second))(jetA);
501 // it only makes sense to do a tile if jetA is close enough to the Rtile
502 // either for a jet in the Rtile to be closer to jetA than it's current NN
503 // or if jetA could be closer to something in the Rtile than the largest
504 // NN distance within the RTile.
505 //
506 // GPS note: also tried approach where we perform only the
507 // first test and run over all surrounding tiles
508 // (not just RH ones). The test is passed less
509 // frequently, but one is running over more tiles
510 // and on balance, for the trial event we used, it's
511 // a bit slower.
512 bool relevant_for_jetA = dist_to_tile <= jetA->NN_dist;
513 bool relevant_for_RTile = dist_to_tile <= RTile->max_NN_dist;
514 if (relevant_for_jetA || relevant_for_RTile) {
515 for (jetB = RTile->head; jetB != NULL; jetB = jetB->next) {
516 double dist = _bj_dist(jetA,jetB);
517 if (dist < jetA->NN_dist) {jetA->NN_dist = dist; jetA->NN = jetB;}
518 if (dist < jetB->NN_dist) {jetB->NN_dist = dist; jetB->NN = jetA;}
519 }
520 }
521 }
522 }
523 } else {
524 // this second version of the code uses the faster
525 // "not_periodic" version because it knows that the tile is
526 // sufficiently far from the edge.
527 for (Tile::TileFnPair* RTileFnPair = tile->RH_tiles;
528 RTileFnPair != tile->end_tiles; RTileFnPair++) {
529 Tile *RTile = RTileFnPair->first;
530 for (jetA = tile->head; jetA != NULL; jetA = jetA->next) {
531 double dist_to_tile = ((*tile).*(RTileFnPair->second))(jetA);
532 bool relevant_for_jetA = dist_to_tile <= jetA->NN_dist;
533 bool relevant_for_RTile = dist_to_tile <= RTile->max_NN_dist;
534 if (relevant_for_jetA || relevant_for_RTile) {
535 for (jetB = RTile->head; jetB != NULL; jetB = jetB->next) {
536 double dist = _bj_dist_not_periodic(jetA,jetB);
537 if (dist < jetA->NN_dist) {jetA->NN_dist = dist; jetA->NN = jetB;}
538 if (dist < jetB->NN_dist) {jetB->NN_dist = dist; jetB->NN = jetA;}
539 }
540 }
541 }
542 }
543 }
544 // no need to do it for LH tiles, since they are implicitly done
545 // when we set NN for both jetA and jetB on the RH tiles.
546 }
547 // Now update the max_NN_dist within each tile. Not strictly
548 // necessary, because existing max_NN_dist is an upper bound. but
549 // costs little and may give some efficiency gain later.
550 for (tile = _tiles.begin(); tile != _tiles.end(); tile++) {
551 tile->max_NN_dist = 0;
552 for (jetA = tile->head; jetA != NULL; jetA = jetA->next) {
553 if (jetA->NN_dist > tile->max_NN_dist) tile->max_NN_dist = jetA->NN_dist;
554 }
555 }
556
557
558 vector<double> diJs(n);
559 for (int i = 0; i < n; i++) {
560 diJs[i] = _bj_diJ(&briefjets[i]);
561 briefjets[i].label_minheap_update_done();
562 }
563 MinHeap minheap(diJs);
564 // have a stack telling us which jets we'll have to update on the heap
565 vector<TiledJet *> jets_for_minheap;
566 jets_for_minheap.reserve(n);
567
568 // now run the recombination loop
569 int history_location = n-1;
570 while (n > 0) {
571
572 double diJ_min = minheap.minval() *_invR2;
573 jetA = head + minheap.minloc();
574
575 // do the recombination between A and B
576 history_location++;
577 jetB = jetA->NN;
578
579 if (jetB != NULL) {
580 // jet-jet recombination
581 // If necessary relabel A & B to ensure jetB < jetA, that way if
582 // the larger of them == newtail then that ends up being jetA and
583 // the new jet that is added as jetB is inserted in a position that
584 // has a future!
585 if (jetA < jetB) {std::swap(jetA,jetB);}
586
587 int nn; // new jet index
588 _cs.plugin_record_ij_recombination(jetA->_jets_index, jetB->_jets_index, diJ_min, nn);
589
590 // what was jetB will now become the new jet
591 _bj_remove_from_tiles(jetA);
592 oldB = * jetB; // take a copy because we will need it...
593 _bj_remove_from_tiles(jetB);
594 _tj_set_jetinfo(jetB, nn); // cause jetB to become _jets[nn]
595 // (also registers the jet in the tiling)
596 } else {
597 // jet-beam recombination
598 // get the hist_index
599 _cs.plugin_record_iB_recombination(jetA->_jets_index, diJ_min);
600 _bj_remove_from_tiles(jetA);
601 }
602
603 // remove the minheap entry for jetA
604 minheap.remove(jetA-head);
605
606 // first establish the set of tiles over which we are going to
607 // have to run searches for updated and new nearest-neighbours --
608 // basically a combination of vicinity of the tiles of the two old
609 // and one new jet.
610 int n_near_tiles = 0;
611 _add_untagged_neighbours_to_tile_union_using_max_info(jetA,
612 tile_union, n_near_tiles);
613 if (jetB != NULL) {
614 _add_untagged_neighbours_to_tile_union_using_max_info(&oldB,
615 tile_union,n_near_tiles);
616 jetB->label_minheap_update_needed();
617 jets_for_minheap.push_back(jetB);
618 }
619
620
621 // Initialise jetB's NN distance as well as updating it for
622 // other particles.
623 // Run over all tiles in our union
624
625 if (jetB != NULL) {
626 Tile & jetB_tile = _tiles[jetB->tile_index];
627 for (Tile::TileFnPair * near_tile_fn_pair = jetB_tile.begin_tiles;
628 near_tile_fn_pair != jetB_tile.end_tiles; near_tile_fn_pair++) {
629 Tile * near_tile = near_tile_fn_pair->first;
630
631 double dist_to_tile = (jetB_tile.*(near_tile_fn_pair->second))(jetB);
632 // use <= in next line so that on first tile, relevant_for_jetB is
633 // set to true
634 bool relevant_for_jetB = dist_to_tile <= jetB->NN_dist;
635 bool relevant_for_near_tile = dist_to_tile <= near_tile->max_NN_dist;
636 bool relevant = relevant_for_jetB || relevant_for_near_tile;
637 // this first option decides exactly what loop to do based on whether
638 // the near tile was tagged. You'd think it's more efficient, but
639 // not necessarily...
640 if (relevant) {
641 if (near_tile->tagged) {
642 for (TiledJet * jetI = near_tile->head; jetI != NULL; jetI = jetI->next) {
643 if (jetI->NN == jetA || jetI->NN == jetB) _set_NN(jetI, jets_for_minheap);
644 _update_jetX_jetI_NN(jetB, jetI, jets_for_minheap);
645 }
646 near_tile->tagged = false;
647 } else {
648 for (TiledJet * jetI = near_tile->head; jetI != NULL; jetI = jetI->next) {
649 _update_jetX_jetI_NN(jetB, jetI, jets_for_minheap);
650 }
651 }
652 }
653
654 // this second option does everything independently of whether the near tile
655 // was tagged -- somehow you'd expect it to be slower, but it may actually be
656 // marginally faster.
657 // if (relevant_for_jetB || relevant_for_near_tile) {
658 // for (TiledJet * jetI = (*near_tile)->head; jetI != NULL; jetI = jetI->next) {
659 //
660 // if (jetI->NN == jetA || (jetI->NN == jetB && jetB != NULL)) {
661 // _set_NN(jetI, jets_for_minheap);
662 // }
663 //
664 // _update_jetX_jetI_NN(jetB, jetI, jets_for_minheap);
665 // // -- Keep this old inline code for later speed tests
666 // // double dist = _bj_dist(jetI,jetB);
667 // // if (dist < jetI->NN_dist) {
668 // // if (jetI != jetB) {
669 // // jetI->NN_dist = dist;
670 // // jetI->NN = jetB;
671 // // // label jetI as needing heap action...
672 // // if (!jetI->minheap_update_needed()) {
673 // // jetI->label_minheap_update_needed();
674 // // jets_for_minheap.push_back(jetI);
675 // // }
676 // // }
677 // // }
678 // // if (dist < jetB->NN_dist) {
679 // // if (jetI != jetB) {
680 // // jetB->NN_dist = dist;
681 // // jetB->NN = jetI;}
682 // // }
683 // }
684 // (*near_tile)->tagged = false;
685 // }
686 }
687 }
688
689 // now run over the tiles that were tagged earlier and that we haven't yet
690 // had a change to visit.
691 for (int itile = 0; itile < n_near_tiles; itile++) {
692 Tile * tile_ptr = &_tiles[tile_union[itile]];
693 if (!tile_ptr->tagged) continue; // because earlier loop may have undone the tag
694 tile_ptr->tagged = false;
695 // run over all jets in the current tile
696 for (TiledJet * jetI = tile_ptr->head; jetI != NULL; jetI = jetI->next) {
697 // see if jetI had jetA or jetB as a NN -- if so recalculate the NN
698 if (jetI->NN == jetA || (jetI->NN == jetB && jetB != NULL)) {
699 _set_NN(jetI, jets_for_minheap);
700 }
701 }
702 }
703
704 // deal with jets whose minheap entry needs updating
705 //if (verbose) cout << " jets whose NN was modified: " << endl;
706 while (jets_for_minheap.size() > 0) {
707 TiledJet * jetI = jets_for_minheap.back();
708 jets_for_minheap.pop_back();
709 minheap.update(jetI-head, _bj_diJ(jetI));
710 jetI->label_minheap_update_done();
711 // handle max_NN_dist update for all jets that might have
712 // seen a change (increase) of distance
713 Tile & tile_I = _tiles[jetI->tile_index];
714 if (tile_I.max_NN_dist < jetI->NN_dist) tile_I.max_NN_dist = jetI->NN_dist;
715 }
716 n--;
717 }
718
719 // final cleaning up;
720 delete[] briefjets;
721}
722
723
724FASTJET_END_NAMESPACE
Note: See TracBrowser for help on using the repository browser.