File: MidPointAlgorithm.hh

package info (click to toggle)
fastjet 3.4.0%2Bdfsg-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 9,552 kB
  • sloc: cpp: 78,628; python: 6,112; sh: 1,038; fortran: 673; makefile: 636; ansic: 161
file content (99 lines) | stat: -rw-r--r-- 3,084 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
#ifndef _MIDPOINT_ALGORITHM_HH_
#define _MIDPOINT_ALGORITHM_HH_

//----------------------------------------------------------------------
// This file distributed with FastJet has been obtained from
// http://www.pa.msu.edu/~huston/Les_Houches_2005/JetClu+Midpoint-StandAlone.tgz
//
// Permission to distribute it with FastJet has been granted by Joey
// Huston (see the COPYING file in the main FastJet directory for
// details).
// Changes from the original file are listed below.
//----------------------------------------------------------------------

// History of changes compared to the original MidPointAlgorithm.hh file
// 
// 2009-01-17  Gregory Soyez  <soyez@fastjet.fr>
// 
//        * put the code in the fastjet::cdf namespace
// 
// 2007-03-10  Gavin Salam  <salam@lpthe.jussieu.fr>
// 
//        * added support for the pttilde scale choice in the CDF midpoint code
//
// 2007-02-21  Gavin Salam  <salam@lpthe.jussieu.fr>
// 
//        * added option of choosing the scale used in the split-merge
//          procedure (pt [default], Et or mt)
// 
// 2006-09-24  Gavin Salam  <salam@lpthe.jussieu.fr>
// 
//        * removed the local_sort method
// 
// 2006-09-24  Gavin Salam  <salam@lpthe.jussieu.fr>
// 
//        * added JetClu+MidPoint to FastJet


#include "PhysicsTower.hh"
#include "Cluster.hh"
#include <vector>

#include <fastjet/internal/base.hh>

FASTJET_BEGIN_NAMESPACE

namespace cdf{

class MidPointAlgorithm
{
 public:
  enum SplitMergeScale {SM_pt, SM_Et, SM_mt, SM_pttilde};

 private:
  double _seedThreshold;
  double _coneRadius;
  double _coneAreaFraction;
  int    _maxPairSize;
  int    _maxIterations;
  double _overlapThreshold;
  SplitMergeScale _smScale;

 public:
  MidPointAlgorithm():
    _seedThreshold(1),
    _coneRadius(0.7),
    _coneAreaFraction(0.25),
    _maxPairSize(2),
    _maxIterations(100),
    _overlapThreshold(0.75),
    _smScale(SM_pt)
  {}
  MidPointAlgorithm(double st, double cr, double caf, int mps, int mi, double ot, SplitMergeScale sm = SM_pt):
    _seedThreshold(st),
    _coneRadius(cr),
    _coneAreaFraction(caf),
    _maxPairSize(mps),
    _maxIterations(mi),
    _overlapThreshold(ot),
    _smScale(sm)
  {}
  void findStableConesFromSeeds(std::vector<PhysicsTower>& particles, std::vector<Cluster>& stableCones);
  void findStableConesFromMidPoints(std::vector<PhysicsTower>& particles, std::vector<Cluster>& stableCones);
  void iterateCone(volatile double startRapidity, volatile double startPhi, volatile double startPt, std::vector<PhysicsTower>& particles,
		   std::vector<Cluster>& stableCones, bool reduceConeSize);
  void addClustersToPairs(std::vector<int>& testPair, std::vector< std::vector<int> >& pairs,
			  std::vector< std::vector<bool> >& distanceOK, int maxClustersInPair);
  void splitAndMerge(std::vector<Cluster>& stableCones, std::vector<Cluster>& jets);
  void run(std::vector<PhysicsTower>& particles, std::vector<Cluster>& jets);

  /// sort the clusters into whatever order is 
  void local_sort(std::vector<Cluster>&);

};

}  // namespace cdf

FASTJET_END_NAMESPACE

#endif