/* This file is part of MAUS: http://micewww.pp.rl.ac.uk:8080/projects/maus * * MAUS is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * MAUS is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with MAUS. If not, see . * */ #include #include #include #include #include #include #include #include #include "float.h" #include "TLorentzVector.h" #include "TRandom3.h" #include "gtest/gtest.h" #include "Recon/Global/PIDVarH.hh" TEST(PIDVarHTestSetUp, TestSetUpAndTearDown) { MAUS::recon::global::PIDVarH *testPIDVarH = NULL; ASSERT_NO_THROW(testPIDVarH = new MAUS::recon::global::PIDVarH("test", "test")); std::string testfile = testPIDVarH->Get_filename(); std::string testdir = testPIDVarH->Get_directory(); ASSERT_NO_THROW(delete testPIDVarH); EXPECT_EQ(gSystem->Unlink(testfile.c_str()), 0); // Unlink dir does not seem to work on some systems // suspect NFS mounts or stale handles // force system removal // std::string rmdirCmd = "rm -fr "; // rmdirCmd += testdir.c_str(); // EXPECT_EQ(system(rmdirCmd.c_str()), 0); } class PIDVarHTest : public ::testing::Test { virtual void SetUp() { MAUS::recon::global::PIDVarH testPIDVarH("test", "test"); testfile = testPIDVarH.Get_filename(); testdir = testPIDVarH.Get_directory(); TRandom3 r; for (int i = 0; i < 1000; i++) { MAUS::DataStructure::Global::Track* testTrack = new MAUS::DataStructure::Global::Track(); MAUS::DataStructure::Global::TrackPoint* tpTracker = new MAUS::DataStructure::Global::TrackPoint(); tpTracker->set_detector(MAUS::DataStructure::Global::kTracker1_1); MAUS::DataStructure::Global::TrackPoint* tpEMR = new MAUS::DataStructure::Global::TrackPoint(); double emr_density = r.Gaus(0.5, 0.001); testTrack->set_emr_plane_density(emr_density); double px = 0.0; double py = 0.0; double pz = 200.0; double E = 226.0; TLorentzVector tpTrackerMom(px, py, pz, E); tpTracker->set_momentum(tpTrackerMom); tpTracker->set_mapper_name("MapCppGlobalTrackMatching-Through"); testTrack->AddTrackPoint(tpTracker); tpEMR->set_mapper_name("MapCppGlobalTrackMatching-Through"); tpEMR->set_detector(MAUS::DataStructure::Global::kEMR); testTrack->AddTrackPoint(tpEMR); testTrack->set_mapper_name("MapCppGlobalTrackMatching-Through"); testTracks.push_back(testTrack); } } virtual void TearDown() { gSystem->Unlink(testfile.c_str()); gSystem->Unlink(testdir.c_str()); } public: bool fileExists(std::string filename) { TFile f(filename.c_str(), "READ"); return !f.IsZombie(); } bool IsFiniteNumber(double x) { return (x <= DBL_MAX && x >= -DBL_MAX); } std::string testfile; std::string testdir; TFile *file; TH2F *hist; std::string histname; std::vector testTracks; }; TEST_F(PIDVarHTest, CreateFileConstructor) { ASSERT_TRUE(fileExists(testfile)); } TEST_F(PIDVarHTest, ReadFileConstructor) { file = new TFile(testfile.c_str(), "READ"); ASSERT_TRUE(file); ASSERT_FALSE(file->IsZombie()); ASSERT_NO_THROW(MAUS::recon::global::PIDVarH testPIDVarH(file, "test", 50, 350, 0, 1)); ASSERT_ANY_THROW(MAUS::recon::global::PIDVarH testPIDVarH(NULL, "test", 50, 350, 0, 1)); ASSERT_ANY_THROW(MAUS::recon::global::PIDVarH testPIDVarH(file, "sasquatch", 50, 350, 0, 1)); } /* N.B. if either FillHist or LogL are failing, check the values of min and max * bins in PIDVarH.hh, as if the testTracks fall outside of this range FillHist * and LogL will fail. */ TEST_F(PIDVarHTest, FillHist) { MAUS::recon::global::PIDVarH testPIDVarH("test", "test"); for (int i = 0; i < 1000; i++) { testPIDVarH.Fill_Hist(testTracks[i]); } testfile = testPIDVarH.Get_filename(); testdir = testPIDVarH.Get_directory(); // check histogram exists hist = testPIDVarH.Get_hist(); ASSERT_TRUE(hist); // check number of entries ASSERT_EQ(1000, hist->GetEntries()); } TEST_F(PIDVarHTest, LogL) { // Constructor called within parentheses so that destructor will be // called when it goes out of scope { MAUS::recon::global::PIDVarH writetestPIDVarH("test", "test"); for (int i = 0; i < 1000; i++) { writetestPIDVarH.Fill_Hist(testTracks[i]); } testfile = writetestPIDVarH.Get_filename(); testdir = writetestPIDVarH.Get_directory(); } MAUS::DataStructure::Global::Track* checkTrack = new MAUS::DataStructure::Global::Track(); MAUS::DataStructure::Global::TrackPoint* ctpTracker = new MAUS::DataStructure::Global::TrackPoint(); ctpTracker->set_detector(MAUS::DataStructure::Global::kTracker1_1); double px = 0.0; double py = 0.0; double pz = 200.0; double E = 226.0; TLorentzVector ctpTrackerMom(px, py, pz, E); ctpTracker->set_momentum(ctpTrackerMom); MAUS::DataStructure::Global::TrackPoint* ctpEMR = new MAUS::DataStructure::Global::TrackPoint(); ctpEMR->set_detector(MAUS::DataStructure::Global::kCalorimeter); double emr_density = 0.5; checkTrack->set_emr_plane_density(emr_density); ctpEMR->set_detector(MAUS::DataStructure::Global::kEMR); ctpEMR->set_mapper_name("MapCppGlobalTrackMatching-Through"); checkTrack->AddTrackPoint(ctpEMR); ctpTracker->set_mapper_name("MapCppGlobalTrackMatching-Through"); checkTrack->AddTrackPoint(ctpTracker); checkTrack->set_mapper_name("MapCppGlobalTrackMatching-Through"); file = new TFile(testfile.c_str(), "READ"); ASSERT_TRUE(file); ASSERT_FALSE(file->IsZombie()); ASSERT_NO_THROW(MAUS::recon::global::PIDVarH readtestPIDVarH(file, "test", 50, 350, 0, 1)); MAUS::recon::global::PIDVarH readtestPIDVarH(file, "test", 50, 350, 0, 1); hist = readtestPIDVarH.Get_hist(); ASSERT_TRUE(hist); // check number of entries in histogram // NB as destructor was called above, the number of entries in the histogram // will be increased by the number of bins (inc over and underflow) as in // PIDVarH the behaviour to add one event across all bins is turned on. ASSERT_EQ((1000 + hist->GetSize()), hist->GetEntries()); double prob = readtestPIDVarH.logL(checkTrack); ASSERT_LE(prob, 0); ASSERT_TRUE(IsFiniteNumber(prob)); }