BOSS 7.0.7
BESIII Offline Software System
Loading...
Searching...
No Matches
cache.cpp File Reference
#include "cache.h"
#include "integral.h"

Go to the source code of this file.

Macros

#define getSave(n)
 
#define getIN(n)
 
#define getMinorN(n)
 

Functions

 getMinorN (3) getMinorN(2) Minor5
 

Macro Definition Documentation

◆ getIN

#define getIN (   n)
Value:
ncomplex ICache::getI##n(int ep, const Kinem##n &k) \
{ \
Ival ivalue; \
bool found=false; \
for (ArrayS##n::iterator it##n=ics##n.begin(); it##n != ics##n.end(); ++it##n) { \
if (it##n->key == k) { \
ivalue=it##n->val; \
found=true; \
break; \
} \
} \
if ( ! found ) { \
ivalue=qlI##n(k); \
ics##n.insert(EntryS##n(k,ivalue)); \
} \
return ivalue.val[ep]; \
}
Definition: kinem.h:17
std::complex< double > ncomplex
Definition: common.h:25

◆ getMinorN

#define getMinorN (   n)
Value:
Minor##n::Ptr MCache::getMinor##n(const Kinem##n &k) \
{ \
Minor##n::Ptr minor; \
for (Array##n::iterator it##n=cm##n.begin(); it##n!=cm##n.end(); ++it##n) { \
if (it##n->key == k) { \
minor=it##n->val; \
break; \
} \
} \
/* if (minor==0) { \
minor=Minor##n::create(k); \
cm##n.insert(Entry##n(k,minor)); \
} \
assert(minor!=0); */ \
return minor; \
}
Definition: minor.h:195

Definition at line 622 of file cache.cpp.

◆ getSave

#define getSave (   n)
Value:
ICache::Save##n * ICache::getS##n(int ep, const Kinem##n &kin, int coefn) \
{ \
Save##n *s##n=0; \
for (Array##n::iterator it##n=ic##n[ep].begin(); it##n != ic##n[ep].end(); ++it##n) { \
if (it##n->key == kin) { \
s##n=it##n->val.get(); \
break; \
} \
} \
if (s##n == 0) { \
Save##n::Ptr sptr(new Save##n(ncomplex(sNAN.d64, 0))); \
s##n=sptr.get(); \
ic##n[ep].insert(Entry##n(kin, sptr)); \
} \
return s##n; \
} \
XmlRpcServer s
Definition: HelloServer.cpp:11

Definition at line 525 of file cache.cpp.

Function Documentation

◆ getMinorN()

getMinorN ( )

Definition at line 636 of file cache.cpp.

646{
647 Minor5::Ptr minor;
648 for (Array5::iterator it5=cm5.begin(); it5!=cm5.end(); ++it5) {
649 if (it5->key == k) {
650 minor=it5->val;
651 break;
652 }
653 }
654 if (minor==0) {
655 minor=Minor5::create(k);
656 cm5.insert(Entry5(k,minor));
static Ptr create(const Kinem5 &k)
Definition: minor.h:219
Definition: pointer.h:25