int main(void) {
f0();
f1();
f2();
f3();
f4();
f5();
f6();
f7();
f8();
f9();
f10();
f11();
f12();
f13();
f14();
f15();
f16();
f17();
f18();
f19();
f20();
f21();
f22();
f23();
f24();
f25();
f26();
f27();
f28();
f29();
f30();
f31();
f32();
f33();
f34();
f35();
f36();
f37();
f38();
f39();
f40();
f41();
f42();
f43();
f44();
f45();
f46();
f47();
f48();
f49();
f50();
f51();
f52();
f53();
f54();
f55();
f56();
f57();
f58();
f59();
f60();
f61();
f62();
f63();
f64();
f65();
f66();
f67();
f68();
f69();
return 0;
}
void
GetEccenNpart_new(char* xname = "ile")
{
gStyle->SetOptStat(0);
gStyle->SetTitle(0);
char name[100];
TChain* ch = new TChain("t");
int n;
//you need a file list of root ntuple: fxxxx.lis
//
sprintf(name,"f%s.lis",xname);
cout << "open the filelist : " << name << endl;
ifstream fin(name);
string filename;
while(!fin.eof()){
fin >> filename;
if(filename.empty()) continue;
cout << filename << endl;
ch->AddFile(filename.c_str());
}
fin.close();
double b;
int ncoll;
int npart;
int nHitBbc_n, nHitBbc_s;
double qBBC_n, qBBC_s;
double vertex, ecc_std, ecc_rp, ecc_part,e4;
double r_oll,r_geo,r_arith;
ch->SetBranchAddress("b", &b );
ch->SetBranchAddress("vertex", &vertex );
ch->SetBranchAddress("ncoll", &ncoll );
ch->SetBranchAddress("npart", &npart );
ch->SetBranchAddress("ecc_std", &ecc_std );
ch->SetBranchAddress("ecc_rp", &ecc_rp );
ch->SetBranchAddress("ecc_part", &ecc_part );
ch->SetBranchAddress("r_ollitra", &r_oll );
ch->SetBranchAddress("r_geo", &r_geo );
ch->SetBranchAddress("r_arith", &r_arith );
ch->SetBranchAddress("e4", &e4 );
ch->SetBranchAddress("qBBC_n", &qBBC_n );
ch->SetBranchAddress("qBBC_s", &qBBC_s );
ch->SetBranchAddress("nHitBbc_n", &nHitBbc_n);
ch->SetBranchAddress("nHitBbc_s", &nHitBbc_s);
char fname[100];
sprintf(fname,"rootfile/g%s_cent.root",xname);
TFile* fout = new TFile(fname,"recreate");//rootfile to save distributions
TH1* hbbcq = new TH1D("hbbcq","hbbcq",12000,-0.5,2999.5); hbbcq->Sumw2();
TH1* hbbcqall = new TH1D("hbbcqall","hbbcqall",12000,-0.5,2999.5);hbbcqall->Sumw2();
TH1* hbbcqeff = new TH1D("hbbcqeff","hbbcqeff",12000,-0.5,2999.5);hbbcqeff->Sumw2();
n = ch->GetEntries();
cout << "events: "<< n << endl;
//First loop determines the BBC trigger efficiency
//as function of bbcq;
for(int i=0; i<n; i++){
ch->GetEntry(i);
if(nHitBbc_n>=2&&nHitBbc_s>=2){
hbbcq->Fill( (qBBC_n+qBBC_s)/100. );//divide by 100 to fit in 0-3000 range
}
hbbcqall->Fill( (qBBC_n+qBBC_s)/100. );
}
hbbcqeff->Divide(hbbcq,hbbcqall);
efficiency = hbbcq->Integral()/hbbcqall->Integral();
cout << "efficiency : " << efficiency << endl;
//hbin contains the integrated fraction starting from 0 bbc charge, including the BBC trigger efficiency
TH1* hbin = new TH1D("hbin","hbin",hbbcq->GetNbinsX(),-0.5,2999.5);
TH1* hbbcqscale = (TH1*)hbbcq->Clone("hbbcqscale");
hbbcqscale->Scale(1.0/hbbcq->Integral());
for(int i=1; i<=hbbcqscale->GetNbinsX(); i++){
hbin->SetBinContent(i,hbbcqscale->Integral(1,i));
}
//Following two lines defines the array of cuts and average bbc charge
//for centrality percentitle in 5%, 10% and 20% steps
double bbcq5[21],bbcq10[11],bbcq20[6];
double abbcq5[20],abbcq10[10],abbcq20[5];
//calculate the various variables for 5% step
GetCentrality(hbin,20,bbcq5,hbbcq,abbcq5);
cout << endl << endl;
//calculate the various variables for 10% step
GetCentrality(hbin,10,bbcq10,hbbcq,abbcq10);
cout << endl << endl;
//calculate the various variables for 20% step
GetCentrality(hbin,5,bbcq20,hbbcq,abbcq20);
cout << endl << endl;
cout << " Find cuts for all the centralities " << endl << endl;
const int nval=9;//number of variables to fill
char* centname[3] = {"5pStep","10pStep","20pStep"};
char* varname[nval] = {"npart","ncoll","b","standard_ecc","reactionplane_ecc","participant_ecc","R_Ollitraut","R_Geo", "R_arith"};
double vup[nval] = {499.5,2999.5,19.995,1,1,1,4,4,4};
double vlo[nval] = {-0.5,-0.5,-0.005,-1,-1,-1,0,0,0};
int vNb[nval] = {500,3000,2000,200,200,200,400,400,400};
//initialize the histograms which are used to fill the distribution of variables for each centrality
TH1* hvar[3][nval][20];
for(int i=0; i<3; i++){
int NC = 0;
if(i==0) NC = 20;
else if(i==1) NC = 10;
else if(i==2) NC = 5;
for(int ivar=0; ivar<nval; ivar++){
for(int icen=0; icen<NC; icen++){
sprintf(name,"hvar_%s_%s_cent%d",centname[i],varname[ivar],icen);
hvar[i][ivar][icen] = new TH1D(name,name,vNb[ivar],vlo[ivar],vup[ivar]);
}
}
}
double qbbcsum;
for(int i=0; i<n; i++){
if(i%1000000==0) cout << i << endl;
ch->GetEntry(i);
if(!(nHitBbc_n>=2&&nHitBbc_s>=2)) continue;//BBC trigger condition
qbbcsum = (qBBC_n+qBBC_s)/100.;
int centbin5 = FindBin(20,bbcq5,qbbcsum);
int centbin10 = FindBin(10,bbcq10,qbbcsum);
int centbin20 = FindBin(5,bbcq20,qbbcsum);
if(centbin5==-1) continue;
if(centbin10==-1) continue;
if(centbin20==-1) continue;
//find the weight according to the corresponding average efficiency.
double weight = hbbcqeff->GetBinContent(hbbcqeff->FindBin(qbbcsum));
//5 percent step
//
hvar[0][0][centbin5]->Fill(npart,weight);
hvar[0][1][centbin5]->Fill(ncoll,weight);
hvar[0][2][centbin5]->Fill(b,weight);
hvar[0][3][centbin5]->Fill(ecc_std,weight);
hvar[0][4][centbin5]->Fill(ecc_rp,weight);
hvar[0][5][centbin5]->Fill(ecc_part,weight);
hvar[0][6][centbin5]->Fill(r_oll,weight);
hvar[0][7][centbin5]->Fill(r_geo,weight);
hvar[0][8][centbin5]->Fill(r_arith,weight);
//10 percent step
//
hvar[1][0][centbin10]->Fill(npart,weight);
hvar[1][1][centbin10]->Fill(ncoll,weight);
hvar[1][2][centbin10]->Fill(b,weight);
hvar[1][3][centbin10]->Fill(ecc_std,weight);
hvar[1][4][centbin10]->Fill(ecc_rp,weight);
hvar[1][5][centbin10]->Fill(ecc_part,weight);
hvar[1][6][centbin10]->Fill(r_oll,weight);
hvar[1][7][centbin10]->Fill(r_geo,weight);
hvar[1][8][centbin10]->Fill(r_arith,weight);
//20 percent step
//
hvar[2][0][centbin20]->Fill(npart,weight);
hvar[2][1][centbin20]->Fill(ncoll,weight);
hvar[2][2][centbin20]->Fill(b,weight);
hvar[2][3][centbin20]->Fill(ecc_std,weight);
hvar[2][4][centbin20]->Fill(ecc_rp,weight);
hvar[2][5][centbin20]->Fill(ecc_part,weight);
hvar[2][6][centbin20]->Fill(r_oll,weight);
hvar[2][7][centbin20]->Fill(r_geo,weight);
hvar[2][8][centbin20]->Fill(r_arith,weight);
}
//get mean and RMS values for the variables
float var[3][nval+1][20];
float rms[3][nval+1][20];
for(int i=0; i<3; i++){
int NC = 0;
if(i==0) NC = 20;
else if(i==1) NC = 10;
else if(i==2) NC = 5;
for(int icen=0; icen<NC; icen++){
for(int ivar=0; ivar<nval; ivar++){
var[i][ivar][icen] = hvar[i][ivar][icen]->GetMean();
rms[i][ivar][icen] = hvar[i][ivar][icen]->GetRMS();
}
var[i][nval][icen] = var[i][1][icen]/sigmann;
rms[i][nval][icen] = rms[i][1][icen]/sigmann;
}
}
//save to file
for(int ivar=0; ivar<4; ivar++){
for(int icen=0; icen<16; icen++){
cout<<var[0][ivar][icen]<<",";
}
cout<<var[2][ivar][4]<<",";
cout<<endl;
}
cout.precision(4);
sprintf(name,"5pstepresults/t%s.txt",xname);
ofstream f5(name);
cout << " Bin % & npart & ncoll & b & ecc_std & ecc_rp & ecc_part & r_ollitrau & T_{AB}\\\\\\hline" << endl;
for(int icen=0; icen<19; icen++){
for(int ivar=0; ivar<7; ivar++){
f5 << var[0][ivar][icen] << " ";
}
f5 << var[0][nval][icen] << " ";
f5 <<endl<< " (";
/* for(int ivar=0; ivar<7; ivar++){
f5 << rms[0][ivar][icen] << " ";
}
f5 << rms[0][nval][icen] << " ";
f5 << ")"<< endl;
*/
cout << icen*5 << "-" << icen*5+5;
for(int ivar=0; ivar<7; ivar++){
cout <<" & " <<var[0][ivar][icen] ;
}
cout <<" & " <<var[0][nval][icen] ;
cout <<"\\\\"<<endl;
for(int ivar=0; ivar<7; ivar++){
if(ivar==0)cout <<" & ("<<rms[0][ivar][icen];
else cout <<" & "<<rms[0][ivar][icen];
}
cout <<" & "<<rms[0][nval][icen];
cout << ")\\\\\\hline" << endl;
// printf(" & %3.1f & %4.1f & %2.2f & %1.3f & %1.3f & %1.3f & %1.3f \\\\\n",
// var[0][0][icen],var[0][1][icen],var[0][2][icen],var[0][3][icen],var[0][4][icen],var[0][5][icen],var[0][6][icen]);
//printf(" (& %3.1f & %4.1f & %2.2f & %1.3f & %1.3f & %1.3f & %1.3f) \\\\\\hline\n",
// rms[0][0][icen],rms[0][1][icen],rms[0][2][icen],rms[0][3][icen],rms[0][4][icen],rms[0][5][icen],rms[0][6][icen]);
}
f5.close();
cout << endl << endl;
sprintf(name,"10pstepresults/t%s.txt",xname);
ofstream f10(name);
cout <<endl<< " Bin % & npart & ncoll & b & ecc_std & ecc_rp & ecc_part & r_ollitrau & T_{AB}\\\\\\hline" << endl;
for(int icen=0; icen<10; icen++){
for(int ivar=0; ivar<7; ivar++){
f10 << var[1][ivar][icen] << " ";
}
f10 << var[1][nval][icen] << " ";
f10 <<endl<<" (";
/*for(int ivar=0; ivar<7; ivar++){
f10 << rms[1][ivar][icen] << " ";
}
f10 << rms[1][nval][icen] << " ";
f10 << ")" << endl;
*/
cout << icen*10 << "-" << icen*10+10;
for(int ivar=0; ivar<7; ivar++){
cout <<" & " <<var[1][ivar][icen] ;
}
cout <<" & " <<var[1][nval][icen] ;
cout <<"\\\\"<<endl;
for(int ivar=0; ivar<7; ivar++){
if(ivar==0)cout <<" & ("<<rms[1][ivar][icen];
else cout <<" & "<<rms[1][ivar][icen];
}
cout <<" & "<<rms[1][nval][icen];
cout << ")\\\\\\hline" << endl;
//printf(" & %3.1f & %4.1f & %2.2f & %1.3f & %1.3f & %1.3f & %1.3f \\\\\n",
// var[1][0][icen],var[1][1][icen],var[1][2][icen],var[1][3][icen],var[1][4][icen],var[1][5][icen],var[1][6][icen]);
//printf(" (& %3.1f & %4.1f & %2.2f & %1.3f & %1.3f & %1.3f & %1.3f) \\\\\\hline\n",
// rms[1][0][icen],rms[1][1][icen],rms[1][2][icen],rms[1][3][icen],rms[1][4][icen],rms[1][5][icen],rms[1][6][icen]);
}
f10.close();
cout << endl << endl;
sprintf(name,"20pstepresults/t%s.txt",xname);
ofstream f20(name);
cout <<endl<< " Bin % & npart & ncoll & b & ecc_std & ecc_rp & ecc_part & r_ollitrau & T_{AB}\\\\\\hline" << endl;
for(int icen=0; icen<5; icen++){
for(int ivar=0; ivar<7; ivar++){
f20 << var[2][ivar][icen] << " ";
}
f20 << var[2][nval][icen] << " ";
f20 << endl<< " (";
/*for(int ivar=0; ivar<7; ivar++){
f20 << rms[2][ivar][icen] << " ";
}
f20 << rms[2][nval][icen] << " ";
f20 << ")"<< endl;
*/
cout << icen*20 << "-" << icen*20+20;
for(int ivar=0; ivar<7; ivar++){
cout <<" & " <<var[2][ivar][icen] ;
}
cout <<" & " <<var[2][nval][icen] ;
cout <<"\\\\"<<endl;
for(int ivar=0; ivar<7; ivar++){
if(ivar==0)cout <<" & ("<<rms[2][ivar][icen];
else cout <<" & "<<rms[2][ivar][icen];
}
cout <<" & "<<rms[2][nval][icen];
cout << ")\\\\\\hline" << endl;
//printf(" & %3.1f & %4.1f & %2.2f & %1.3f & %1.3f & %1.3f & %1.3f \\\\\n",
// var[2][0][icen],var[2][1][icen],var[2][2][icen],var[2][3][icen],var[2][4][icen],var[2][5][icen],var[2][6][icen]);
//printf(" (& %3.1f & %4.1f & %2.2f & %1.3f & %1.3f & %1.3f & %1.3f) \\\\\\hline\n",
// rms[2][0][icen],rms[2][1][icen],rms[2][2][icen],rms[2][3][icen],rms[2][4][icen],rms[2][5][icen],rms[2][6][icen]);
}
f20.close();
fout->Write();
fout->Close();
return;
}
void h(char **a, char **b) {
f8(a, b);
f5(a, b);
g(a, b);
}
void
IntlTestNumberFormatAPI::testRegistration()
{
#if !UCONFIG_NO_SERVICE
UErrorCode status = U_ZERO_ERROR;
LocalPointer<NumberFormat> f0(NumberFormat::createInstance(SWAP_LOC, status));
LocalPointer<NumberFormat> f1(NumberFormat::createInstance(SRC_LOC, status));
LocalPointer<NumberFormat> f2(NumberFormat::createCurrencyInstance(SRC_LOC, status));
URegistryKey key = NumberFormat::registerFactory(new NFTestFactory(), status);
LocalPointer<NumberFormat> f3(NumberFormat::createCurrencyInstance(SRC_LOC, status));
LocalPointer<NumberFormat> f3a(NumberFormat::createCurrencyInstance(SRC_LOC, status));
LocalPointer<NumberFormat> f4(NumberFormat::createInstance(SRC_LOC, status));
StringEnumeration* locs = NumberFormat::getAvailableLocales();
LocalUNumberFormatPointer uf3(unum_open(UNUM_CURRENCY, NULL, 0, SRC_LOC.getName(), NULL, &status));
LocalUNumberFormatPointer uf4(unum_open(UNUM_DEFAULT, NULL, 0, SRC_LOC.getName(), NULL, &status));
const UnicodeString* res;
for (res = locs->snext(status); res; res = locs->snext(status)) {
logln(*res); // service is still in synch
}
NumberFormat::unregister(key, status); // restore for other tests
LocalPointer<NumberFormat> f5(NumberFormat::createCurrencyInstance(SRC_LOC, status));
LocalUNumberFormatPointer uf5(unum_open(UNUM_CURRENCY, NULL, 0, SRC_LOC.getName(), NULL, &status));
if (U_FAILURE(status)) {
dataerrln("Error creating instnaces.");
return;
} else {
float n = 1234.567f;
UnicodeString res0, res1, res2, res3, res4, res5;
UChar ures3[50];
UChar ures4[50];
UChar ures5[50];
f0->format(n, res0);
f1->format(n, res1);
f2->format(n, res2);
f3->format(n, res3);
f4->format(n, res4);
f5->format(n, res5);
unum_formatDouble(uf3.getAlias(), n, ures3, 50, NULL, &status);
unum_formatDouble(uf4.getAlias(), n, ures4, 50, NULL, &status);
unum_formatDouble(uf5.getAlias(), n, ures5, 50, NULL, &status);
logln((UnicodeString)"f0 swap int: " + res0);
logln((UnicodeString)"f1 src int: " + res1);
logln((UnicodeString)"f2 src cur: " + res2);
logln((UnicodeString)"f3 reg cur: " + res3);
logln((UnicodeString)"f4 reg int: " + res4);
logln((UnicodeString)"f5 unreg cur: " + res5);
log("uf3 reg cur: ");
logln(ures3);
log("uf4 reg int: ");
logln(ures4);
log("uf5 ureg cur: ");
logln(ures5);
if (f3.getAlias() == f3a.getAlias()) {
errln("did not get new instance from service");
f3a.orphan();
}
if (res3 != res0) {
errln("registered service did not match");
}
if (res4 != res1) {
errln("registered service did not inherit");
}
if (res5 != res2) {
errln("unregistered service did not match original");
}
if (res0 != ures3) {
errln("registered service did not match / unum");
}
if (res1 != ures4) {
errln("registered service did not inherit / unum");
}
if (res2 != ures5) {
errln("unregistered service did not match original / unum");
}
}
for (res = locs->snext(status); res; res = locs->snext(status)) {
errln(*res); // service should be out of synch
}
locs->reset(status); // now in synch again, we hope
for (res = locs->snext(status); res; res = locs->snext(status)) {
logln(*res);
}
delete locs;
#endif
}
__attribute__ ((noinline)) int
main1 (void)
{
int i, j;
for (j = 0; j < 8; j++)
{
for (i = 0; i <= N; i++)
{
ia[i] = i + 3;
ib[i] = i + N + 3;
asm ("");
}
switch (j)
{
case 0: f1 (); break;
case 1: f2 (); break;
case 2: f3 (); break;
case 3: f4 (); break;
case 4: f5 (); break;
case 5: f6 (); break;
case 6: f7 (); break;
case 7: f8 (); break;
}
for (i = 0; i <= N; i++)
{
int ea = i + 3;
int eb = i + N + 3;
switch (j)
{
case 0:
if (i) ea = 1;
if (i == 0) eb = 3;
else if (i != N) eb = 1;
break;
case 1:
if (i != N) ea = 1;
if (i != N) eb = i + 4;
break;
case 2:
if (i) ea = 1;
if (i != N) eb = i + 3;
break;
case 3:
if (i != N) ea = 1;
if (i < N - 1) eb = 1;
else if (i == N - 1) eb = 67;
break;
case 4:
ea = 1 + (i != N);
break;
case 5:
ea = 2 - (i != N);
break;
case 6:
ea = 1 + (i == 0);
break;
case 7:
ea = 2 - (i == 0);
break;
}
if (ia[i] != ea || ib[i] != eb)
abort ();
}
}
return 0;
}
int f6(void)
{
return f5(g1, f4());
}
EpcS1uDlTestSuite::EpcS1uDlTestSuite ()
: TestSuite ("epc-s1u-downlink", SYSTEM)
{
std::vector<EnbDlTestData> v1;
EnbDlTestData e1;
UeDlTestData f1 (1, 100);
e1.ues.push_back (f1);
v1.push_back (e1);
AddTestCase (new EpcS1uDlTestCase ("1 eNB, 1UE", v1), TestCase::QUICK);
std::vector<EnbDlTestData> v2;
EnbDlTestData e2;
UeDlTestData f2_1 (1, 100);
e2.ues.push_back (f2_1);
UeDlTestData f2_2 (2, 200);
e2.ues.push_back (f2_2);
v2.push_back (e2);
AddTestCase (new EpcS1uDlTestCase ("1 eNB, 2UEs", v2), TestCase::QUICK);
std::vector<EnbDlTestData> v3;
v3.push_back (e1);
v3.push_back (e2);
AddTestCase (new EpcS1uDlTestCase ("2 eNBs", v3), TestCase::QUICK);
EnbDlTestData e3;
UeDlTestData f3_1 (3, 50);
e3.ues.push_back (f3_1);
UeDlTestData f3_2 (5, 1472);
e3.ues.push_back (f3_2);
UeDlTestData f3_3 (1, 1);
e3.ues.push_back (f3_2);
std::vector<EnbDlTestData> v4;
v4.push_back (e3);
v4.push_back (e1);
v4.push_back (e2);
AddTestCase (new EpcS1uDlTestCase ("3 eNBs", v4), TestCase::QUICK);
std::vector<EnbDlTestData> v5;
EnbDlTestData e5;
UeDlTestData f5 (10, 3000);
e5.ues.push_back (f5);
v5.push_back (e5);
AddTestCase (new EpcS1uDlTestCase ("1 eNB, 10 pkts 3000 bytes each", v5), TestCase::QUICK);
std::vector<EnbDlTestData> v6;
EnbDlTestData e6;
UeDlTestData f6 (50, 3000);
e6.ues.push_back (f6);
v6.push_back (e6);
AddTestCase (new EpcS1uDlTestCase ("1 eNB, 50 pkts 3000 bytes each", v6), TestCase::QUICK);
std::vector<EnbDlTestData> v7;
EnbDlTestData e7;
UeDlTestData f7 (10, 15000);
e7.ues.push_back (f7);
v7.push_back (e7);
AddTestCase (new EpcS1uDlTestCase ("1 eNB, 10 pkts 15000 bytes each", v7), TestCase::QUICK);
std::vector<EnbDlTestData> v8;
EnbDlTestData e8;
UeDlTestData f8 (100, 15000);
e8.ues.push_back (f8);
v8.push_back (e8);
AddTestCase (new EpcS1uDlTestCase ("1 eNB, 100 pkts 15000 bytes each", v8), TestCase::QUICK);
}
int
main ()
{
int i;
check_vect ();
for (i = 0; i < N; i++)
{
switch (i % 9)
{
case 0: asm (""); a[i] = - i - 1; b[i] = i + 1; break;
case 1: a[i] = 0; b[i] = 0; break;
case 2: a[i] = i + 1; b[i] = - i - 1; break;
case 3: a[i] = i; b[i] = i + 7; break;
case 4: a[i] = i; b[i] = i; break;
case 5: a[i] = i + 16; b[i] = i + 3; break;
case 6: a[i] = - i - 5; b[i] = - i; break;
case 7: a[i] = - i; b[i] = - i; break;
case 8: a[i] = - i; b[i] = - i - 7; break;
}
}
for (i = 0; i < N; i++)
{
switch ((i / 9) % 3)
{
case 0: c[i] = a[i / 9]; d[i] = b[i / 9]; break;
case 1: c[i] = a[i / 9 + 3]; d[i] = b[i / 9 + 3]; break;
case 2: c[i] = a[i / 9 + 6]; d[i] = b[i / 9 + 6]; break;
}
}
f1 ();
for (i = 0; i < N; i++)
if (k[i] != ((i % 3) == 0 && ((i / 9) % 3) == 0))
abort ();
__builtin_memset (k, 0, sizeof (k));
f2 ();
for (i = 0; i < N; i++)
if (k[i] != ((i % 3) == 0 && ((i / 9) % 3) == 0))
abort ();
__builtin_memset (k, 0, sizeof (k));
f3 ();
for (i = 0; i < N; i++)
if (k[i] != ((i % 3) == 0 || ((i / 9) % 3) == 0))
abort ();
__builtin_memset (k, 0, sizeof (k));
f4 ();
for (i = 0; i < N; i++)
if (k[i] != ((i % 3) == 0 || ((i / 9) % 3) == 0))
abort ();
__builtin_memset (k, 0, sizeof (k));
f5 (k);
for (i = 0; i < N; i++)
if (k[i] != ((i % 3) == 0 && ((i / 9) % 3) == 0))
abort ();
__builtin_memset (k, 0, sizeof (k));
f6 (k);
for (i = 0; i < N; i++)
if (k[i] != ((i % 3) == 0 && ((i / 9) % 3) == 0))
abort ();
__builtin_memset (k, 0, sizeof (k));
f7 (k);
for (i = 0; i < N; i++)
if (k[i] != ((i % 3) == 0 || ((i / 9) % 3) == 0))
abort ();
__builtin_memset (k, 0, sizeof (k));
f8 (k);
for (i = 0; i < N; i++)
if (k[i] != ((i % 3) == 0 || ((i / 9) % 3) == 0))
abort ();
__builtin_memset (k, 0, sizeof (k));
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 ()
{
try
{
/********** Setup ************/
saga::session s;
saga::context c ("opencloud");
s.add_context (c) ;
/********** Write File************/
std::cout << std::endl ;
std::cout << std::endl ;
saga::filesystem::file f (s, "sector://test", saga::filesystem::ReadWrite ) ;
std::string towrite ("hello world !\n") ;
saga::const_buffer buf ( towrite.c_str(), towrite.length()) ;
f.write( buf, towrite.length()) ;
std::cout << "Written data: " << towrite ;
/********** Read File************/
saga::mutable_buffer bufread ( towrite.length()) ;
f.read( bufread, towrite.length()) ;
std::cout << "Data read: " << (char*) bufread.get_data() ;
/********* Seek File ************/
std::cout << "Seek to the end .. " << std::endl ;
f.seek( towrite.length(), saga::filesystem::Start ) ;
std::string w2 (" clouds!") ;
std::cout << "Write some more: " << w2 << std::endl ;
saga::const_buffer buf2( w2.c_str(), w2.length()) ;
f.write( buf2, w2.length()) ;
/********* Read new data ************/
f.seek( 0, saga::filesystem::Start ) ;
saga::mutable_buffer bufread2( towrite.length() + w2.length() + 1 ) ;
f.read( bufread2, towrite.length() + w2.length() + 1 ) ;
std::cout << "Data read after seek and write: " << (char*) bufread2.get_data() << std::endl ;
f.close() ;
/********* Directory ***************/
/*Create directories
*/
std::cout << std::endl ;
std::cout << "Create directory my_dir..." << std::endl ;
std::cout << "Create directory my_dir/another_dir..." << std::endl ;
saga::url dir ("sector://my_dir") ;
saga::url dir2 ("sector://my_dir/another_dir") ;
saga::filesystem::directory d( s, dir ) ;
saga::filesystem::directory d2( s, dir2 ) ;
/* Change working directory
*/
std::cout << "Changing cwd to my_dir/another_dir..." << std::endl ;
d.change_dir("another_dir") ;
std::cout << "Creating my_dir/another_dir/nested_dir ... " << std::endl ;
d.make_dir("nested_dir") ;
/* Populate Directories
*/
std::cout << "Populate files in nested_dir ... " << std::endl ;
saga::filesystem::file f2 (s, "my_dir/another_dir/nested_dir/file1", saga::filesystem::ReadWrite ) ;
saga::filesystem::file f3 (s, "my_dir/another_dir/nested_dir/file2", saga::filesystem::ReadWrite ) ;
saga::filesystem::file f4 (s, "my_dir/another_dir/nested_dir/file3", saga::filesystem::ReadWrite ) ;
saga::filesystem::file f5 (s, "/makeme/file3", saga::filesystem::ReadWrite ) ;
f2.close() ;
f3.close() ;
f4.close() ;
f5.close() ;
/* List directory
*/
d.change_dir("nested_dir") ;
std::vector <saga::url> listing = d.list() ;
std::cout << "List nested_dir ..." << std::endl ;
for ( std::vector<saga::url>::iterator i = listing.begin(); i != listing.end(); ++ i)
{
std::cout << i->get_string() << std::endl ;
}
/* Copy Files */
d.copy( "file1", "sector:///" ) ;
return 0 ;
}
catch ( const saga::exception & e )
{
std::cerr << e.what ();
}
}
int f4(){
int x;
x = f5();
return 4+x;
}
bool run_flight(TaskManager &task_manager,
const AutopilotParameters &parms,
const int n_wind,
const double speed_factor)
{
DirectTaskAccessor ta(task_manager);
PrintTaskAutoPilot autopilot(parms);
AircraftSim aircraft;
autopilot.set_default_location(GeoPoint(Angle::degrees(fixed(1.0)), Angle::degrees(fixed(0.0))));
unsigned print_counter=0;
if (n_wind)
aircraft.set_wind(wind_to_mag(n_wind), wind_to_dir(n_wind));
autopilot.set_speed_factor(fixed(speed_factor));
std::ofstream f4("results/res-sample.txt");
std::ofstream f5("results/res-sample-filtered.txt");
bool do_print = verbose;
bool first = true;
time_elapsed = 0.0;
time_planned = 1.0;
time_remaining = 0;
calc_cruise_efficiency = 1.0;
calc_effective_mc = 1.0;
static const fixed fixed_10(10);
AirspaceAircraftPerformanceGlide perf(task_manager.get_glide_polar());
if (aircraft_filter)
aircraft_filter->Reset(aircraft.get_state());
autopilot.Start(ta);
aircraft.Start(autopilot.location_start, autopilot.location_previous,
parms.start_alt);
if (airspaces) {
airspace_warnings =
new AirspaceWarningManager(*airspaces, task_manager);
airspace_warnings->reset(aircraft.get_state());
}
do {
if ((task_manager.getActiveTaskPointIndex() == 1) &&
first && (task_manager.get_stats().total.time_elapsed > fixed_10)) {
time_remaining = task_manager.get_stats().total.time_remaining;
first = false;
time_planned = task_manager.get_stats().total.time_planned;
if (verbose > 1) {
printf("# time remaining %g\n", time_remaining);
printf("# time planned %g\n", time_planned);
}
}
if (do_print) {
PrintHelper::taskmanager_print(task_manager, aircraft.get_state());
const AircraftState state = aircraft.get_state();
f4 << state.time << " "
<< state.location.Longitude << " "
<< state.location.Latitude << " "
<< state.altitude << "\n";
f4.flush();
if (aircraft_filter) {
f5 << aircraft_filter->GetSpeed() << " "
<< aircraft_filter->GetBearing() << " "
<< aircraft_filter->GetClimbRate() << "\n";
f5.flush();
}
}
if (airspaces) {
scan_airspaces(aircraft.get_state(), *airspaces, perf,
do_print,
autopilot.target(ta));
}
if (airspace_warnings) {
if (verbose > 1) {
bool warnings_updated = airspace_warnings->update(aircraft.get_state(),
false, 1);
if (warnings_updated) {
printf("# airspace warnings updated, size %d\n",
(int)airspace_warnings->size());
print_warnings();
wait_prompt();
}
}
}
n_samples++;
do_print = (++print_counter % output_skip == 0) && verbose;
if (aircraft_filter)
aircraft_filter->Update(aircraft.get_state());
autopilot.update_state(ta, aircraft.get_state());
aircraft.Update(autopilot.heading);
{
const AircraftState state = aircraft.get_state();
const AircraftState state_last = aircraft.get_state_last();
task_manager.update(state, state_last);
task_manager.update_idle(state);
task_manager.update_auto_mc(state, fixed_zero);
}
} while (autopilot.update_autopilot(ta, aircraft.get_state(), aircraft.get_state_last()));
aircraft.Stop();
autopilot.Stop();
if (verbose) {
PrintHelper::taskmanager_print(task_manager, aircraft.get_state());
const AircraftState state = aircraft.get_state();
f4 << state.time << " "
<< state.location.Longitude << " "
<< state.location.Latitude << " "
<< state.altitude << "\n";
f4 << "\n";
f4.flush();
task_report(task_manager, "end of task\n");
}
wait_prompt();
time_elapsed = task_manager.get_stats().total.time_elapsed;
time_planned = task_manager.get_stats().total.time_planned;
calc_cruise_efficiency = task_manager.get_stats().cruise_efficiency;
calc_effective_mc = task_manager.get_stats().effective_mc;
if (verbose)
distance_counts();
if (airspace_warnings)
delete airspace_warnings;
return true;
}
void main()
{
/* request auto detection */
int gdriver = DETECT, gmode, errorcode;
/* initialize graphics mode */
initgraph(&gdriver, &gmode, "");
/* read result of initialization */
errorcode = graphresult();
if (errorcode != grOk) /* an error occurred */
{
printf("Graphics error: %s\n", grapherrormsg(errorcode));
printf("Press any key to halt:");
getch();
exit(1); /* return with error code */
}
setbkcolor(5); //for background
rectangle(0, 0, getmaxx(), getmaxy());//to draw border
char ch;
settextstyle(SCRIPT_FONT, HORIZ_DIR, 5);
outtextxy(190,0,"Memory game");
setlinestyle(DOTTED_LINE,1, 1);
line(190,60, 450, 60);
settextstyle(GOTHIC_FONT, HORIZ_DIR, 5);
outtextxy(0,400," PROJECT WORK");
cout<<endl<<endl<<endl<<endl<<endl;
cout<<"\nThis is an activity to test your";
cout<<"\n retention powers and to calculate your memory.";
cout<<"\nAll you have to do is remember the letters displayed and \ntype them correcrly.";
cout<<"\nPlease press \"enter\" to proceed";
cout<<".";
td();cout<<".";
td();cout<<".";
getch(); //to accept enter from the user
do
{
int pt=f1();
while(pt>=1)
{
switch(pt) //to call the appropriate function
{
case 1: pt=f2();
break;
case 2:pt=f3();
break;
case 3:pt=f4();
break;
case 4:pt=f5();
break;
case 5:pt=f6();
break;
case 6:pt=f7();
break;
case 7:pt=f8();
break;
case -1:break;
default:break;
}
}
cleardevice(); //to clean up graphics
setbkcolor(1);
rectangle(0, 0, getmaxx(), getmaxy());
settextstyle(SCRIPT_FONT, HORIZ_DIR, 5);
outtextxy(190,0,"Memory game");
setlinestyle(DOTTED_LINE,1, 1);
line(190,60, 450, 60);
settextstyle(SCRIPT_FONT, HORIZ_DIR, 1);
if(pt==-1) //if loop to display appropriate message
{
outtextxy(0,100,"Your memory is too poor and you have to improve!!!");
getch();
}
else if(pt==-2)
{
outtextxy(0,100,"your memory is below average.But there is some scope for improvement");
getch();
}
else if(pt==-3)
{
outtextxy(0,100,"Your memory level is not satisfactory.So try out some retention excercises");
getch();
}
else if(pt==-4)
{
outtextxy(0,100,"Your memory level is just average.But you can improve!!!");
getch();
}
else if(pt==-5)
{
outtextxy(0,100,"Your memory is average.Most of us cant remember more than this");
getch();
}
else if(pt==-6)
{
outtextxy(0,100,"You have a good memory.But you could have done better!!");
getch();
}
else if(pt==-7)
{
outtextxy(0,100,"You are good in this.EXTRAORDINARY !!!");
getch();
}
else if(pt==-8)
{
outtextxy(0,100,"You are outstanding and its impossible \nfor a normal person.GREAT JOB");
getch();
}
else
{
if(pt==-1) //if loop to display appropriate message
{
outtextxy(0,100,"\n\tYour memory is too poor and \nyou have to improve!!!");
getch();
}
else if(pt==-2)
{
outtextxy(0,100,"\nyour memory is below average.\nBut there is some scope for improvement");
getch();
}
else if(pt==-3)
{
outtextxy(0,100,"\nYour memory level is not satisfactory.\nSo try out some retention excercises");
getch();
}
else if(pt==-4)
{
outtextxy(0,100,"\nYour memory level is just average.\nBut you can improve!!!");
getch();
}
else if(pt==-5)
{
outtextxy(0,100,"\nYour memory is average.\nMost of us cant remember more than this");
getch();
}
else if(pt==-6)
{
outtextxy(0,100,"\nYou have a good memory.\nBut you could have done better!!");
getch();
}
else if(pt==-7)
{
outtextxy(0,100,"\nYou are good in this.EXTRAORDINARY !!!");
getch();
}
else if(pt==-8)
{
outtextxy(0,100,"\nYou are outstanding and its \nimpossible for a normal person.GREAT JOB");
getch();
}
}
clrscr();
cleardevice();
settextstyle(SCRIPT_FONT, HORIZ_DIR, 5);
outtextxy(190,0,"Memory game");
setlinestyle(DOTTED_LINE,1, 1);
line(190,60, 450, 60);
setbkcolor(6);
outtextxy(0,100,"\nPLAY AGAIN??(Y/N):");
cout<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl<<endl;
cin>>ch;
}while(ch=='y'||ch=='Y');
clrscr();
cleardevice();
setbkcolor(1);
int midx=getmaxx()/2;
int midy=getmaxy()/2;
settextstyle(SCRIPT_FONT, HORIZ_DIR, 4);
settextjustify(CENTER_TEXT, CENTER_TEXT);
outtextxy(midx,midy-30,"THANK YOU");
outtextxy(midx,midy,"~~~~~~ ~~~");
outtextxy(midx,midy+30,"PROJECT BY POORNIMA AND DIVYA.S");
outtextxy(midx,midy+60,"~~~~~~~ ~~ ~~~~~~~~ ~~~ ~~~~~~~");
getch();
closegraph(); //close graphics
}
int __cdecl f6(int a1, int a2, int a3, int a4, int a5, int a6)
{ f5(a1, a2, a3, a4, a5); f1(a6); return 0; }
void
PrintHelper::orderedtask_print(OrderedTask& task, const AircraftState &state)
{
abstracttask_print(task, state);
if (!task.stats.task_valid)
return;
std::ofstream fi("results/res-isolines.txt");
for (unsigned i=0; i<task.task_points.size(); i++) {
fi << "## point " << i << "\n";
if (task.task_points[i]->type == TaskPoint::AAT) {
aatpoint_print(fi, (AATPoint&)*task.task_points[i], state,
task.GetTaskProjection(), 1);
} else {
orderedtaskpoint_print(fi,*task.task_points[i],state,1);
}
fi << "\n";
}
std::ofstream f1("results/res-task.txt");
f1 << "#### Task points\n";
for (unsigned i=0; i<task.task_points.size(); i++) {
f1 << "## point " << i << " ###################\n";
if (task.task_points[i]->type == TaskPoint::AAT) {
aatpoint_print(f1, (AATPoint&)*task.task_points[i], state,
task.GetTaskProjection(), 0);
} else {
orderedtaskpoint_print(f1,*task.task_points[i],state,0);
}
f1 << "\n";
}
std::ofstream f5("results/res-ssample.txt");
f5 << "#### Task sampled points\n";
for (unsigned i=0; i<task.task_points.size(); i++) {
f5 << "## point " << i << "\n";
sampledtaskpoint_print_samples(f5,*task.task_points[i],state);
f5 << "\n";
}
std::ofstream f2("results/res-max.txt");
f2 << "#### Max task\n";
for (unsigned i=0; i<task.task_points.size(); i++) {
OrderedTaskPoint *tp = task.task_points[i];
f2 << tp->GetLocationMax().longitude << " "
<< tp->GetLocationMax().latitude << "\n";
}
std::ofstream f3("results/res-min.txt");
f3 << "#### Min task\n";
for (unsigned i=0; i<task.task_points.size(); i++) {
OrderedTaskPoint *tp = task.task_points[i];
f3 << tp->GetLocationMin().longitude << " "
<< tp->GetLocationMin().latitude << "\n";
}
std::ofstream f4("results/res-rem.txt");
f4 << "#### Remaining task\n";
for (unsigned i=0; i<task.task_points.size(); i++) {
OrderedTaskPoint *tp = task.task_points[i];
f4 << tp->GetLocationRemaining().longitude << " "
<< tp->GetLocationRemaining().latitude << "\n";
}
}
int main(void) {
f0();
f1();
f2();
f3();
f4();
f5();
f6();
f7();
f8();
f9();
f10();
f11();
f12();
f13();
f14();
f15();
f16();
f17();
f18();
f19();
f20();
f21();
f22();
f23();
f24();
f25();
f26();
f27();
f28();
f29();
f30();
f31();
f32();
f33();
f34();
f35();
f36();
f37();
f38();
f39();
f40();
f41();
f42();
f43();
f44();
f45();
f46();
f47();
f48();
f49();
f50();
f51();
f52();
f53();
f54();
f55();
f56();
f57();
f58();
f59();
f60();
f61();
f62();
f63();
f64();
f65();
f66();
f67();
f68();
f69();
f70();
f71();
f72();
f73();
f74();
f75();
f76();
f77();
f78();
f79();
f80();
f81();
f82();
f83();
f84();
f85();
f86();
f87();
f88();
f89();
f90();
f91();
f92();
f93();
f94();
f95();
f96();
f97();
f98();
f99();
f100();
f101();
f102();
f103();
f104();
f105();
f106();
f107();
f108();
f109();
f110();
f111();
f112();
f113();
f114();
f115();
f116();
f117();
f118();
f119();
f120();
f121();
f122();
f123();
f124();
f125();
f126();
f127();
f128();
f129();
f130();
f131();
f132();
f133();
f134();
f135();
f136();
f137();
f138();
f139();
f140();
f141();
f142();
f143();
f144();
f145();
f146();
f147();
f148();
f149();
f150();
f151();
f152();
f153();
f154();
f155();
f156();
f157();
f158();
f159();
f160();
f161();
f162();
f163();
f164();
f165();
f166();
f167();
f168();
f169();
f170();
f171();
f172();
f173();
f174();
f175();
f176();
f177();
f178();
f179();
f180();
f181();
f182();
f183();
f184();
f185();
f186();
f187();
f188();
f189();
f190();
f191();
f192();
f193();
f194();
f195();
f196();
f197();
f198();
f199();
return 0;
}
void f6(int a1, int a2, int a3, int a4, int a5, int a6) { f5(a1, a2, a3, a4, a5); f1(a6); }
void
f1 (T4 x)
{
if (!x->j.h->e)
f5 (x);
}
int main() {
typedef adobe::forest<std::string> forest;
typedef forest::iterator iterator;
std::cout << "<- default construction and insert ->" << std::endl;
forest f;
iterator i(f.begin());
i = adobe::trailing_of(f.insert(i, "grandmother"));
{
iterator p(adobe::trailing_of(f.insert(i, "mother")));
f.insert(p, "me");
f.insert(p, "sister");
f.insert(p, "brother");
}
{
iterator p(adobe::trailing_of(f.insert(i, "aunt")));
f.insert(p, "cousin");
}
f.insert(i, "uncle");
output(adobe::depth_range(f));
std::cout << "<- copy construction and reverse ->" << std::endl;
forest f2(f);
iterator f2_grandmother(adobe::find(adobe::preorder_range(f2), "grandmother").base());
f2.reverse(adobe::child_begin(f2_grandmother), adobe::child_end(f2_grandmother));
output(adobe::depth_range(f2));
std::cout << "<- reverse iterator ->" << std::endl;
output(adobe::depth_range(adobe::reverse_fullorder_range(f)));
std::cout << "<- node deletion ->" << std::endl;
forest f3(f);
iterator f3_aunt(adobe::find(adobe::preorder_range(f3), "aunt").base());
iterator f3_uncle(adobe::find(adobe::preorder_range(f3), "uncle").base());
f3.erase(adobe::leading_of(f3_aunt), ++(adobe::trailing_of(f3_uncle)));
output(adobe::depth_range(f3));
std::cout << "<- splicing 1 ->" << std::endl;
forest f4(f);
forest f5(f);
iterator f4_aunt(adobe::find(adobe::preorder_range(f4), "aunt").base());
std::cout << "Size of f4 pre-splice: " << static_cast<unsigned long>(f4.size()) << std::endl;
std::cout << "Size of f5 pre-splice: " << static_cast<unsigned long>(f5.size()) << std::endl;
// Note that because f4_aunt is on the leading edge, the spliced forest's
// top nodes will be siblings to f4_aunt.
f4.splice(f4_aunt, f5);
output(adobe::depth_range(f4));
std::cout << "Size of f4 post-splice: " << static_cast<unsigned long>(f4.size()) << std::endl;
std::cout << "Size of f5 post-splice: " << static_cast<unsigned long>(f5.size()) << std::endl;
std::cout << "<- splicing 2 ->" << std::endl;
forest f6(f);
forest f7(f);
iterator f6_aunt(adobe::find(adobe::preorder_range(f6), "aunt").base());
std::cout << "Size of f6 pre-splice: " << static_cast<unsigned long>(f6.size()) << std::endl;
std::cout << "Size of f7 pre-splice: " << static_cast<unsigned long>(f7.size()) << std::endl;
f6_aunt = adobe::trailing_of(f6_aunt);
// Note that because f6_aunt is on the trailing edge, the spliced forest's
// top nodes will be children to f6_aunt.
f6.splice(f6_aunt, f7);
output(adobe::depth_range(f6));
std::cout << "Size of f6 post-splice: " << static_cast<unsigned long>(f6.size()) << std::endl;
std::cout << "Size of f7 post-splice: " << static_cast<unsigned long>(f7.size()) << std::endl;
return 0;
}
int main() {
// Variable for testing stack integrity.
int stackCheckVar = 987654321;
stackCheckVarLoc = &stackCheckVar;
// Functions decay to function pointers
{
int r = (*f1)(19);
out(r == 38);
r = (&f1)(27);
out(r == 54);
r = (&**&**&f1)(31);
out(r == 62);
}
// Calling through a function pointer
{
int (*p)(int) = &f1;
int r = p(6);
out(r == 12);
r = (*p)(8);
out(r == 16);
}
// Assigning function pointers
{
int (*p)(int);
p = &f1;
int r = (*p)(7);
out(r == 14);
p = f1;
r = (*p)(8);
out(r == 16);
p = 0;
out(p == 0);
}
// Null pointer evaluates to false
{
int (*p)(int) = 0;
int ok = 1;
if (p)
ok = 0;
out(ok);
}
// Non-null pointer evaluates to true
{
int (*p)(int) = &f1;
int ok = 0;
if (p)
ok = 1;
out(ok);
}
// Comparing function pointers
{
int (*(*p1)(int))(int) = &f2;
int (*(*p2)(int))(int) = &f3;
int (*(*p3)(int))(int) = 0;
out((p1 == p1) == 1);
out((p1 == p2) == 0);
out((p1 == p3) == 0);
out((p1 != p1) == 0);
out((p1 != p2) == 1);
out((p1 != p3) == 1);
}
// Function pointer as parameter and return value
{
int (*p)(int);
p = f4(&f1);
out((*p)(9) == 18);
}
// File scope function pointers initialized to null pointer
{
out(p1 == 0);
out(pa[0] == 0);
out(pa[1] == 0);
}
// Parameter type adjustment
{
int a[2];
a[0] = -15;
a[1] = 15;
int (*b)(int) = &f1;
int r = f5(a, b);
out(r);
}
// Stack integrity checks.
out(stackCheckVar == 987654321);
out(&stackCheckVar == stackCheckVarLoc);
return 0;
}
int main(void) {
f0();
f1();
f2();
f3();
f4();
f5();
f6();
f7();
f8();
f9();
f10();
f11();
f12();
f13();
f14();
f15();
f16();
f17();
f18();
f19();
f20();
f21();
f22();
f23();
f24();
f25();
f26();
f27();
f28();
f29();
f30();
f31();
f32();
f33();
f34();
f35();
f36();
f37();
f38();
f39();
f40();
f41();
f42();
f43();
f44();
f45();
f46();
f47();
f48();
f49();
f50();
f51();
f52();
f53();
f54();
f55();
f56();
f57();
f58();
f59();
f60();
f61();
f62();
f63();
f64();
f65();
f66();
f67();
f68();
f69();
f70();
f71();
f72();
f73();
f74();
f75();
f76();
f77();
f78();
f79();
f80();
f81();
f82();
f83();
f84();
f85();
f86();
f87();
f88();
f89();
f90();
f91();
f92();
f93();
f94();
return 0;
}
void f8(char **a, char **b) {
f3(a, b);
f5(a, b);
}
void f4() { f5(); }
void entry_point(void) {
int *p = f5();
g5(p);
}
void TabulatorTet<Scalar,ArrayScalar,0>::tabulate( ArrayScalar &outputValues ,
const int deg ,
const ArrayScalar &z )
{
const int np = z.dimension( 0 );
int idxcur;
// each point needs to be transformed from Pavel's element
// z(i,0) --> (2.0 * z(i,0) - 1.0)
// z(i,1) --> (2.0 * z(i,1) - 1.0)
// z(i,2) --> (2.0 * z(i,2) - 1.0)
Teuchos::Array<Scalar> f1(np),f2(np),f3(np),f4(np),f5(np);
for (int i=0;i<np;i++) {
f1[i] = 0.5 * ( 2.0 + 2.0*(2.0*z(i,0)-1.0) + (2.0*z(i,1)-1.0) + (2.0*z(i,2)-1.0) );
Scalar foo = 0.5 * ( (2.0*z(i,1)-1.0) + (2.0*z(i,2)-1.0) );
f2[i] = foo * foo;
f3[i] = 0.5 * ( 1.0 + 2.0 * (2.0*z(i,1)-1.0) + (2.0*z(i,2)-1.0) );
f4[i] = 0.5 * ( 1.0 - (2.0*z(i,2)-1.0) );
f5[i] = f4[i] * f4[i];
}
// constant term
idxcur = TabulatorTet<Scalar,ArrayScalar,0>::idx(0,0,0);
for (int i=0;i<np;i++) {
outputValues(idxcur,i) = 1.0 + z(i,0) - z(i,0) + z(i,1) - z(i,1) + z(i,2) - z(i,2);
}
if (deg > 0) {
// D^{1,0,0}
idxcur = TabulatorTet<Scalar,ArrayScalar,0>::idx(1,0,0);
for (int i=0;i<np;i++) {
outputValues(idxcur,i) = f1[i];
}
// p recurrence
for (int p=1;p<deg;p++) {
Scalar a1 = (2.0 * p + 1.0) / ( p + 1.0);
Scalar a2 = p / ( p + 1.0 );
int idxp = TabulatorTet<Scalar,ArrayScalar,0>::idx(p,0,0);
int idxpp1 = TabulatorTet<Scalar,ArrayScalar,0>::idx(p+1,0,0);
int idxpm1 = TabulatorTet<Scalar,ArrayScalar,0>::idx(p-1,0,0);
for (int i=0;i<np;i++) {
outputValues(idxpp1,i) = a1 * f1[i] * outputValues(idxp,i) - a2 * f2[i] * outputValues(idxpm1,i);
}
}
// q = 1
for (int p=0;p<deg;p++) {
int idx0 = TabulatorTet<Scalar,ArrayScalar,0>::idx(p,0,0);
int idx1 = TabulatorTet<Scalar,ArrayScalar,0>::idx(p,1,0);
for (int i=0;i<np;i++) {
outputValues(idx1,i) = outputValues(idx0,i) * ( p * ( 1.0 + (2.0*z(i,1)-1.0) ) +
0.5 * ( 2.0 + 3.0 * (2.0*z(i,1)-1.0) + (2.0*z(i,2)-1.0) ) );
}
}
// q recurrence
for (int p=0;p<deg-1;p++) {
for (int q=1;q<deg-p;q++) {
Scalar aq,bq,cq;
TabulatorTet<Scalar,ArrayScalar,0>::jrc(2.0*p+1.0 ,0 ,q, aq, bq, cq);
int idxpqp1 = TabulatorTet<Scalar,ArrayScalar,0>::idx(p,q+1,0);
int idxpq = TabulatorTet<Scalar,ArrayScalar,0>::idx(p,q,0);
int idxpqm1 = TabulatorTet<Scalar,ArrayScalar,0>::idx(p,q-1,0);
for (int i=0;i<np;i++) {
outputValues(idxpqp1,i) = ( aq * f3[i] + bq * f4[i] ) * outputValues(idxpq,i)
- ( cq * f5[i] ) * outputValues(idxpqm1,i);
}
}
}
// r = 1
for (int p=0;p<deg;p++) {
for (int q=0;q<deg-p;q++) {
int idxpq1 = TabulatorTet<Scalar,ArrayScalar,0>::idx(p,q,1);
int idxpq0 = TabulatorTet<Scalar,ArrayScalar,0>::idx(p,q,0);
for (int i=0;i<np;i++) {
outputValues(idxpq1,i) = outputValues(idxpq0,i) * ( 1.0 + p + q + ( 2.0 + q +
p ) * (2.0*z(i,2)-1.0) );
}
}
}
// general r recurrence
for (int p=0;p<deg-1;p++) {
for (int q=0;q<deg-p-1;q++) {
for (int r=1;r<deg-p-q;r++) {
Scalar ar,br,cr;
int idxpqrp1 = TabulatorTet<Scalar,ArrayScalar,0>::idx(p,q,r+1);
int idxpqr = TabulatorTet<Scalar,ArrayScalar,0>::idx(p,q,r);
int idxpqrm1 = TabulatorTet<Scalar,ArrayScalar,0>::idx(p,q,r-1);
jrc(2.0*p+2.0*q+2.0, 0.0, r, ar, br, cr);
for (int i=0;i<np;i++) {
outputValues(idxpqrp1,i) = (ar * (2.0*z(i,2)-1.0) + br) * outputValues( idxpqr , i ) - cr * outputValues(idxpqrm1,i);
}
}
}
}
}
// normalize
for (int p=0;p<=deg;p++) {
for (int q=0;q<=deg-p;q++) {
for (int r=0;r<=deg-p-q;r++) {
int idxcur = TabulatorTet<Scalar,ArrayScalar,0>::idx(p,q,r);
Scalar scal = sqrt( (p+0.5)*(p+q+1.0)*(p+q+r+1.5) );
for (int i=0;i<np;i++) {
outputValues(idxcur,i) *= scal;
}
}
}
}
return;
}
void plot(char* h, bool norm2data, TString prefix, TString RR) {
TFile f1(prefix+"DATA"+RR+"CP.root", "read");
TH1D* hdata = (TH1D*)f1.Get(h);
hdata->SetDirectory(0);
TFile f2(prefix+"DYM_CP.root", "read");
TH1D* hsignal = (TH1D*)f2.Get(TString(h));
hsignal->SetDirectory(0);
TFile f3(prefix+"QCD_CP_dd.root", "read");
TH1D* hqcd = (TH1D*)f3.Get("hqcd");
hqcd->SetDirectory(0);
TFile f3_mc(prefix+"QCD_CP.root", "read");
TH1D* hqcd_mc = (TH1D*)f3_mc.Get(h);
hqcd_mc->SetDirectory(0);
//FIXME
cout << "See the implementation in 2D case!" << endl;
TFile f4(prefix+"TT_CP.root", "read");
TH1D* httbar = (TH1D*)f4.Get(h); //"httbar");
httbar->SetDirectory(0);
TFile f4_mc(prefix+"TT_CP.root", "read");
TH1D* httbar_mc = (TH1D*)f4_mc.Get(h);
httbar_mc->SetDirectory(0);
TFile f5(prefix+"TAU_CP.root", "read");
TH1D* hZtautau = (TH1D*)f5.Get(h);
hZtautau->SetDirectory(0);
TFile f6(prefix+"EWK_CP.root", "read");
TH1D* hWleptonnu = (TH1D*)f6.Get(h);
hWleptonnu->SetDirectory(0);
TFile f7(prefix+"DIBOSON_CP.root", "read");
TH1D* hDibosons = (TH1D*)f7.Get(h);
hDibosons->SetDirectory(0);
gStyle->SetOptStat(0);
gStyle->SetPalette(1);
gROOT->ProcessLine(".L ../tools/setTDRStyle.C");
setTDRStyle();
gROOT->SetStyle("tdrStyle");
gROOT->ForceStyle(true);
// signal
hsignal->SetLineColor(kOrange);
hsignal->SetFillColor(kOrange);
// qcd
hqcd->SetLineColor(9);
hqcd->SetFillColor(9);
// tt
httbar->SetLineColor(kRed+2);
httbar->SetFillColor(kRed+2);
// tau
hZtautau->SetLineColor(kGreen);
hZtautau->SetFillColor(kGreen);
// EWK
hWleptonnu->SetLineColor(38);
hWleptonnu->SetFillColor(38);
//hupsilon->SetLineColor(51);
//hupsilon->SetFillColor(51);
// diboson
hDibosons->SetLineColor(40);
hDibosons->SetFillColor(40);
//
//The histograms come properly weighted with priors
//This would normalize to number of events in data
//
if (norm2data) {
const double ttbarNorm = httbar->Integral();
const double WleptonnuNorm = hWleptonnu->Integral();
const double ZtautauNorm = hZtautau->Integral();
const double qcdNorm = hqcd_mc->Integral();
const double dibosonNorm = hDibosons->Integral();
const double signalNorm = hsignal->Integral();
const double fullMCintegral = ttbarNorm+WleptonnuNorm+ZtautauNorm+qcdNorm+dibosonNorm+signalNorm;
httbar->Scale(hdata->Integral()/fullMCintegral);
hWleptonnu->Scale(hdata->Integral()/fullMCintegral);
hZtautau->Scale(hdata->Integral()/fullMCintegral);
hqcd_mc->Scale(hdata->Integral()/fullMCintegral);
hsignal->Scale(hdata->Integral()/fullMCintegral);
hDibosons->Scale(hdata->Integral()/fullMCintegral);
normalizeToPeak(httbar, hWleptonnu, hqcd_mc, hZtautau, hsignal, hDibosons, hdata);
} else {
//Just do not normalize, for utility purposes, not for the analysis
}
// mc
TH1D* hmc = (TH1D*)hsignal->Clone();
hmc->Add(hqcd_mc);
//hmc->Add(hupsilon);
hmc->Add(httbar);
hmc->Add(hZtautau);
hmc->Add(hWleptonnu);
hmc->Add(hDibosons);
//set up ratio check
TH1D* hratio = (TH1D*)httbar->Clone();
FindRatio(hratio,hdata,hmc);
THStack* hstack = new THStack("hstack", "hstack");
//hstack->Add(hupsilon);
hstack->Add(hWleptonnu);
hstack->Add(hDibosons);
hstack->Add(httbar);
hstack->Add(hZtautau);
hstack->Add(hqcd_mc);
hstack->Add(hsignal);
std::ostringstream pprint;
//add to stack
TH1D* hstack4fit = (TH1D*)hsignal->Clone();
//hstack->Add(hupsilon);
hstack4fit->Add(hWleptonnu);
hstack4fit->Add(hDibosons);
hstack4fit->Add(httbar);
hstack4fit->Add(hZtautau);
hstack4fit->Add(hqcd_mc);
//save important histograms
TFile* f = new TFile(prefix+"stack4fit_analyse"+TString(h)+RR+"CP.root","recreate");
f->cd();
//resetHisto(hstack4fit);
hmc->SetName("hmc");
hmc->Write();
hstack4fit->SetName("stack4fit");
hstack4fit->Write();
//resetHisto(hsignal);
hsignal->SetName("hsig_fewz");
hsignal->SetTitle("hsig_fewz");
hsignal->Write();
//resetHisto(hqcd);
hqcd->SetName("hqcd");
hqcd->SetTitle("hqcd_dd");
hqcd->Write();
//resetHisto(hqcd_mc);
hqcd_mc->SetName("hqcd_mc");
hqcd_mc->SetTitle("hqcd_mc");
hqcd_mc->Write();
//resetHisto(hZtautau);
hZtautau->SetName("hDYtautau");
hZtautau->SetTitle("hDYtautau");
hZtautau->Write();
//resetHisto(hWleptonnu);
cout << "hWleptonnu norm " << hWleptonnu->Integral() << endl;
hWleptonnu->SetName("hWlepton");
hWleptonnu->SetTitle("hWlepton");
hWleptonnu->Write();
//resetHisto(hDibosons);
hDibosons->SetName("hdiboson");
hDibosons->SetTitle("hdiboson");
hDibosons->Write();
//resetHisto(httbar);
httbar->SetName("httbar");
httbar->SetTitle("httbar_dd");
httbar->Write();
//resetHisto(httbar_mc);
httbar_mc->SetName("httbar_mc");
httbar_mc->SetTitle("httbar_mc");
httbar_mc->Write();
//resetHisto(hdata);
hdata->SetName("hdata");
hdata->SetTitle("hdata");
hdata->Write();
f->Close();
}
static void
avx2_test (void)
{
int i;
for (i = 0; i < N + 16; i++)
{
asm ("");
vf1[i] = 17.0f + i;
vd1[i] = 19.0 + i;
}
for (i = 0; i < N; i++)
{
asm ("");
k[i] = (i * 731) & (N - 1);
l[i] = (i * 657) & (N - 1);
}
f1 ();
f2 ();
for (i = 0; i < N; i++)
if (vf2[i] != ((i * 731) & (N - 1)) + 17
|| n[i] != ((i * 731) & (N - 1)) + 17)
abort ();
f3 (12);
f4 (14);
for (i = 0; i < N; i++)
if (vf2[i] != ((i * 731) & (N - 1)) + 17 + 12
|| n[i] != ((i * 731) & (N - 1)) + 17 + 14)
abort ();
f5 ();
f6 ();
for (i = 0; i < N; i++)
if (vd2[i] != ((i * 731) & (N - 1)) + 19
|| n[i] != ((i * 731) & (N - 1)) + 19)
abort ();
f7 (7);
f8 (9);
for (i = 0; i < N; i++)
if (vd2[i] != ((i * 731) & (N - 1)) + 19 + 7
|| n[i] != ((i * 731) & (N - 1)) + 19 + 9)
abort ();
f9 ();
f10 ();
for (i = 0; i < N; i++)
if (vf2[i] != ((i * 657) & (N - 1)) + 17
|| n[i] != ((i * 657) & (N - 1)) + 17)
abort ();
f11 (2);
f12 (4);
for (i = 0; i < N; i++)
if (vf2[i] != ((i * 657) & (N - 1)) + 17 + 2
|| n[i] != ((i * 657) & (N - 1)) + 17 + 4)
abort ();
f13 ();
f14 ();
for (i = 0; i < N; i++)
if (vd2[i] != ((i * 657) & (N - 1)) + 19
|| n[i] != ((i * 657) & (N - 1)) + 19)
abort ();
f15 (13);
f16 (15);
for (i = 0; i < N; i++)
if (vd2[i] != ((i * 657) & (N - 1)) + 19 + 13
|| n[i] != ((i * 657) & (N - 1)) + 19 + 15)
abort ();
}
