58 fLower =
new std::vector<Double_t>( l->size() );
59 fUpper =
new std::vector<Double_t>( u->size() );
62 for (
UInt_t ivar=0; ivar<l->size(); ivar++) {
63 (*fLower)[ivar] =
Double_t((*l)[ivar]);
64 (*fUpper)[ivar] =
Double_t((*u)[ivar]);
73 fLower =
new std::vector<Double_t>( nvar );
74 fUpper =
new std::vector<Double_t>( nvar );
77 for (
int ivar=0; ivar<nvar; ivar++) {
78 (*fLower)[ivar] = l[ivar];
79 (*fUpper)[ivar] = u[ivar];
88 fLower =
new std::vector<Double_t>( nvar );
89 fUpper =
new std::vector<Double_t>( nvar );
92 for (
int ivar=0; ivar<nvar; ivar++) {
103 fLower =
new std::vector<Double_t>(1);
104 fUpper =
new std::vector<Double_t>(1);
115 fLower =
new std::vector<Double_t>(1);
116 fUpper =
new std::vector<Double_t>(1);
167 (*fLower)[ivar] = lo;
168 (*fUpper)[ivar] = up;
179 fLogger << kINFO <<
"... Volume: var: " << ivar <<
"\t(fLower, fUpper) = (" 180 << (*fLower)[ivar] <<
"\t " << (*fUpper)[ivar] <<
")"<<
Endl;
std::vector< Double_t > * fLower
void Delete(void)
delete array of volume bondaries
MsgLogger & Endl(MsgLogger &ml)
std::vector< Double_t > * fUpper
void ScaleInterval(Double_t f)
"scale" the volume by symmetrically blowing up the interval in each dimension
Volume for BinarySearchTree.
virtual ~Volume(void)
destructor
void Print(void) const
printout of the volume boundaries
void Scale(Double_t f)
"scale" the volume by multiplying each upper and lower boundary by "f"
Volume(std::vector< Float_t > *l, std::vector< Float_t > *u=0)
constructor specifying the volume by std::vectors of floats
ostringstream derivative to redirect and format output