void testCompare()
{
// Date1 = Date2
vmime::datetime d1(2005, 4, 22, 14, 6, 0, vmime::datetime::GMT2);
vmime::datetime d2(2005, 4, 22, 10, 6, 0, vmime::datetime::GMT_2);
VASSERT_EQ("1.1", true, d1 == d2);
VASSERT_EQ("1.2", false, d1 != d2);
VASSERT_EQ("1.3", true, d1 <= d2);
VASSERT_EQ("1.4", false, d1 < d2);
VASSERT_EQ("1.5", true, d1 >= d2);
VASSERT_EQ("1.6", false, d1 > d2);
// Date1 < Date2
vmime::datetime d3(2005, 4, 22, 14, 6, 0);
vmime::datetime d4(2005, 4, 22, 15, 6, 0);
VASSERT_EQ("2.1", false, d3 == d4);
VASSERT_EQ("2.2", true, d3 != d4);
VASSERT_EQ("2.3", true, d3 <= d4);
VASSERT_EQ("2.4", true, d3 < d4);
VASSERT_EQ("2.5", false, d3 >= d4);
VASSERT_EQ("2.6", false, d3 > d4);
// Date1 > Date2
vmime::datetime d5(2005, 4, 22, 15, 6, 0);
vmime::datetime d6(2005, 4, 22, 14, 6, 0);
VASSERT_EQ("3.1", false, d5 == d6);
VASSERT_EQ("3.2", true, d5 != d6);
VASSERT_EQ("3.3", false, d5 <= d6);
VASSERT_EQ("3.4", false, d5 < d6);
VASSERT_EQ("3.5", true, d5 >= d6);
VASSERT_EQ("3.6", true, d5 > d6);
}
void initB() {
this->clearAppend(this->m_csB);
R1Variable<T> d1(1), d2(2), d3(3), d4(4), d5(5), d6(6);
this->m_csB.addConstraint(d1 * d2 == d5);
this->m_csB.addConstraint(d1 * d3 == d6);
this->m_csB.addConstraint(d5 * d6 == d4);
this->m_csB.swap_AB_if_beneficial();
// witness always consistent
this->m_witnessB.assignVar(d1, T(m_d1));
this->m_witnessB.assignVar(d2, T(m_d2));
this->m_witnessB.assignVar(d3, T(m_d3));
this->m_witnessB.assignVar(d4, T(m_d1 * m_d1 * m_d2 * m_d3));
this->m_witnessB.assignVar(d5, T(m_d1 * m_d2));
this->m_witnessB.assignVar(d6, T(m_d1 * m_d3));
// public inputs may be inconsistent
this->m_inputB.assignVar(d1, T(m_d1));
this->m_inputB.assignVar(d2, T(m_d2));
this->m_inputB.assignVar(d3, T(m_d3));
this->m_inputB.assignVar(d4, T(m_d4));
this->finalize(this->m_csB);
}
int main(void)
{
static const struct st3 a = {1, 2, 3, 4, 5, 6};
l1(100);
l2(100, 200);
l3(100, 200, 300);
l4(100, 200, 300, 400);
l5(100, 200, 300, 400, 500);
l6(100, 200, 300, 400, 500, 600);
l7(100, 200, 300, 400, 500, 600, 700);
l8(100, 200, 300, 400, 500, 600, 700, 800);
d1();
d2(43);
d3(100, 200);
d4(a);
d5('a', 43, a);
d6('a', 1);
c1(44);
c2(100, 'a', 3.4);
c3(200, 2.777, 'q');
c4(200, 1);
c5(1.1, 2.2);
c6(1.23, 45.6);
c7('z', 0x200);
a1('a');
a2(10);
a3(20);
a4(102030405060LL);
b1('a', 20);
b2(30, 'b');
b3(10, 20, 30, 40, 50, 60);
s1(sx);
s1p(&sx);
s2(sy);
s3(sz);
s4(sq);
s5(sa);
s6(sb);
r1();
r3();
r4();
q1(200, sx);
q2(300, 't', sx);
q3(400, 410, sy);
q4(500, 510, sq);
q5(600, 610, 'z', 'q', sq);
real1("fresh air");
real2();
return 0;
}
int main() {
LinearGenerator linearGen(0,20,2);
RandomGenerator randomGen(10);
FibonacciGenerator fibGen(10);
// MOCK 1
std::vector<double> myVector;
myVector.push_back(15);
myVector.push_back(20);
myVector.push_back(35);
myVector.push_back(40);
myVector.push_back(50);
MockGenerator mockGen(myVector);
// MOCK 2
std::vector<double> myVector2;
myVector2.push_back(1);
myVector2.push_back(10);
myVector2.push_back(50);
MockGenerator mockGen2(myVector2);
LinearInterpolationCalculator linInterCalc;
NearestRankCalculator nearestRankCalc;
DistributionTester mock0(&mockGen, &nearestRankCalc);
DistributionTester mock1(&mockGen, &linInterCalc);
DistributionTester mock2(&mockGen2, &linInterCalc);
DistributionTester d1(&linearGen, &linInterCalc);
DistributionTester d2(&linearGen, &nearestRankCalc);
DistributionTester d3(&randomGen, &linInterCalc);
DistributionTester d4(&randomGen, &nearestRankCalc);
DistributionTester d5(&fibGen, &linInterCalc);
DistributionTester d6(&fibGen, &nearestRankCalc);
std::cout << "d1: " << d1.getPercentile(50) << std::endl;
std::cout << "d2: " << d2.getPercentile(50) << std::endl;
std::cout << "mock0: " << mock0.getPercentile(30) << std::endl;
std::cout << "mock0: " << mock0.getPercentile(40) << std::endl;
std::cout << "mock0: " << mock0.getPercentile(50) << std::endl;
std::cout << "mock0: " << mock0.getPercentile(100) << std::endl;
std::cout << "mock1: " << mock1.getPercentile(10) << std::endl;
std::cout << "mock1: " << mock1.getPercentile(30) << std::endl;
std::cout << "mock1: " << mock1.getPercentile(40) << std::endl;
std::cout << "mock1: " << mock1.getPercentile(90) << std::endl;
std::cout << "mock2: " << mock2.getPercentile(10) << std::endl;
std::cout << "mock2: " << mock2.getPercentile(20) << std::endl;
std::cout << "mock2: " << mock2.getPercentile(30) << std::endl;
std::cout << "mock2: " << mock2.getPercentile(40) << std::endl;
std::cout << "mock2: " << mock2.getPercentile(50) << std::endl;
std::cout << "mock2: " << mock2.getPercentile(60) << std::endl;
std::cout << "mock2: " << mock2.getPercentile(70) << std::endl;
std::cout << "mock2: " << mock2.getPercentile(80) << std::endl;
std::cout << "mock2: " << mock2.getPercentile(90) << std::endl;
}
unsigned int DiceBox::d6(const unsigned short int n)
{
unsigned int result = 0;
unsigned int i;
for (i=0; i<n; i=i+1)
{
result += d6();
}
return result;
}
TEST(Decimal128Test, TestDecimal128IsNegative) {
Decimal128 d1("NaN");
Decimal128 d2("-NaN");
Decimal128 d3("10.5");
Decimal128 d4("-10.5");
Decimal128 d5("Inf");
Decimal128 d6("-Inf");
ASSERT_FALSE(d1.isNegative());
ASSERT_FALSE(d3.isNegative());
ASSERT_FALSE(d5.isNegative());
ASSERT_TRUE(d2.isNegative());
ASSERT_TRUE(d4.isNegative());
ASSERT_TRUE(d6.isNegative());
}
static void test1() {
WCValSList<String> list;
WCValSList<String> list2;
String d1("svstr#1");
String d2("svstr#2");
String d3("svstr#3");
String d4("svstr#4");
String d5("srover:1#1");
String d6("srover:1#2");
list.append( d1 );
list.append( d2 );
list.append( d3 );
list.append( d4 );
list2.append( d3 );
list2.append( d2 );
list2.append( d1 );
WCValSListIter<String> liter(list);
String data;
for(;;) {
if( !liter() ) break;
data = liter.current();
cout << "[" << data << "]\n";
};
cout << "\ndo a reset\n\n";
liter.reset();
if( liter() ) {
cout << "[" << liter.current() << "]\n";
}
if( liter() ) {
cout << "[" << liter.current() << "]\n";
}
cout << "\ndo a reset to list 2\n\n";
liter.reset( list2 );
for(;;) {
if( !liter() ) break;
data = liter.current();
cout << "[" << data << "]\n";
};
cout << "\n";
cout.flush();
}
void analyze(Int_t step){
// TOF propagation factors (TOF efficiencies)
fEfficiencyPiTOF = new TF1("fEfficiencyPiTOF","(x > 0.3)*0.7",0,10);
fEfficiencyKaTOF = new TF1("fEfficiencyKaTOF","(x > 0.3)*(x-0.3)*(x<1) + (x>1)*0.7",0,10);
fEfficiencyPrTOF = new TF1("fEfficiencyPrTOF","(x > 0.3)*(x-0.3)*(x<1) + (x>1)*0.7",0,10);
// teoretical separation (perfect if equal to the one simualted in sim.C)
fseparation = new TF1("f","[0]+[1]/x",0,100);
fseparation->SetParameter(0,0.);
fseparation->SetParameter(1,7.);
fseparationPiKa = new TF1("fPiKa","[0]+[1]/TMath::Power(x,2.5)",0,100);
fseparationPiKa->SetParameter(0,2.34);
fseparationPiKa->SetParameter(1,10);
fseparationKaPr = new TF1("fKaPr","[0]+[1]/TMath::Power(x,2.5)",0,100);
fseparationKaPr->SetParameter(0,1);
fseparationKaPr->SetParameter(1,56);
// x=p, y=pt/p (normalized at the number of sigma assuming 80 ps resolution)
fTOFpi = new TF2("fTOFpi","3.7/y*(sqrt(x*x+0.0193210)/x-1)*37.47405725",0.3,10,0.5,1);
fTOFka = new TF2("fTOFka","3.7/y*(sqrt(x*x+0.243049)/x-1)*37.47405725",0.3,10,0.5,1);
fTOFpr = new TF2("fTOFpr","3.7/y*(sqrt(x*x+0.879844)/x-1)*37.47405725",0.3,10,0.5,1);
// x=p, already normalized in number of sigma (sigma assumed 3.5=7% of the MIP)
fTPCpi = new TF1("fTPCpi",BetheBlochAleph,0,10,6);
fTPCpi->SetParameter(0,fKp1);
fTPCpi->SetParameter(1,fKp2);
fTPCpi->SetParameter(2,fKp3);
fTPCpi->SetParameter(3,fKp4);
fTPCpi->SetParameter(4,fKp5);
fTPCpi->SetParameter(5,0.139);
fTPCka = new TF1("fTPCka",BetheBlochAleph,0,10,6);
fTPCka->SetParameter(0,fKp1);
fTPCka->SetParameter(1,fKp2);
fTPCka->SetParameter(2,fKp3);
fTPCka->SetParameter(3,fKp4);
fTPCka->SetParameter(4,fKp5);
fTPCka->SetParameter(5,0.493);
fTPCpr = new TF1("fTPCpr",BetheBlochAleph,0,10,6);
fTPCpr->SetParameter(0,fKp1);
fTPCpr->SetParameter(1,fKp2);
fTPCpr->SetParameter(2,fKp3);
fTPCpr->SetParameter(3,fKp4);
fTPCpr->SetParameter(4,fKp5);
fTPCpr->SetParameter(5,0.938);
Float_t width = 1.0;
addshift =0;
invwidth = 1./width;
Float_t widthTOF = 1.0;
addshiftTOF =0;
invwidthTOF = 1./widthTOF;
TH1D *priorsPt[6];
TH1D *newpriorsPt[6];
TH1D *truePt[6];
TH1D *allPtPos = new TH1D("allPtP","All positive;p_{T} (GeV/#it{c});N",100,0,10);
TH1D *allPtNeg = new TH1D("allPtN","All negative;p_{T} (GeV/#it{c});N",100,0,10);
TH3D *priorsKs[3][3];
TH3D *newpriorsKs[3][3];
TH3D *truePidKs[3][3];
TH3D *trueKs;
TH2D *priorsPhi[3][3];
TH2D *newpriorsPhi[3][3];
TH2D *truePidPhi[3][3];
TH2D *truePhi;
TH3D *priorsLc[3][3][3];
TH3D *newpriorsLc[3][3][3];
TH3D *truePidLc[3][3][3];
TH3D *trueLc,*mypidLc;
TH3D *priorsLcbar[3][3][3];
TH3D *newpriorsLcbar[3][3][3];
TH3D *truePidLcbar[3][3][3];
TH3D *trueLcbar,*mypidLcbar;
Int_t nbinPtFrKa = 8;
Int_t nbinPtFrPi = 8;
Int_t nbinY = 1;
Int_t nbinpol=nbinPtFrKa*nbinPtFrPi*nbinY;
Double_t normbin = 1./nbinpol;
Int_t nbinmlc = 100;
Int_t nbinptlc = 10;
const char *spec[3] = {"Pi","Ka","Pr"};
if(step==0){
priorsPt[0] = new TH1D("oldpriorsPtPiP","Pion (+) priors;p_{T} (GeV/#it{c});N",100,0,10);
for(Int_t i=1;i<=100;i++)
priorsPt[0]->SetBinContent(i,1);
priorsPt[1] = new TH1D("oldpriorsPtKaP","Kaon (+) priors;p_{T} (GeV/#it{c});N",100,0,10);
priorsPt[2] = new TH1D("oldpriorsPtPrP","Proton (+) priors;p_{T} (GeV/#it{c});N",100,0,10);
priorsPt[3] = new TH1D("oldpriorsPtPiM","Pion (-) priors;p_{T} (GeV/#it{c});N",100,0,10);
priorsPt[4] = new TH1D("oldpriorsPtKaM","Kaon (-) priors;p_{T} (GeV/#it{c});N",100,0,10);
priorsPt[5] = new TH1D("oldpriorsPtPrM","Proton (-) priors;p_{T} (GeV/#it{c});N",100,0,10);
priorsPt[1]->Add(priorsPt[0]);
priorsPt[2]->Add(priorsPt[0]);
priorsPt[3]->Add(priorsPt[0]);
priorsPt[4]->Add(priorsPt[0]);
priorsPt[5]->Add(priorsPt[0]);
// Ks and phi priors
for(Int_t i=0; i< 3;i++){
for(Int_t j=0; j< 3;j++){
priorsKs[i][j] = new TH3D(Form("oldpriorsKs%s%s",spec[i],spec[j]),Form("K^{0*} priors for %s-%s;m_{#piK} (GeV/#it{c}^2);p_{T} (GeV/#it{c});N",spec[i],spec[j]),200,0.4,1.4,40,0,10,nbinpol,-1.001,1.001);
priorsPhi[i][j] = new TH2D(Form("oldpriorsPhi%s%s",spec[i],spec[j]),Form("#phi priors for %s-%s;m_{KK} (GeV/#it{c}^2);p_{T} (GeV/#it{c});N",spec[i],spec[j]),100,0.98,1.05,40,0,10);
if(i==0 && j==0){
for(Int_t ibx=1;ibx<=200;ibx++)
for(Int_t iby=1;iby<=40;iby++){
for(Int_t ibz=1;ibz <= nbinpol;ibz++)
priorsKs[i][j]->SetBinContent(ibx,iby,ibz,1);
priorsPhi[i][j]->SetBinContent(ibx,iby,1);
}
}
else{
priorsKs[i][j]->Add(priorsKs[0][0]);
priorsPhi[i][j]->Add(priorsPhi[0][0]);
}
for(Int_t k=0; k< 3;k++){
priorsLc[i][j][k] = new TH3D(Form("oldpriorsLc%s%s%s",spec[i],spec[j],spec[k]),Form("#Lambda_{c}^{+} priors for %s-%s-%s;m_{#piKp} (GeV/#it{c}^2);p_{T} (GeV/#it{c});N",spec[i],spec[j],spec[k]),nbinmlc,2.1,2.5,nbinptlc,7,27,nbinpol,0,1.);
priorsLcbar[i][j][k] = new TH3D(Form("oldpriorsLcbar%s%s%s",spec[i],spec[j],spec[k]),Form("#overline{#Lambda}_{c}^{-} priors for %s-%s-%s;m_{#piKp} (GeV/#it{c}^2);p_{T} (GeV/#it{c});N",spec[i],spec[j],spec[k]),nbinmlc,2.1,2.5,nbinptlc,7,27,nbinpol,0,1.);
if(i==0 && j==0 && k==0){
for(Int_t ibx=1;ibx<=nbinmlc;ibx++)
for(Int_t iby=1;iby<=nbinptlc;iby++){
for(Int_t ibz=1;ibz <= nbinpol;ibz++){
priorsLc[i][j][k]->SetBinContent(ibx,iby,ibz,1);
priorsLcbar[i][j][k]->SetBinContent(ibx,iby,ibz,1);
}
}
}
else{
priorsLc[i][j][k]->Add(priorsLc[0][0][0]);
priorsLcbar[i][j][k]->Add(priorsLc[0][0][0]);
}
}
}
}
}
else{
TFile *fin = new TFile(Form("step%i.root",step));
priorsPt[0] = (TH1D *) fin->Get("priorsPtPiP");
priorsPt[0]->SetName("oldpriorsPtPiP");
priorsPt[1] = (TH1D *) fin->Get("priorsPtKaP");
priorsPt[1]->SetName("oldpriorsPtPiP");
priorsPt[2] = (TH1D *) fin->Get("priorsPtPrP");
priorsPt[2]->SetName("oldpriorsPtPiP");
priorsPt[3] = (TH1D *) fin->Get("priorsPtPiM");
priorsPt[3]->SetName("oldpriorsPtPiM");
priorsPt[4] = (TH1D *) fin->Get("priorsPtKaM");
priorsPt[4]->SetName("oldpriorsPtKaM");
priorsPt[5] = (TH1D *) fin->Get("priorsPtPrM");
priorsPt[5]->SetName("oldpriorsPtPrM");
// Ks and phi priors
for(Int_t i=0; i< 3;i++){
for(Int_t j=0; j< 3;j++){
priorsKs[i][j] = (TH3D *) fin->Get(Form("priorsKs%s%s",spec[i],spec[j]));
priorsKs[i][j]->SetName(Form("oldpriorsKs%s%s",spec[i],spec[j]));
priorsPhi[i][j] = (TH2D *) fin->Get(Form("priorsPhi%s%s",spec[i],spec[j]));
priorsPhi[i][j]->SetName(Form("oldpriorsPhi%s%s",spec[i],spec[j]));
for(Int_t k=0; k< 3;k++){
priorsLc[i][j][k] = (TH3D *) fin->Get(Form("priorsLc%s%s%s",spec[i],spec[j],spec[k]));
priorsLc[i][j][k]->SetName(Form("oldpriorsLc%s%s%s",spec[i],spec[j],spec[k]));
priorsLcbar[i][j][k] = (TH3D *) fin->Get(Form("priorsLcbar%s%s%s",spec[i],spec[j],spec[k]));
priorsLcbar[i][j][k]->SetName(Form("oldpriorsLcbar%s%s%s",spec[i],spec[j],spec[k]));
}
}
}
}
newpriorsPt[0] = new TH1D("priorsPtPiP","Pion (+) priors;p_{T} (GeV/#it{c});N",100,0,10);
newpriorsPt[1] = new TH1D("priorsPtKaP","Kaon (+) priors;p_{T} (GeV/#it{c});N",100,0,10);
newpriorsPt[2] = new TH1D("priorsPtPrP","Proton (+) priors;p_{T} (GeV/#it{c});N",100,0,10);
newpriorsPt[3] = new TH1D("priorsPtPiM","Pion (-) priors;p_{T} (GeV/#it{c});N",100,0,10);
newpriorsPt[4] = new TH1D("priorsPtKaM","Kaon (-) priors;p_{T} (GeV/#it{c});N",100,0,10);
newpriorsPt[5] = new TH1D("priorsPtPrM","Proton (-) priors;p_{T} (GeV/#it{c});N",100,0,10);
// Ks and phi priors distributions
for(Int_t i=0; i< 3;i++){
for(Int_t j=0; j< 3;j++){
newpriorsKs[i][j] = new TH3D(Form("priorsKs%s%s",spec[i],spec[j]),Form("K^{0*} priors for %s-%s;m_{#piK} (GeV/#it{c}^2);p_{T} (GeV/#it{c});N",spec[i],spec[j]),200,0.4,1.4,40,0,10,nbinpol,-1.001,1.001);
newpriorsPhi[i][j] = new TH2D(Form("priorsPhi%s%s",spec[i],spec[j]),Form("#phi priors for %s-%s;m_{KK} (GeV/#it{c}^2);p_{T} (GeV/#it{c});N",spec[i],spec[j]),100,0.98,1.05,40,0,10);
for(Int_t k=0; k< 3;k++){
newpriorsLc[i][j][k] = new TH3D(Form("priorsLc%s%s%s",spec[i],spec[j],spec[k]),Form("#Lambda_{c}^{+} priors for %s-%s-%s;m_{#piKp} (GeV/#it{c}^2);p_{T} (GeV/#it{c});N",spec[i],spec[j],spec[k]),nbinmlc,2.1,2.5,nbinptlc,7,27,nbinpol,0,1.);
newpriorsLcbar[i][j][k] = new TH3D(Form("priorsLcbar%s%s%s",spec[i],spec[j],spec[k]),Form("#overline{#Lambda}_{c}^{-} priors for %s-%s-%s;m_{#piKp} (GeV/#it{c}^2);p_{T} (GeV/#it{c});N",spec[i],spec[j],spec[k]),nbinmlc,2.1,2.5,nbinptlc,7,27,nbinpol,0,1.);
}
}
}
truePt[0] = new TH1D("truePtPiP","Pion (+) truth;p_{T} (GeV/#it{c});N",100,0,10);
truePt[1] = new TH1D("truePtKaP","Kaon (+) truth;p_{T} (GeV/#it{c});N",100,0,10);
truePt[2] = new TH1D("truePtPrP","Proton (+) truth;p_{T} (GeV/#it{c});N",100,0,10);
truePt[3] = new TH1D("truePtPiM","Pion (-) truth;p_{T} (GeV/#it{c});N",100,0,10);
truePt[4] = new TH1D("truePtKaM","Kaon (-) truth;p_{T} (GeV/#it{c});N",100,0,10);
truePt[5] = new TH1D("truePtPrM","Proton (-) truth;p_{T} (GeV/#it{c});N",100,0,10);
// Ks and phi truePid distributions
for(Int_t i=0; i< 3;i++){
for(Int_t j=0; j< 3;j++){
truePidKs[i][j] = new TH3D(Form("truePidKs%s%s",spec[i],spec[j]),Form("K^{0*} truePid for %s-%s;m_{#piK} (GeV/#it{c}^2);p_{T} (GeV/#it{c});N",spec[i],spec[j]),200,0.4,1.4,40,0,10,nbinpol,-1.001,1.001);
truePidPhi[i][j] = new TH2D(Form("truePidPhi%s%s",spec[i],spec[j]),Form("#phi truePid for %s-%s;m_{KK} (GeV/#it{c}^2);p_{T} (GeV/#it{c});N",spec[i],spec[j]),100,0.98,1.05,40,0,10);
for(Int_t k=0; k< 3;k++){
truePidLc[i][j][k] = new TH3D(Form("truePidLc%s%s%s",spec[i],spec[j],spec[k]),Form("#Lambda_{c}^{+} truePid for %s-%s-%s;m_{#piKp} (GeV/#it{c}^2);p_{T} (GeV/#it{c});N",spec[i],spec[j],spec[k]),nbinmlc,2.1,2.5,nbinptlc,7,27,nbinpol,0,1.);
truePidLcbar[i][j][k] = new TH3D(Form("truePidLcbar%s%s%s",spec[i],spec[j],spec[k]),Form("#overline{#Lambda}_{c}^{-} truePid for %s-%s-%s;m_{#piKp} (GeV/#it{c}^2);p_{T} (GeV/#it{c});N",spec[i],spec[j],spec[k]),nbinmlc,2.1,2.5,nbinptlc,7,27,nbinpol,0,1.);
}
}
}
trueKs = new TH3D(Form("trueKs"),Form("K^{0*} true;m_{#piK} (GeV/#it{c}^2);p_{T} (GeV/#it{c});N"),200,0.4,1.4,40,0,10,nbinpol,-1.001,1.001);
truePhi = new TH2D(Form("truePhi"),Form("#phi true;m_{KK} (GeV/#it{c}^2);p_{T} (GeV/#it{c});N"),100,0.98,1.05,40,0,10);
trueLc = new TH3D(Form("trueLc"),Form("#Lambda_{c}^{+} true;m_{#piKp} (GeV/#it{c}^2);p_{T} (GeV/#it{c});N"),nbinmlc,2.1,2.5,nbinptlc,7,27,nbinpol,0,1.);
trueLcbar = new TH3D(Form("trueLcbar"),Form("#overline{#Lambda}_{c}^{-} true;m_{#piKp} (GeV/#it{c}^2);p_{T} (GeV/#it{c});N"),nbinmlc,2.1,2.5,nbinptlc,7,27,nbinpol,0,1);
mypidLc = new TH3D(Form("mypidLc"),Form("#Lambda_{c}^{+} true;m_{#piKp} (GeV/#it{c}^2);p_{T} (GeV/#it{c});N"),nbinmlc,2.1,2.5,nbinptlc,7,27,nbinpol,0,1.);
mypidLcbar = new TH3D(Form("mypidLcbar"),Form("#Lambda_{c}^{+} true;m_{#piKp} (GeV/#it{c}^2);p_{T} (GeV/#it{c});N"),nbinmlc,2.1,2.5,nbinptlc,7,27,nbinpol,0,1.);
// define particle types (particle type array)
particle::AddParticleType("pi+",0.139,1); // 0
particle::AddParticleType("pi-",0.139,-1); // 1
particle::AddParticleType("K+",0.493,1); // 2
particle::AddParticleType("K-",0.493,-1); // 3
particle::AddParticleType("p+",0.938,1); // 4
particle::AddParticleType("p-",0.938,-1); // 5
particle::AddParticleType("K0*",0.896,0,5.05e-02); // 6
particle::AddParticleType("K0bar*",0.896,0,5.05e-02); // 7
particle::AddParticleType("Phi",1.02,0,0.00426); // 8
particle::AddParticleType("Delta++",1.232,2,0.118); // 9
particle::AddParticleType("Delta--",1.232,-2,0.118); // 10
particle::AddParticleType("Lambdac+",2.28646,1,0.008); // 11
particle::AddParticleType("Lambdacbar-",2.28646,-1,0.008); // 12
particle::AddParticleType("Lambda1520",1.5195,-1,0.0000156); // 12
particle d1("pi+");
particle d2("K+");
particle d3("p+");
particle d4("pi-");
particle d5("K-");
particle d6("p-");
particle prong1;
particle prong2;
particle prong3;
particle polarKs("K0*");
particle polarLc("Lambdac+");
Int_t charge[] = {1,-1,1,-1,1,-1,0,0,0,2,-2,1,-1};
particle ppos[20000];
particle pneg[20000];
Float_t weightsPos[20000][3];
Float_t weightsNeg[20000][3];
Int_t passMyPIDPos[20000][3];
Int_t passMyPIDNeg[20000][3];
Int_t npos=0;
Int_t nneg=0;
Float_t signal,signalTOF,signalTPC,pt,pz,phi,ptComb,ptComb3prong,invmass;
Float_t ptd,pzd,phid;
Float_t priors[3],prob[3];
Float_t priors2[3][3],prob2[3][3];
Float_t priors3[3][3][3],prob3[3][3][3];
Int_t iev=-1,id,mother;
Int_t cev;
TFile *fout = new TFile(Form("step%i.root",step+1),"RECREATE");
// TTree *treeKs = new TTree("treeKs","treeKs");
// Float_t ptPair,massPair,ptD1,ptD2,weightD1[3],weightD2[3],weightFill;
// Int_t isTrue,isTruePid;
// treeKs->Branch("ptPair",&ptPair,"ptPair/F");
// treeKs->Branch("massPair",&massPair,"massPair/F");
// treeKs->Branch("ptPi",&ptD1,"ptPi/F");
// treeKs->Branch("ptKa",&ptD2,"ptKa/F");
// treeKs->Branch("weightPi",weightD1,"wightPi[3]/F");
// treeKs->Branch("weightKa",weightD2,"wightKa[3]/F");
// treeKs->Branch("weightFill",&weightFill,"wightFill/F");
// treeKs->Branch("isTruePid",&isTruePid,"isTruePid/I");
// treeKs->Branch("isTrue",&isTrue,"isTrue/I");
TH1F *hcentr = new TH1F("hcentr","",100,0,100);
FILE *flist = fopen("lista","r");
char namefile[100];
Float_t weight1[3],weight2[3],weight3[3];
Float_t ptPi,ptKa,ptPr;
TH1F *htemp;
while(fscanf(flist,"%s",namefile)==1){
TFile *fin = new TFile(namefile);
printf("file = %s\n",namefile);
TList *l = (TList *) fin->Get("TOFpid");
htemp = (TH1F *) l->At(0);
if(!hcentr) hcentr = new TH1F(*htemp);
else hcentr->Add(htemp);
TTree *t = (TTree *) l->At(1);
Int_t n = t->GetEntries();
for(Int_t i=0;i < n;i++){
t->GetEvent(i);
ptPi = t->GetLeaf("ptPi")->GetValue();
ptKa = t->GetLeaf("ptPi")->GetValue();
ptPr = t->GetLeaf("ptPi")->GetValue();
pt = t->GetLeaf("pt")->GetValue();
invmass = t->GetLeaf("mass")->GetValue();
weight1[0] = t->GetLeaf("weightPi")->GetValue(0);
weight1[1] = t->GetLeaf("weightPi")->GetValue(1);
weight1[2] = t->GetLeaf("weightPi")->GetValue(2);
weight2[0] = t->GetLeaf("weightKa")->GetValue(0);
weight2[1] = t->GetLeaf("weightKa")->GetValue(1);
weight2[2] = t->GetLeaf("weightKa")->GetValue(2);
weight3[0] = t->GetLeaf("weightPr")->GetValue(0);
weight3[1] = t->GetLeaf("weightPr")->GetValue(1);
weight3[2] = t->GetLeaf("weightPr")->GetValue(2);
Float_t pt1 = Int_t(ptPi/(ptPi+ptKa+ptPr)*nbinPtFrPi);
Float_t pt2 = Int_t(ptKa/(ptPi+ptKa+ptPr)*nbinPtFrKa);
Float_t polar = 0;//TMath::Abs(polarLc.GetY());//ptComb3prong/ptot;//(pt2*nbinpol + pt1)*invpollc;
polar = ((pt1*nbinPtFrKa + pt2 + polar)*nbinY)*normbin;
Int_t ibinx = priorsLc[0][0][0]->GetXaxis()->FindBin(invmass);
Int_t ibiny = priorsLc[0][0][0]->GetYaxis()->FindBin(pt);
Int_t ibinz = priorsLc[0][0][0]->GetZaxis()->FindBin(polar);
for(Int_t ipr=0;ipr<3;ipr++)
for(Int_t jpr=0;jpr<3;jpr++)
for(Int_t kpr=0;kpr<3;kpr++)
priors3[ipr][jpr][kpr] = priorsLc[ipr][jpr][kpr]->GetBinContent(ibinx,ibiny,ibinz);
GetProb3(weight1,weight2,weight3,priors3,prob3);
for(Int_t ipr=0;ipr<3;ipr++)
for(Int_t jpr=0;jpr<3;jpr++)
for(Int_t kpr=0;kpr<3;kpr++){
newpriorsLc[ipr][jpr][kpr]->Fill(invmass,pt,polar,prob3[ipr][jpr][kpr]);
}
}
t->Delete();
fin->Close();
}
printf("Write output\n");
fout->cd();
hcentr->Write();
//if(step==0) treeKs->Write();
for(Int_t i=0;i<6;i++){
newpriorsPt[i]->Write();
truePt[i]->Write();
}
for(Int_t i=0;i<3;i++){
for(Int_t j=0;j<3;j++){
priorsPhi[i][j]->Write();
newpriorsKs[i][j]->Write();
newpriorsPhi[i][j]->Write();
truePidKs[i][j]->Write();
truePidPhi[i][j]->Write();
for(Int_t k=0;k<3;k++){
newpriorsLc[i][j][k]->Write();
truePidLc[i][j][k]->Write();
newpriorsLcbar[i][j][k]->Write();
truePidLcbar[i][j][k]->Write();
}
}
}
trueKs->Write();
truePhi->Write();
trueLc->Write();
trueLcbar->Write();
mypidLc->Write();
mypidLcbar->Write();
fout->Close();
}
void dpps::Pattern_random::generate () {
// We have do declare them all. We cannot do a switch of if,
// because distributions would get out of scope.
// The only other possibility would be to place the switch inside
// the loop, but it would be very inefficient to call the constructor
// everytime.
// So we have to pay for overhead and initialize them all in te beginning.
// It's probably a negligible amount of time and memory as compared to the
// loop.
// signification of parametres depends on the engine. Some engines
// need only one parametre.
// For all user-changeable values (p1 and p2), 1.0 would have been the
// default if we had not specified it, so it is an acceptable value for the
// user as well.
const double p1 {pattern_settings. p1} ;
const double p2 {pattern_settings. p2} ;
std::uniform_real_distribution<double> d0 (-p1, p1) ; // min, max
// Normal-type
std::normal_distribution<double> d1 (0.0, p1) ; // average = 0, sigma
std::lognormal_distribution<double> d2 (0.0, p1) ; // average = 0, m
std::chi_squared_distribution<double> d3 (p1) ; // n
std::cauchy_distribution<double> d4 (p1, p2) ; // a, b
std::fisher_f_distribution<double> d5 (p1, p2) ; // m, n
std::student_t_distribution<double> d6 (p1) ; // n
// Poisson-type
std::exponential_distribution<double> d7 (p1) ; // lambda
std::gamma_distribution<double> d8 (p1, p2) ; // alpha, beta
std::weibull_distribution<double> d9 (p1, p2) ; // a, b
Polyline p ;
p. closed = true ;
double x {0.0}, y {0.0} ;
long_unsigned_int i {0}, attempts {0} ;
//const double s {pattern_settings. side / 2.0} ;
if (pattern_settings. max_attempts < pattern_settings. number)
pattern_settings. max_attempts =
std::numeric_limits<long_unsigned_int>::max () ;
//std::cout << "hello" << i << " " << pattern_settings. number << " " << attempts << " " << pattern_settings. max_attempts << std::endl ;
while ((i < pattern_settings. number) &&
(attempts < pattern_settings. max_attempts)) {
bool overlap = false ;
switch (pattern_settings. type) {
case type_uniform_real_distribution: // 0
x = d0 (pseudorandom_generator) ;
y = d0 (pseudorandom_generator) ;
//std::cout << "alea 0 : " << x << " " << y << std::endl ;
break ;
case type_normal_distribution: // 1
x = d1 (pseudorandom_generator) ;
y = d1 (pseudorandom_generator) ;
break ;
case type_lognormal_distribution: // 2
x = d2 (pseudorandom_generator) ;
y = d2 (pseudorandom_generator) ;
break ;
case type_chi_squared_distribution: // 3
x = d3 (pseudorandom_generator) ;
y = d3 (pseudorandom_generator) ;
break ;
case type_cauchy_distribution: // 4
x = d4 (pseudorandom_generator) ;
y = d4 (pseudorandom_generator) ;
break ;
case type_fisher_f_distribution: // 5
x = d5 (pseudorandom_generator) ;
y = d5 (pseudorandom_generator) ;
break ;
case type_student_t_distribution: // 6
x = d6 (pseudorandom_generator) ;
y = d6 (pseudorandom_generator) ;
break ;
case type_exponential_distribution: // 7
x = d7 (pseudorandom_generator) ;
y = d7 (pseudorandom_generator) ;
break ;
case type_gamma_distribution: // 8
x = d8 (pseudorandom_generator) ;
y = d8 (pseudorandom_generator) ;
break ;
case type_weibull_distribution: // 9
x = d9 (pseudorandom_generator) ;
y = d9 (pseudorandom_generator) ;
break ;
default:
break ;
}
if (pattern_settings. avoid_overlap) {
for (long_unsigned_int j = 0 ; j < polylines. size () ; j++) {
if ((polylines[j]. vertices[0] - Vertex(x, y)).norm2_square() <
pattern_settings. diametre*pattern_settings. diametre) {
overlap = true ;
break ;
}
}
}
bool within_limits =
(((fabs (x - pattern_settings. x0) < pattern_settings. lx / 2.0) ||
(pattern_settings. lx <= 0)) &&
((fabs (y - pattern_settings. y0) < pattern_settings. ly / 2.0) ||
(pattern_settings. ly <= 0))) ;
// Either we are inside lx, or user set it to negative to disable it.
if (within_limits && !overlap) {
p. push_back (Vertex (x, y)) ;
p. dose = pattern_settings. diametre ;
polylines. push_back (p) ;
p. vertices. clear () ; // does not change that p. closed == true ;
i++ ;
}
attempts++ ;
}
}
main(int argc, char* argv)
{
config();
bool do_socks = false;
if( argc > 1 ) {
do_socks = true;
}
dprintf( dflag, "\nExternal interface (local daemon)\n\n" );
testAPI( NULL, do_socks );
dprintf( dflag, "\nExternal interface (bad hostname)\n\n" );
testAPI( "bazzle", do_socks );
dprintf( dflag, "\nLocal daemons\n\n" );
makeAndDisplayCM( NULL, NULL );
makeAndDisplayRegular( NULL, NULL );
dprintf( dflag, "\nRemote daemons we should find\n\n" );
makeAndDisplayCM( "condor", "condor" );
makeAndDisplayRegular( "puck.cs.wisc.edu", "condor" );
dprintf( dflag, "\nWe should find the startd, but not the others\n\n" );
makeAndDisplayRegular( "*****@*****.**", NULL );
dprintf( dflag, "\nUsing a bogus sinful string\n\n" );
Daemon d( DT_NEGOTIATOR, "<128.105.232.240:23232>" );
if( d.locate() ) {
dprintf( dflag, "Found %s\n", d.idStr() );
d.display( dflag );
} else {
dprintf( dflag, "%s\n", d.error() );
}
dprintf( dflag, "\nMake a local STARTD w/ explicit name\n\n" );
Daemon d2( DT_STARTD, get_local_fqdn().Value() );
if( d2.locate() ) {
d2.display( dflag );
} else {
dprintf( dflag, "%s\n", d2.error() );
}
dprintf( dflag, "\nMake a local COLLECTOR w/ explicit name\n\n" );
Daemon d3( DT_COLLECTOR, "turkey.cs.wisc.edu" );
if( d3.locate() ) {
d3.display( dflag );
} else {
dprintf( dflag, "%s\n", d3.error() );
}
dprintf( dflag, "\nUse idStr for a remote STARTD\n\n" );
Daemon d4( DT_STARTD, "puck.cs.wisc.edu" );
if( d4.locate() ) {
dprintf( dflag, "Found %s\n", d4.idStr() );
} else {
dprintf( dflag, "%s\n", d4.error() );
}
dprintf( dflag, "\nTest socks on a valid Daemon that isn't up\n\n" );
Daemon d5( DT_SCHEDD, "cabernet.cs.wisc.edu" );
testSocks( &d5 );
dprintf( dflag, "\nCM where you specify pool and not name\n\n" );
Daemon d6( DT_COLLECTOR, NULL, "condor" );
if( d6.locate() ) {
d6.display( dflag );
} else {
dprintf( dflag, "%s\n", d6.error() );
}
dprintf( dflag, "\nUsing sinful string for the collector\n\n" );
Daemon d7( DT_COLLECTOR, "<128.105.143.16:9618>" );
if( d7.locate() ) {
dprintf( dflag, "Found %s\n", d7.idStr() );
d7.display( dflag );
} else {
dprintf( dflag, "%s\n", d7.error() );
}
dprintf( dflag, "\nRemote daemons we should NOT find\n\n" );
makeAndDisplayRegular( "bazzle.cs.wisc.edu", "condor" );
makeAndDisplayCM( "bazzle", "bazzle" );
}
int
Player::generateAttributes()
{
for(int i=0; i<6; i++) {
int dice[3];
for(int ii=0; ii<3; ii++) {
dice[ii] = d6(RAND);
}
int lowest = 0;
for(int ii=1; ii<3; ii++) {
if(dice[ii] < dice[lowest]) {
lowest = ii;
}
}
int amount = 6 + dice[(lowest+1)%3] + dice[(lowest+2)%3];
switch(i) {
case 0:
m_str = amount;
break;
case 1:
m_dex = amount;
break;
case 2:
m_con = amount;
break;
case 3:
m_int = amount;
break;
case 4:
m_wis = amount;
break;
case 5:
m_cha = amount;
break;
}
}
int manaPoints = 0;
switch(m_race) {
case PLAYER_HUMAN:
m_raceName = "Human";
manaPoints = 4;
break;
case PLAYER_VEDALKEN:
m_raceName = "Vedalken";
m_str -= 3;
m_con -= 3;
manaPoints = 3;
m_maxMana[COLOR_BLUE] = 3;
break;
case PLAYER_VIASHINO:
m_raceName = "Viashino";
m_str += 3;
m_con -= 3;
manaPoints = 1;
m_maxMana[COLOR_RED] = 3;
break;
case PLAYER_LEONIN:
m_raceName = "Leonin";
m_dex += 3;
m_str -= 3;
manaPoints = 2;
m_maxMana[COLOR_WHITE] = 2;
break;
}
return manaPoints;
}
int main (int, char**)
{
UnitTest t (110);
// Ensure environment has no influence.
unsetenv ("TASKDATA");
unsetenv ("TASKRC");
// Path ();
Path p0;
t.is (p0._data, "", "Path::Path");
// Path (const Path&);
Path p1 = Path ("foo");
t.is (p1._data, Directory::cwd () + "/foo", "Path::operator=");
// Path (const std::string&);
Path p2 ("~");
t.ok (p2._data != "~", "~ expanded to " + p2._data);
Path p3 ("/tmp");
t.ok (p3._data == "/tmp", "/tmp -> /tmp");
// operator==
t.notok (p2 == p3, "p2 != p3");
// Path& operator= (const Path&);
Path p3_copy (p3);
t.is (p3._data, p3_copy._data, "Path::Path (Path&)");
// operator (std::string) const;
t.is ((std::string) p3, "/tmp", "Path::operator (std::string) const");
// std::string name () const;
Path p4 ("/a/b/c/file.ext");
t.is (p4.name (), "file.ext", "/a/b/c/file.ext name is file.ext");
// std::string parent () const;
t.is (p4.parent (), "/a/b/c", "/a/b/c/file.ext parent is /a/b/c");
// std::string extension () const;
t.is (p4.extension (), "ext", "/a/b/c/file.ext extension is ext");
// bool exists () const;
t.ok (p2.exists (), "~ exists");
t.ok (p3.exists (), "/tmp exists");
// bool is_directory () const;
t.ok (p2.is_directory (), "~ is_directory");
t.ok (p3.is_directory (), "/tmp is_directory");
// bool is_link () const;
t.notok (p2.is_link (), "~ !is_link");
// bool readable () const;
t.ok (p2.readable (), "~ readable");
t.ok (p3.readable (), "/tmp readable");
// bool writable () const;
t.ok (p2.writable (), "~ writable");
t.ok (p3.writable (), "/tmp writable");
// bool executable () const;
t.ok (p2.executable (), "~ executable");
t.ok (p3.executable (), "/tmp executable");
// static std::string expand (const std::string&);
t.ok (Path::expand ("~") != "~", "Path::expand ~ != ~");
t.ok (Path::expand ("~/") != "~/", "Path::expand ~/ != ~/");
// static std::vector <std::string> glob (const std::string&);
std::vector <std::string> out = Path::glob ("/tmp");
t.ok (out.size () == 1, "/tmp -> 1 result");
t.is (out[0], "/tmp", "/tmp -> /tmp");
out = Path::glob ("/t?p");
t.ok (out.size () == 1, "/t?p -> 1 result");
t.is (out[0], "/tmp", "/t?p -> /tmp");
out = Path::glob ("/[s-u]mp");
t.ok (out.size () == 1, "/[s-u]mp -> 1 result");
t.is (out[0], "/tmp", "/[s-u]mp -> /tmp");
// bool is_absolute () const;
t.notok (p0.is_absolute (), "'' !is_absolute");
t.ok (p1.is_absolute (), "foo is_absolute");
t.ok (p2.is_absolute (), "~ is_absolute (after expansion)");
t.ok (p3.is_absolute (), "/tmp is_absolute");
t.ok (p4.is_absolute (), "/a/b/c/file.ext is_absolute");
Directory tmp ("tmp");
tmp.create ();
t.ok (tmp.exists (), "tmp dir created.");
File::write ("tmp/file.t.txt", "This is a test\n");
File f6 ("tmp/file.t.txt");
t.ok (f6.size () == 15, "File::size tmp/file.t.txt good");
t.ok (f6.mode () & S_IRUSR, "File::mode tmp/file.t.txt good");
t.ok (File::remove ("tmp/file.t.txt"), "File::remove tmp/file.t.txt good");
// operator (std::string) const;
t.is ((std::string) f6, Directory::cwd () + "/tmp/file.t.txt", "File::operator (std::string) const");
t.ok (File::create ("tmp/file.t.create"), "File::create tmp/file.t.create good");
t.ok (File::remove ("tmp/file.t.create"), "File::remove tmp/file.t.create good");
// basename (std::string) const;
t.is (f6.name (), "file.t.txt", "File::basename tmp/file.t.txt --> file.t.txt");
// dirname (std::string) const;
t.is (f6.parent (), Directory::cwd () + "/tmp", "File::dirname tmp/file.t.txt --> tmp");
// bool rename (const std::string&);
File f7 ("tmp/file.t.2.txt");
f7.append ("something\n");
f7.close ();
t.ok (f7.rename ("tmp/file.t.3.txt"), "File::rename did not fail");
t.is (f7._data, Directory::cwd () + "/tmp/file.t.3.txt", "File::rename stored new name");
t.ok (f7.exists (), "File::rename new file exists");
t.ok (f7.remove (), "File::remove tmp/file.t.3.txt good");
t.notok (f7.exists (), "File::remove new file no longer exists");
// Test permissions.
File f8 ("tmp/file.t.perm.txt");
f8.create (0744);
t.ok (f8.exists (), "File::create perm file exists");
mode_t m = f8.mode ();
t.ok (m & S_IFREG, "File::mode tmp/file.t.perm.txt S_IFREG good");
t.ok (m & S_IRUSR, "File::mode tmp/file.t.perm.txt r-------- good");
t.ok (m & S_IWUSR, "File::mode tmp/file.t.perm.txt -w------- good");
t.ok (m & S_IXUSR, "File::mode tmp/file.t.perm.txt --x------ good");
t.ok (m & S_IRGRP, "File::mode tmp/file.t.perm.txt ---r----- good");
t.notok (m & S_IWGRP, "File::mode tmp/file.t.perm.txt ----w---- good");
t.notok (m & S_IXGRP, "File::mode tmp/file.t.perm.txt -----x--- good");
t.ok (m & S_IROTH, "File::mode tmp/file.t.perm.txt ------r-- good");
t.notok (m & S_IWOTH, "File::mode tmp/file.t.perm.txt -------w- good");
t.notok (m & S_IXOTH, "File::mode tmp/file.t.perm.txt --------x good");
f8.remove ();
t.notok (f8.exists (), "File::remove perm file no longer exists");
tmp.remove ();
t.notok (tmp.exists (), "tmp dir removed.");
tmp.create ();
t.ok (tmp.exists (), "tmp dir created.");
// Directory (const File&);
// Directory (const Path&);
Directory d0 (Path ("tmp"));
Directory d1 (File ("tmp"));
Directory d2 (File (Path ("tmp")));
t.is (d0._data, d1._data, "Directory(std::string) == Directory (File&)");
t.is (d0._data, d2._data, "Directory(std::string) == Directory (File (Path &))");
t.is (d1._data, d2._data, "Directory(File&)) == Directory (File (Path &))");
// Directory (const Directory&);
Directory d3 (d2);
t.is (d3._data, Directory::cwd () + "/tmp", "Directory (Directory&)");
// Directory (const std::string&);
Directory d4 ("tmp/test_directory");
// Directory& operator= (const Directory&);
Directory d5 = d4;
t.is (d5._data, Directory::cwd () + "/tmp/test_directory", "Directory::operator=");
// operator (std::string) const;
t.is ((std::string) d3, Directory::cwd () + "/tmp", "Directory::operator (std::string) const");
// virtual bool create ();
t.ok (d5.create (), "Directory::create tmp/test_directory");
t.ok (d5.exists (), "Directory::exists tmp/test_directory");
Directory d6 (d5._data + "/dir");
t.ok (d6.create (), "Directory::create tmp/test_directory/dir");
File::create (d5._data + "/f0");
File::create (d6._data + "/f1");
// std::vector <std::string> list ();
std::vector <std::string> files = d5.list ();
std::sort (files.begin (), files.end ());
t.is ((int)files.size (), 2, "Directory::list 1 file");
t.is (files[0], Directory::cwd () + "/tmp/test_directory/dir", "file[0] is tmp/test_directory/dir");
t.is (files[1], Directory::cwd () + "/tmp/test_directory/f0", "file[1] is tmp/test_directory/f0");
// std::vector <std::string> listRecursive ();
files = d5.listRecursive ();
std::sort (files.begin (), files.end ());
t.is ((int)files.size (), 2, "Directory::list 1 file");
t.is (files[0], Directory::cwd () + "/tmp/test_directory/dir/f1", "file is tmp/test_directory/dir/f1");
t.is (files[1], Directory::cwd () + "/tmp/test_directory/f0", "file is tmp/test_directory/f0");
// virtual bool remove ();
t.ok (File::remove (d5._data + "/f0"), "File::remove tmp/test_directory/f0");
t.ok (File::remove (d6._data + "/f1"), "File::remove tmp/test_directory/dir/f1");
t.ok (d6.remove (), "Directory::remove tmp/test_directory/dir");
t.notok (d6.exists (), "Directory::exists tmp/test_directory/dir - no");
t.ok (d5.remove (), "Directory::remove tmp/test_directory");
t.notok (d5.exists (), "Directory::exists tmp/test_directory - no");
// bool remove (const std::string&);
Directory d7 ("tmp/to_be_removed");
t.ok (d7.create (), "Directory::create tmp/to_be_removed");
File::create (d7._data + "/f0");
Directory d8 (d7._data + "/another");
t.ok (d8.create (), "Directory::create tmp/to_be_removed/another");
File::create (d8._data + "/f1");
t.ok (d7.remove (), "Directory::remove tmp/to_be_removed");
t.notok (d7.exists (), "Directory tmp/to_be_removed gone");
// static std::string cwd ();
std::string cwd = Directory::cwd ();
t.ok (cwd.length () > 0, "Directory::cwd returned a value");
// bool parent (std::string&) const;
Directory d9 ("/one/two/three/four.txt");
t.ok (d9.up (), "parent /one/two/three/four.txt --> true");
t.is (d9._data, "/one/two/three", "parent /one/two/three/four.txt --> /one/two/three");
t.ok (d9.up (), "parent /one/two/three --> true");
t.is (d9._data, "/one/two", "parent /one/two/three --> /one/two");
t.ok (d9.up (), "parent /one/two --> true");
t.is (d9._data, "/one", "parent /one/two --> /one");
t.ok (d9.up (), "parent /one --> true");
t.is (d9._data, "/", "parent /one --> /");
t.notok (d9.up (), "parent / --> false");
// Test permissions.
umask (0022);
Directory d10 ("tmp/dir.perm");
d10.create (0750);
t.ok (d10.exists (), "Directory::create perm file exists");
m = d10.mode ();
t.ok (m & S_IFDIR, "Directory::mode tmp/dir.perm S_IFDIR good");
t.ok (m & S_IRUSR, "Directory::mode tmp/dir.perm r-------- good");
t.ok (m & S_IWUSR, "Directory::mode tmp/dir.perm -w------- good");
t.ok (m & S_IXUSR, "Directory::mode tmp/dir.perm --x------ good");
t.ok (m & S_IRGRP, "Directory::mode tmp/dir.perm ---r----- good");
t.notok (m & S_IWGRP, "Directory::mode tmp/dir.perm ----w---- good");
t.ok (m & S_IXGRP, "Directory::mode tmp/dir.perm -----x--- good");
t.notok (m & S_IROTH, "Directory::mode tmp/dir.perm ------r-- good");
t.notok (m & S_IWOTH, "Directory::mode tmp/dir.perm -------w- good");
t.notok (m & S_IXOTH, "Directory::mode tmp/dir.perm --------x good");
d10.remove ();
t.notok (d10.exists (), "Directory::remove temp/dir.perm file no longer exists");
tmp.remove ();
t.notok (tmp.exists (), "tmp dir removed.");
return 0;
}
/* Call functions through pointers and and check against expected results. */
void
test (void)
{
CHECK_VOID_RESULT (v0 (), 1.0);
CHECK_VOID_RESULT (v1 (1.0), 2.0);
CHECK_VOID_RESULT (v5 (5.0, 6.0), 12.0);
CHECK_VOID_RESULT (v9 (9.0, 10.0), 20.0);
CHECK_VOID_RESULT (v2 (2.0), 3.0);
CHECK_VOID_RESULT (v6 (6.0, 7.0), 14.0);
CHECK_VOID_RESULT (v10 (10.0, 11.0), 22.0);
CHECK_RESULT (f0 (), 1.0);
CHECK_RESULT (f1 (1.0), 2.0);
CHECK_RESULT (f5 (5.0, 6.0), 12.0);
CHECK_RESULT (f9 (9.0, 10.0), 20.0);
CHECK_RESULT (f2 (2.0), 3.0);
CHECK_RESULT (f6 (6.0, 7.0), 14.0);
CHECK_RESULT (f10 (10.0, 11.0), 22.0);
CHECK_RESULT (d0 (), 1.0);
CHECK_RESULT (d1 (1.0), 2.0);
CHECK_RESULT (d5 (5.0, 6.0), 12.0);
CHECK_RESULT (d9 (9.0, 10.0), 20.0);
CHECK_RESULT (d2 (2.0), 3.0);
CHECK_RESULT (d6 (6.0, 7.0), 14.0);
CHECK_RESULT (d10 (10.0, 11.0), 22.0);
CHECK_RESULT (cf0 (), 1.0 + 0.0i);
CHECK_RESULT (cf1 (1.0), 2.0 + 1.0i);
CHECK_RESULT (cf5 (5.0, 6.0), 12.0 + 5.0i);
CHECK_RESULT (cf9 (9.0, 10.0), 20.0 + 9.0i);
CHECK_RESULT (cf2 (2.0), 3.0 + 2.0i);
CHECK_RESULT (cf6 (6.0, 7.0), 14.0 + 6.0i);
CHECK_RESULT (cf10 (10.0, 11.0), 22.0 + 10.0i);
CHECK_RESULT (cd0 (), 1.0 + 0.0i);
CHECK_RESULT (cd1 (1.0), 2.0 + 1.0i);
CHECK_RESULT (cd5 (5.0, 6.0), 12.0 + 5.0i);
CHECK_RESULT (cd9 (9.0, 10.0), 20.0 + 9.0i);
CHECK_RESULT (cd2 (2.0), 3.0 + 2.0i);
CHECK_RESULT (cd6 (6.0, 7.0), 14.0 + 6.0i);
CHECK_RESULT (cd10 (10.0, 11.0), 22.0 + 10.0i);
CHECK_VOID_RESULT ((*pv0) (), 1.0);
CHECK_VOID_RESULT ((*pv1) (1.0), 2.0);
CHECK_VOID_RESULT ((*pv5) (5.0, 6.0), 12.0);
CHECK_VOID_RESULT ((*pv9) (9.0, 10.0), 20.0);
CHECK_VOID_RESULT ((*pv2) (2.0), 3.0);
CHECK_VOID_RESULT ((*pv6) (6.0, 7.0), 14.0);
CHECK_VOID_RESULT ((*pv10) (10.0, 11.0), 22.0);
CHECK_RESULT ((*pf0) (), 1.0);
CHECK_RESULT ((*pf1) (1.0), 2.0);
CHECK_RESULT ((*pf5) (5.0, 6.0), 12.0);
CHECK_RESULT ((*pf9) (9.0, 10.0), 20.0);
CHECK_RESULT ((*pf2) (2.0), 3.0);
CHECK_RESULT ((*pf6) (6.0, 7.0), 14.0);
CHECK_RESULT ((*pf10) (10.0, 11.0), 22.0);
CHECK_RESULT ((*pd0) (), 1.0);
CHECK_RESULT ((*pd1) (1.0), 2.0);
CHECK_RESULT ((*pd5) (5.0, 6.0), 12.0);
CHECK_RESULT ((*pd9) (9.0, 10.0), 20.0);
CHECK_RESULT ((*pd2) (2.0), 3.0);
CHECK_RESULT ((*pd6) (6.0, 7.0), 14.0);
CHECK_RESULT ((*pd10) (10.0, 11.0), 22.0);
CHECK_RESULT ((*pcf0) (), 1.0 + 0.0i);
CHECK_RESULT ((*pcf1) (1.0), 2.0 + 1.0i);
CHECK_RESULT ((*pcf5) (5.0, 6.0), 12.0 + 5.0i);
CHECK_RESULT ((*pcf9) (9.0, 10.0), 20.0 + 9.0i);
CHECK_RESULT ((*pcf2) (2.0), 3.0 + 2.0i);
CHECK_RESULT ((*pcf6) (6.0, 7.0), 14.0 + 6.0i);
CHECK_RESULT ((*pcf10) (10.0, 11.0), 22.0 + 10.0i);
CHECK_RESULT ((*pcd0) (), 1.0 + 0.0i);
CHECK_RESULT ((*pcd1) (1.0), 2.0 + 1.0i);
CHECK_RESULT ((*pcd5) (5.0, 6.0), 12.0 + 5.0i);
CHECK_RESULT ((*pcd9) (9.0, 10.0), 20.0 + 9.0i);
CHECK_RESULT ((*pcd2) (2.0), 3.0 + 2.0i);
CHECK_RESULT ((*pcd6) (6.0, 7.0), 14.0 + 6.0i);
CHECK_RESULT ((*pcd10) (10.0, 11.0), 22.0 + 10.0i);
}
int main (int argc, char** argv)
{
UnitTest t (49);
// Ensure environment has no influence.
unsetenv ("TASKDATA");
unsetenv ("TASKRC");
Directory tmp ("tmp");
tmp.create ();
t.ok (tmp.exists (), "tmp dir created.");
// Directory (const File&);
// Directory (const Path&);
Directory d0 (Path ("tmp"));
Directory d1 (File ("tmp"));
Directory d2 (File (Path ("tmp")));
t.is (d0._data, d1._data, "Directory(std::string) == Directory (File&)");
t.is (d0._data, d2._data, "Directory(std::string) == Directory (File (Path &))");
t.is (d1._data, d2._data, "Directory(File&)) == Directory (File (Path &))");
// Directory (const Directory&);
Directory d3 (d2);
t.is (d3._data, Directory::cwd () + "/tmp", "Directory (Directory&)");
// Directory (const std::string&);
Directory d4 ("tmp/test_directory");
// Directory& operator= (const Directory&);
Directory d5 = d4;
t.is (d5._data, Directory::cwd () + "/tmp/test_directory", "Directory::operator=");
// operator (std::string) const;
t.is ((std::string) d3, Directory::cwd () + "/tmp", "Directory::operator (std::string) const");
// virtual bool create ();
t.ok (d5.create (), "Directory::create tmp/test_directory");
t.ok (d5.exists (), "Directory::exists tmp/test_directory");
Directory d6 (d5._data + "/dir");
t.ok (d6.create (), "Directory::create tmp/test_directory/dir");
File::create (d5._data + "/f0");
File::create (d6._data + "/f1");
// std::vector <std::string> list ();
std::vector <std::string> files = d5.list ();
std::sort (files.begin (), files.end ());
t.is ((int)files.size (), 2, "Directory::list 1 file");
t.is (files[0], Directory::cwd () + "/tmp/test_directory/dir", "file[0] is tmp/test_directory/dir");
t.is (files[1], Directory::cwd () + "/tmp/test_directory/f0", "file[1] is tmp/test_directory/f0");
// std::vector <std::string> listRecursive ();
files = d5.listRecursive ();
std::sort (files.begin (), files.end ());
t.is ((int)files.size (), 2, "Directory::list 1 file");
t.is (files[0], Directory::cwd () + "/tmp/test_directory/dir/f1", "file is tmp/test_directory/dir/f1");
t.is (files[1], Directory::cwd () + "/tmp/test_directory/f0", "file is tmp/test_directory/f0");
// virtual bool remove ();
t.ok (File::remove (d5._data + "/f0"), "File::remove tmp/test_directory/f0");
t.ok (File::remove (d6._data + "/f1"), "File::remove tmp/test_directory/dir/f1");
t.ok (d6.remove (), "Directory::remove tmp/test_directory/dir");
t.notok (d6.exists (), "Directory::exists tmp/test_directory/dir - no");
t.ok (d5.remove (), "Directory::remove tmp/test_directory");
t.notok (d5.exists (), "Directory::exists tmp/test_directory - no");
// bool remove (const std::string&);
Directory d7 ("tmp/to_be_removed");
t.ok (d7.create (), "Directory::create tmp/to_be_removed");
File::create (d7._data + "/f0");
Directory d8 (d7._data + "/another");
t.ok (d8.create (), "Directory::create tmp/to_be_removed/another");
File::create (d8._data + "/f1");
t.ok (d7.remove (), "Directory::remove tmp/to_be_removed");
t.notok (d7.exists (), "Directory tmp/to_be_removed gone");
// static std::string cwd ();
std::string cwd = Directory::cwd ();
t.ok (cwd.length () > 0, "Directory::cwd returned a value");
// bool parent (std::string&) const;
Directory d9 ("/one/two/three/four.txt");
t.ok (d9.up (), "parent /one/two/three/four.txt --> true");
t.is (d9._data, "/one/two/three", "parent /one/two/three/four.txt --> /one/two/three");
t.ok (d9.up (), "parent /one/two/three --> true");
t.is (d9._data, "/one/two", "parent /one/two/three --> /one/two");
t.ok (d9.up (), "parent /one/two --> true");
t.is (d9._data, "/one", "parent /one/two --> /one");
t.ok (d9.up (), "parent /one --> true");
t.is (d9._data, "/", "parent /one --> /");
t.notok (d9.up (), "parent / --> false");
// Test permissions.
umask (0022);
Directory d10 ("tmp/dir.perm");
d10.create (0750);
t.ok (d10.exists (), "Directory::create perm file exists");
mode_t m = d10.mode ();
t.ok (m & S_IFDIR, "Directory::mode tmp/dir.perm S_IFDIR good");
t.ok (m & S_IRUSR, "Directory::mode tmp/dir.perm r-------- good");
t.ok (m & S_IWUSR, "Directory::mode tmp/dir.perm -w------- good");
t.ok (m & S_IXUSR, "Directory::mode tmp/dir.perm --x------ good");
t.ok (m & S_IRGRP, "Directory::mode tmp/dir.perm ---r----- good");
t.notok (m & S_IWGRP, "Directory::mode tmp/dir.perm ----w---- good");
t.ok (m & S_IXGRP, "Directory::mode tmp/dir.perm -----x--- good");
t.notok (m & S_IROTH, "Directory::mode tmp/dir.perm ------r-- good");
t.notok (m & S_IWOTH, "Directory::mode tmp/dir.perm -------w- good");
t.notok (m & S_IXOTH, "Directory::mode tmp/dir.perm --------x good");
d10.remove ();
t.notok (d10.exists (), "Directory::remove temp/dir.perm file no longer exists");
tmp.remove ();
t.notok (tmp.exists (), "tmp dir removed.");
return 0;
}
