| 370be031 |
1 | //STARTHEADER |
| 2 | // $Id: FjClusterSequence.hh 945 2007-11-09 08:46:04Z salam $ |
| 3 | // |
| 4 | // Copyright (c) 2005-2006, Matteo Cacciari and Gavin Salam |
| 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 and are described in hep-ph/0512210. If you use |
| 16 | // FastJet as part of work towards a scientific publication, please |
| 17 | // include a citation to the FastJet paper. |
| 18 | // |
| 19 | // FastJet is distributed in the hope that it will be useful, |
| 20 | // but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 21 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 22 | // GNU General Public License for more details. |
| 23 | // |
| 24 | // You should have received a copy of the GNU General Public License |
| 25 | // along with FastJet; if not, write to the Free Software |
| 26 | // Foundation, Inc.: |
| 27 | // 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
| 28 | //---------------------------------------------------------------------- |
| 29 | //ENDHEADER |
| 30 | |
| 31 | |
| 32 | #ifndef __FJCLUSTERSEQUENCE_HH__ |
| 33 | #define __FJCLUSTERSEQUENCE_HH__ |
| 34 | |
| 35 | |
| 36 | #ifndef __BACKWARD_WARNING_V1__ |
| 37 | #define __BACKWARD_WARNING_V1__ |
| 38 | #warning This file includes at least one deprecated FastJet header from v1. \ |
| 39 | All fastjet components (including plugins) should now be accessed by including fastjet/... |
| 40 | #endif // __BACKWARD_WARNING_V1__ |
| 41 | |
| 42 | #include "fastjet/ClusterSequence.hh" |
| 43 | |
| 44 | |
| 45 | /// typedef which provides backwards compatibility for |
| 46 | /// user programs based on the v1 interface |
| 47 | typedef fastjet::ClusterSequence FjClusterSequence; |
| 48 | |
| 49 | /// typedef which provides backwards compatibility for |
| 50 | /// user programs based on the v1 interface |
| 51 | typedef fastjet::Strategy FjStrategy; |
| 52 | |
| 53 | |
| 54 | // below follow redefinitions of all the strategy constants |
| 55 | // to allow a v1 legacy user to access the strategy names |
| 56 | // as before |
| 57 | |
| 58 | /// experimental ... |
| 59 | const FjStrategy N2MinHeapTiled = fastjet::N2MinHeapTiled; |
| 60 | /// fastest from about 50..10^4 |
| 61 | const FjStrategy N2Tiled = fastjet::N2Tiled; |
| 62 | /// legacy |
| 63 | const FjStrategy N2PoorTiled = fastjet::N2PoorTiled; |
| 64 | /// fastest below 50 |
| 65 | const FjStrategy N2Plain = fastjet::N2Plain; |
| 66 | /// worse even than the usual N^3 algorithms |
| 67 | const FjStrategy N3Dumb = fastjet::N3Dumb; |
| 68 | /// automatic selection of the best (based on N) |
| 69 | const FjStrategy Best = fastjet::Best; |
| 70 | /// best of the NlnN variants -- best overall for N>10^4 |
| 71 | const FjStrategy NlnN = fastjet::NlnN; |
| 72 | /// legacy N ln N using 3pi coverage of cylinder |
| 73 | const FjStrategy NlnN3pi = fastjet::NlnN3pi; |
| 74 | /// legacy N ln N using 4pi coverage of cylinder |
| 75 | const FjStrategy NlnN4pi = fastjet::NlnN4pi; |
| 76 | /// Chan's closest pair method (in a variant with 4pi coverage), |
| 77 | /// for use exclusively with the Cambridge algorithm |
| 78 | const FjStrategy NlnNCam4pi = fastjet::NlnNCam4pi; |
| 79 | const FjStrategy NlnNCam2pi2R = fastjet::NlnNCam2pi2R; |
| 80 | const FjStrategy NlnNCam = fastjet::NlnNCam; // 2piMultD |
| 81 | |
| 82 | |
| 83 | #endif //__FJCLUSTERSEQUENCE_HH__ |
git://git.uio.no / u / mrichter / AliRoot.git / blame