BOSS 7.1.1
BESIII Offline Software System
Loading...
Searching...
No Matches
minor.h File Reference
#include "common.h"
#include "kinem.h"
#include "pointer.h"
#include <bitset>

Go to the source code of this file.

Classes

class  MinorBase
 
class  Minor< N >
 
class  Minor5
 
class  Minor4
 
class  Minor3
 
class  Minor2
 

Macros

#define stepWynn(n)
 
#define tswap(x, y, t)
 
#define CIDX   (DCay-2)
 

Macro Definition Documentation

◆ CIDX

#define CIDX   (DCay-2)

Definition at line 45 of file eemmg-lib-new/src/minor.h.

◆ stepWynn

#define stepWynn ( n)
Value:
sum[(2+n)%3]=sum1; \
{ \
const ncomplex s2=sum[(2+n)%3]; \
const ncomplex s1=sum[(1+n)%3]; \
const ncomplex s10=s21; \
s21=s2-s1; \
if ( s21==s10 \
|| ( fabs(s2.real()*heps)>=fabs(s21.real()) \
&& fabs(s2.imag()*heps)>=fabs(s21.imag()) ) ) \
break; \
dv=sump; \
sump=s1+1./(1./s21-1./s10); \
} \
if ( fabs(sump.real()*teps)>=fabs(sump.real()-dv.real()) \
&& fabs(sump.imag()*teps)>=fabs(sump.imag()-dv.imag()) ) \
break;
const Int_t n
std::complex< double > ncomplex

Definition at line 17 of file eemmg-lib-new/src/minor.h.

17#define stepWynn(n) \
18 sum[(2+n)%3]=sum1; \
19 { \
20 const ncomplex s2=sum[(2+n)%3]; \
21 const ncomplex s1=sum[(1+n)%3]; \
22 const ncomplex s10=s21; \
23 s21=s2-s1; \
24 if ( s21==s10 \
25 || ( fabs(s2.real()*heps)>=fabs(s21.real()) \
26 && fabs(s2.imag()*heps)>=fabs(s21.imag()) ) ) \
27 break; \
28 dv=sump; \
29 sump=s1+1./(1./s21-1./s10); \
30 } \
31 if ( fabs(sump.real()*teps)>=fabs(sump.real()-dv.real()) \
32 && fabs(sump.imag()*teps)>=fabs(sump.imag()-dv.imag()) ) \
33 break;

◆ tswap

#define tswap ( x,
y,
t )
Value:
if (x > y) { \
t=y; \
y=x; \
x=t; \
}
Double_t x[10]
TTree * t
Definition binning.cxx:23
double y[1000]

Definition at line 36 of file eemmg-lib-new/src/minor.h.

36#define tswap(x,y,t) \
37 if (x > y) { \
38 t=y; \
39 y=x; \
40 x=t; \
41 }