BOSS 8.0.0
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 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;
std::complex< double > ncomplex
const Int_t n

Definition at line 17 of file 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 || ( fabs( s2.real() * heps ) >= fabs( s21.real() ) && \
25 fabs( s2.imag() * heps ) >= fabs( s21.imag() ) ) ) \
26 break; \
27 dv = sump; \
28 sump = s1 + 1. / ( 1. / s21 - 1. / s10 ); \
29 } \
30 if ( fabs( sump.real() * teps ) >= fabs( sump.real() - dv.real() ) && \
31 fabs( sump.imag() * teps ) >= fabs( sump.imag() - dv.imag() ) ) \
32 break;

◆ tswap

#define tswap ( x,
y,
t )
Value:
if ( x > y ) \
{ \
t = y; \
y = x; \
x = t; \
}
int t()
Definition t.c:1

Definition at line 35 of file minor.h.

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

Referenced by Minor3::evalC().