12 for (
unsigned int t = 0;
t < pls.size(); ++
t) {
13 std::vector<std::shared_ptr<TFormula> >
temp;
14 for (
unsigned int i = 0;
i < (pls[
t].formulas()).
size(); ++
i) {
17 std::shared_ptr<TFormula>
tt(
new TFormula(formulaUniqueName.c_str(),
tmp.formulas()[
i].c_str()));
21 compiledFormulas_.push_back(
temp);
30 if (!isInPayload(
r,
p)) {
31 throw cms::Exception(
"MalformedPerfPayload") <<
"Requested performance data not available!";
36 throw cms::Exception(
"MalformedPerfPayload") <<
"Requested variable does not match internal structure!";
39 return compiledFormulas_[
region][resultPos(
r)];
48 if (!isInPayload(
r,
p))
55 const std::shared_ptr<TFormula>&
formula = getFormula(
r,
p);
59 std::vector<BinningVariables::BinningVariablesType>
t = myBinning();
64 for (std::vector<BinningVariables::BinningVariablesType>::const_iterator it =
t.begin(); it !=
t.end(); ++it, ++
i) {
81 for (
unsigned int ti = 0; ti < pls.size(); ++ti) {
83 std::vector<BinningVariables::BinningVariablesType>
t = myBinning();
84 for (std::vector<BinningVariables::BinningVariablesType>::const_iterator it =
t.begin(); it !=
t.end(); ++it) {
88 if (!
p.isKeyAvailable(*it))
90 float v =
p.value(*it);
91 int pos = limitPos(*it);
92 std::pair<float, float>
limits = (pls[ti].limits())[
pos];
93 if (v < limits.first || v >
limits.second)
110 unsigned int whocares;
111 if (!isOk(
point, whocares))
122 cout <<
"Warning: result not available!" << endl;
127 unsigned int whichone;
128 isOk(
point, whichone);
129 cout <<
"-- Formula: " <<
formula->GetExpFormula(
"p") << endl;
132 std::vector<BinningVariables::BinningVariablesType>
t = myBinning();
134 for (std::vector<BinningVariables::BinningVariablesType>::const_iterator it =
t.begin(); it !=
t.end(); ++it) {
135 int pos = limitPos(*it);
136 std::pair<float, float>
limits = (pls[whichone].limits())[
pos];
137 cout <<
" Variable: " << *it <<
" with limits: "
138 <<
"from: " <<
limits.first <<
" to: " <<
limits.second << endl;