FairRoot/PandaRoot
PndTrkMergeSort.h
Go to the documentation of this file.
1 #ifndef PndTrkMergeSort_H
2 #define PndTrkMergeSort_H 1
3 
4 // Root includes
5 #include "TROOT.h"
6 
7 
8 class PndTrkMergeSort : public TObject
9 {
10 
11 
12  public:
13 
18 
19 
20  void Merge(
21  Short_t nl,
22  Double_t *left,
23  Int_t *ind_left,
24  Short_t nr,
25  Double_t *right,
26  Int_t *ind_right,
27  Double_t *result,
28  Int_t *ind
29  );
30 
31 
32 // the only difference with Merge is that in Merge2 only Short_t
33 // are used (NO Int_t);
34 void Merge2(
35  Short_t nl,
36  Double_t *left,
37  Short_t *ind_left,
38  Short_t nr,
39  Double_t *right,
40  Short_t *ind_right,
41  Double_t *result,
42  Short_t *ind
43  );
44 
45  void Merge3(
46  Short_t nl,
47  Int_t *left,
48  Short_t *ind_left,
49  Short_t nr,
50  Int_t *right,
51  Short_t *ind_right,
52  Int_t *result,
53  Short_t *ind
54  );
55 
56 
57  void Merge_Sort(
58  Short_t n_ele,
59  Double_t *array,
60  Int_t *ind
61  );
62 
63 
64 
65 // the only difference with Merge_Sort is that *ind is a Sort_t
66 // (NO Int_t);
67  void Merge_Sort2(
68  Short_t n_ele,
69  Double_t *array,
70  Short_t *ind
71  );
72 
73 
74  void Merge_Sort3(
75  Short_t n_ele,
76  Int_t *array,// the array to be ordered;
77  Short_t *ind);
78 
79 
81 
82 };
83 
84 #endif
void Merge(Short_t nl, Double_t *left, Int_t *ind_left, Short_t nr, Double_t *right, Int_t *ind_right, Double_t *result, Int_t *ind)
void Merge_Sort3(Short_t n_ele, Int_t *array, Short_t *ind)
ClassDef(PndTrkMergeSort, 1)
void Merge3(Short_t nl, Int_t *left, Short_t *ind_left, Short_t nr, Int_t *right, Short_t *ind_right, Int_t *result, Short_t *ind)
Double_t
void Merge_Sort2(Short_t n_ele, Double_t *array, Short_t *ind)
void Merge_Sort(Short_t n_ele, Double_t *array, Int_t *ind)
void Merge2(Short_t nl, Double_t *left, Short_t *ind_left, Short_t nr, Double_t *right, Short_t *ind_right, Double_t *result, Short_t *ind)