本文整理汇总了C++中Student::Finalize方法的典型用法代码示例。如果您正苦于以下问题：C++ Student::Finalize方法的具体用法？C++ Student::Finalize怎么用？C++ Student::Finalize使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类Student的用法示例。
在下文中一共展示了Student::Finalize方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: GradeCorrelation
void GradeCorrelation(double prob = 0.10, int nCut = 50) {
std::cout << "Starting Grade Correlation..." << std::endl;
TBenchmark* myBenchmark = new TBenchmark();
myBenchmark->Start("NormMap");
// Get the student TTree prepared in another macro.
if (MyFunctions::gradeNormMap.size() == 0)
MyFunctions::BuildGradeNormMap();
myBenchmark->Stop("NormMap");
std::cout << "Made GradeNormMap..." << std::endl;
// Just a quick look at the data in the Students TTree
TFile* f = new TFile("Students.root");
TTree* studentTree = (TTree*)f->Get("Students");
Student* student = 0;
studentTree->SetBranchAddress("student", &student);
Long64_t nentries = studentTree->GetEntriesFast();
std::cout << "Entries in Students TTree = " << nentries << std::endl;
// We want to loop over students and look at pairs of courses taken in different semesters to see if there is
// any correlation between graede performance.
std::map<std::pair<TString, TString>, CorrelationCalculator> corrMap;
// nentries = 1000;
myBenchmark->Start("Main Loop");
int nPairAll = 0;
for (Long64_t jentry = 0; jentry < nentries; ++jentry) {
studentTree->GetEntry(jentry);
if (jentry % 1000 == 0)
std::cout << "At student " << jentry << std::endl;
// std::cout << "Looking at student " << student->Id() << std::endl;
student->Finalize(); // Regenerates non-persisted references
int nTerms = student->Enrollments().size();
// std::cout << "nTerms = " << nTerms << std::endl;
for (int iTerm = 0; iTerm < nTerms - 1; ++iTerm) {
const Student::Enrollment iEnrollment = student->Enrollments()[iTerm];
if (!MyFunctions::regularSemester(iEnrollment.term)) continue;
for (Student::Grade iGrade : iEnrollment.grades) {
if (!MyFunctions::ValidGrade(iGrade.grade)) continue;
// Get a prediction for this grade using norm-corrected grades
// std::cout << "1" << std::endl;
double prediction_i = student->CourseGradePrediction(iGrade, Student::DISTRIBUTION);
// std::cout << "2" << std::endl;
double delta_i = iGrade.quality - prediction_i;
// Find next regular term only
bool foundRegTerm = false;
for (int jTerm = iTerm + 1; jTerm < nTerms && !foundRegTerm; ++jTerm) {
const Student::Enrollment jEnrollment = student->Enrollments()[jTerm];
if (!MyFunctions::regularSemester(jEnrollment.term)) continue;
foundRegTerm = true;
for (Student::Grade jGrade : jEnrollment.grades) {
if (jGrade.course == iGrade.course) continue;
if (!MyFunctions::ValidGrade(jGrade.grade)) continue;
double prediction_j = student->CourseGradePrediction(jGrade, Student::DISTRIBUTION);
double delta_j = jGrade.quality - prediction_j;
corrMap[std::make_pair(iGrade.course, jGrade.course)].Add(delta_i, delta_j);
++nPairAll;
}
}
}
}
}
myBenchmark->Stop("Main Loop");
std::cout << "nPairAll = " << nPairAll << std::endl;
std::cout << "Unique Pairs = " << corrMap.size() << std::endl;
TH1D* rHist = new TH1D("rHist", "Correlation Coefficient, #rho", 120, -1.2, 1.2);
TH1D* pHist = new TH1D("pHist", "Probablity Distribution", 100, 0., 1.);
TH1D* nHist = new TH1D("nHist", "Number of entries", 100, 0., 2000.);
TH2D* pVrHist = new TH2D("pVrHist", "Prob vs. #rho", 100, -1., 1., 100, 0., 1.);
myBenchmark->Start("Prune");
for (auto iter = corrMap.begin(); iter != corrMap.end();) {
if (iter->second.n() < nCut) {
corrMap.erase(iter++);
continue;
}
double p = iter->second.p();
double r = iter->second.r();
// Test for nan?
if (p != p) {
std::cout << "Found p = nan: n = " << iter->second.n() << std::endl;
corrMap.erase(iter++);
continue;
}
if (p < 0.) {
//.........这里部分代码省略.........