63   return fInterval->GetElement( 
Int_t(
value*fNbins) );
 
 
   78   if (fInterval->GetNbins() > 0) {   
 
   79      return RandomDiscrete();
 
   81   else if (fFrom == fTo) {
 
   88      else return ReMap( 
ret );
 
   90   return fRandomGenerator->Uniform(fFrom, fTo);
 
 
   98   if (fFrom >= fTo ) 
return val;
 
   99   if (val < fFrom ) 
return ReMap( (val-fFrom) + fTo );
 
  100   if (val >= fTo )    
return ReMap( (val-fTo) + fFrom );
 
 
  109   if (fFrom >= fTo ) 
return val;
 
  110   if (val < fFrom  ) 
return ReMap( fFrom - (val-fFrom) );
 
  111   if (val >= fTo   ) 
return ReMap( fTo - (val-fTo)  );
 
 
ROOT::Detail::TRangeCast< T, true > TRangeDynCast
TRangeDynCast is an adapter class that allows the typed iteration through a TCollection.
Option_t Option_t TPoint TPoint const char GetTextMagnitude GetFillStyle GetLineColor GetLineWidth GetMarkerStyle GetTextAlign GetTextColor GetTextSize void value
Range definition for genetic algorithm.
virtual ~GeneticRange()
destructor
Double_t fTotalLength
the distance between the lower and upper constraints
GeneticRange(TRandom3 *rnd, Interval *interval)
defines the "f" (from) and "t" (to) of the coefficient and takes a randomgenerator
Double_t ReMap(Double_t val)
remapping the value to the allowed space
Interval * fInterval
holds the complete information of the interval
Double_t RandomDiscrete()
creates a new random value for the coefficient; returns a discrete value
Double_t Random(Bool_t near=kFALSE, Double_t value=0, Double_t spread=0.1, Bool_t mirror=kFALSE)
creates a new random value for the coefficient Parameters:
Double_t ReMapMirror(Double_t val)
remapping the value to the allowed space by reflecting on the boundaries
TRandom3 * fRandomGenerator
the randomGenerator for calculating the new values
Double_t fTo
the constraints of the coefficient
The TMVA::Interval Class.
virtual Double_t GetMin() const
virtual Double_t GetMax() const
virtual Int_t GetNbins() const
Random number generator class based on M.