#include <TestProposal.h>
Definition at line 12 of file TestProposal.h.
TestProposal::TestProposal |
( |
| ) |
|
|
inline |
Definition at line 15 of file TestProposal.h.
15 : RooStats::ProposalFunction() {}
TestProposal::TestProposal |
( |
double |
divisor, |
|
|
const RooRealVar * |
alwaysStepMe = 0 |
|
) |
| |
Definition at line 9 of file TestProposal.cc.
References alwaysStepMe_.
10 RooStats::ProposalFunction(),
ClassDef(TestProposal, 1) private RooArgList alwaysStepMe_
TestProposal::TestProposal |
( |
double |
divisor, |
|
|
const RooArgList & |
alwaysStepMe |
|
) |
| |
Definition at line 17 of file TestProposal.cc.
References mathSSE::sqrt().
18 RooStats::ProposalFunction(),
20 poiDivisor_(divisor_),
23 if (alwaysStepMe.getSize() > 1) poiDivisor_ /=
sqrt(
double(alwaysStepMe.getSize()));
ClassDef(TestProposal, 1) private RooArgList alwaysStepMe_
virtual TestProposal::~TestProposal |
( |
| ) |
|
|
inlinevirtual |
Double_t TestProposal::GetProposalDensity |
( |
RooArgSet & |
x1, |
|
|
RooArgSet & |
x2 |
|
) |
| |
|
virtual |
Bool_t TestProposal::IsSymmetric |
( |
RooArgSet & |
x1, |
|
|
RooArgSet & |
x2 |
|
) |
| |
|
virtual |
void TestProposal::Propose |
( |
RooArgSet & |
xPrime, |
|
|
RooArgSet & |
x |
|
) |
| |
|
virtual |
Definition at line 28 of file TestProposal.cc.
References alwaysStepMe_, i, j, max(), min, n, and NULL.
30 RooStats::SetParameters(&
x, &xPrime);
31 RooLinkedListIter it(xPrime.iterator());
33 int n = xPrime.getSize(),
j = floor(RooRandom::uniform()*n);
34 for (
int i = 0; (var = (RooRealVar*)it.Next()) !=
NULL; ++
i) {
37 double val = var->getVal(),
max = var->getMax(),
min = var->getMin(), len =
max -
min;
38 val += RooRandom::gaussian() * len * divisor_;
39 while (val >
max) val -= len;
40 while (val < min) val += len;
46 for (RooRealVar *poi = (RooRealVar*)it.Next(); poi !=
NULL; poi = (RooRealVar*)it.Next()) {
47 RooRealVar *var = (RooRealVar*) xPrime.find(poi->GetName());
48 double val = var->getVal(),
max = var->getMax(), min = var->getMin(), len =
max -
min;
49 val += RooRandom::gaussian() * len * poiDivisor_;
50 while (val >
max) val -= len;
51 while (val < min) val += len;
ClassDef(TestProposal, 1) private RooArgList alwaysStepMe_
const T & max(const T &a, const T &b)