Classes
class	BasicComplex

class	ComplexProduct

class	ComplexProductForEvent

class	const_counted_ptr

class	counted_ptr

class	counted_ptr_counter

class	EventList

class	EventPtrList

class	EvtTRandom

class	FitComplex

class	FitComplexCart

class	FitComplexPolar

class	FitParameter

class	FitParDependent

class	FitParRef

class	GaussFct

class	IComplexFitParDependent

class	IComplexForEventFitParDependent

class	IEventGenerator

class	IEventList

class	IEvtGen

class	IEvtRandom

class	IFitParDependent

class	IFitParRegister

class	IMinimalEventList

class	IMinimisable

class	IMintGen

class	IMinuitParameter

class	INamedParameter

class	IPdf

class	IReturnComplex

class	IReturnComplexForEvent

class	IReturnReal

class	IReturnRealForEvent

class	IReturnRealWithSmoothy

class	IUnweightedEventGenerator

class	IWeightedEvent

class	LASSO

class	LASSO_flexi

class	Minimisable

class	minimisePareto

class	Minimiser

class	MintFcn

class	MintFcnGrad

class	MintGen

class	MinuitParameterSet

class	NamedParameter

class	NamedParameterBase

class	NamedParameterStream

class	Neg2LL

class	Neg2LLClass

class	Neg2LLConstraint

class	Neg2LLMultiConstraint

class	Neg2LLSum

class	ParsedParameterFile

class	ParsedParameterFileList

class	ParsedParameterLine

class	PdfBase

class	Phase

class	PolymorphMap

class	PolymorphVector

class	SimulMinimisable

class	SumPdf

class	TwoDArray

Enumerations
enum	OWNERSHIP { CALLER_PASSES_OWNERSHIP, CALLER_KEEPS_OWNERSHIP }

Functions
template<typename T >
std::complex< T >	cexp (std::complex< T > arg)

counted_ptr< FitComplex >	FitComplexMaker (const std::string &name, const char fname=0, MinuitParameterSet pset=0, MINT::IFitParRegister *daddy=0, FitParameter::FIX_OR_WHAT fow=FitParameter::FIX, NamedParameterBase::VERBOSITY vb=NamedParameterBase::VERBOSE)

double	generalisedPareto_cumulative (double y, double xi, double sigma_bar)

double	generalisedPareto_pdf (double y, double xi, double sigma_bar)

double	generalisedPareto_logPdf (double y, double xi, double sigma_bar)

double	generalisedPareto_xiFromMeanRMS (double mean, double rms)

double	generalisedPareto_sigmaFromMeanRMS (double mean, double rms)

double	generalisedPareto_yFromCL (double CL, double xi, double sigma_bar)

double	generalisedPareto_limit (double xi, double sigma_bar)

double	generalisedPareto_estimateMaximum (const std::vector< double > &input, double CL=0.001)

double	generalisedPareto_estimateMaximum (std::vector< double > input, double CL, double &actualMax, double &paretoMax, int numEvents=-9999)

template<typename EVT_TYPE >
double	getWeight (const EVT_TYPE &)

template<>
double	getWeight (const MINT::IWeightedEvent &evt)

NamedParameterStream &	operator>> (NamedParameterStream &eam, std::string &ing)

template<typename Key , typename Val >
const Val &	keyFinder (const Key &k, const std::map< Key, Val > &m, const Val &dummy, bool &successFlag)

template<typename Key , typename Val >
const Val &	keyFinder (const Key &k, const std::map< Key, Val > &m, const Val &dummy)

template<typename T >
TMatrixTSym< T >	makeTMatrixTSym (const TMatrixT< T > &m)

template<typename T >
void	stringToAnything (const std::string &str, T &anything)

template<typename T >
std::string	anythingToString (const T &anything)

template<typename T >
std::string	anyVectorToString (const std::vector< T > &anyV)

std::string	stringtime (double dt)

int	nearestInt (double f)

bool	A_is_in_B (const std::string &a, const std::string &b)

int	LeviCita (int a, int b)

int	LeviCita (int a, int b, int c)

int	LeviCita (int a, int b, int c, int d)

int	LeviCita (int a, int b, int c, int d, int e)

int	LeviCita (const std::vector< int > &v)

Enumeration Type Documentation

◆ OWNERSHIP

enum MINT::OWNERSHIP

Enumerator
CALLER_PASSES_OWNERSHIP
CALLER_KEEPS_OWNERSHIP

Definition at line 17 of file Utils.h.

17 {CALLER_PASSES_OWNERSHIP, CALLER_KEEPS_OWNERSHIP};

MINT::CALLER_PASSES_OWNERSHIP

Definition: Utils.h:17

MINT::CALLER_KEEPS_OWNERSHIP

Definition: Utils.h:17

Function Documentation

◆ A_is_in_B()

bool MINT::A_is_in_B	(	const std::string &	a,
		const std::string &	b
	)

Definition at line 34 of file Utils.cpp.

                                                           {
   unsigned int pos = b.find(a);
   return pos < b.size();
 }

◆ anythingToString()

template<typename T >

std::string MINT::anythingToString ( const T & anything )

Definition at line 62 of file Utils.h.

                                              {
   std::stringstream strm;
   strm << anything;
   std::string ing;
   strm >> ing;
   return ing;
 }

◆ anyVectorToString()

template<typename T >

std::string MINT::anyVectorToString ( const std::vector< T > & anyV )

Definition at line 71 of file Utils.h.

                                                      {
   std::stringstream strm;
   for(unsigned int i=0; i<anyV.size(); i++){
     strm << anyV[i];
   }
   std::string ing;
   strm >> ing;
   return ing;
 }

◆ cexp()

template<typename T >

std::complex<T> MINT::cexp ( std::complex< T > arg )

Definition at line 11 of file cexp.h.

                                      {
   std::complex<T> phase(cos(arg.imag()), sin(arg.imag()));
   return exp(arg.real())*phase;
 }

◆ FitComplexMaker()

counted_ptr< FitComplex > MINT::FitComplexMaker	(	const std::string &	name,
		const char *	fname = `0`,
		MinuitParameterSet *	pset = `0`,
		MINT::IFitParRegister *	daddy = `0`,
		FitParameter::FIX_OR_WHAT	fow = `FitParameter::FIX`,
		NamedParameterBase::VERBOSITY	vb = `NamedParameterBase::VERBOSE`
	)

Definition at line 17 of file FitComplex.cpp.

                            {
   bool dbThis=false;
   bool verbose=false;
   counted_ptr<FitComplex> 
     ptr_polar(new FitComplexPolar(name, fname, pset, daddy, fow, vb));
 
   counted_ptr<FitComplex> 
     ptr_euclid(new FitComplexCart(name, fname, pset, daddy, fow, vb));
 
   int count=0;
   counted_ptr<FitComplex> return_ptr(0);
   counted_ptr<FitComplex> default_ptr(ptr_polar);
 
   if( ptr_polar->gotInitialised()){
     if(dbThis){
       cout << " FitComplexMaker for " << name
        << " found polar co-ordinates." << endl;
     }
     return_ptr = ptr_polar;
     count++;
   }
   if( ptr_euclid->gotInitialised()){
     if(dbThis){
       cout << " FitComplexMaker for " << name
        << " found Cartesian co-ordinates." << endl;
     }
     return_ptr = ptr_euclid;
     count++;
   }
   if(0 == count){
     if(verbose){
       cout << " FitComplexMaker WARNING!: " << name
        << " did not get initialised!" << endl;
     }
     return default_ptr;
   }else if(2 == count){
     cout << " FitComplexMaker WARNING!: " << name
      << " got initialised " << count << " times!!" << endl;
     return default_ptr;
   }
   return return_ptr;
 }

◆ generalisedPareto_cumulative()

double MINT::generalisedPareto_cumulative	(	double	y,
		double	xi,
		double	sigma_bar
	)

Definition at line 27 of file GeneralisedPareto.cpp.

                                                                               {
 
   return 1 - pow(1.0 + xi*y/sigma_bar, -1.0/xi);
 }

◆ generalisedPareto_estimateMaximum() [1/2]

double MINT::generalisedPareto_estimateMaximum	(	const std::vector< double > &	input,
		double	CL = `0.001`
	)

Definition at line 65 of file GeneralisedPareto.cpp.

                                  {
   double paretoMax=-9999;
   double actualMax=-9999;
   return MINT::generalisedPareto_estimateMaximum(input
                          , CL
                          , paretoMax
                          , actualMax);
 }

◆ generalisedPareto_estimateMaximum() [2/2]

double MINT::generalisedPareto_estimateMaximum	(	std::vector< double >	input,
		double	CL,
		double &	actualMax,
		double &	paretoMax,
		int	numEvents = `-9999`
	)

Definition at line 98 of file GeneralisedPareto.cpp.

                             {
   bool dbThis=false;
   bool verbose=true;
 
   double max=-9999;
   std::vector<double> input;
   for(unsigned int i=0; i < input_a.size(); i++){
     if(i > 0 && i%200 == 0){
       input.push_back(max);
       max = -9999;
     }
     if(input_a[i] > max) max=input_a[i];
   }
   
   sort(input.begin(), input.end());
 
   unsigned int n=-9999;
 //  unsigned int n=9999;
 
   if(numEvents > 0){
     n = (unsigned int) numEvents;
   }else{
     // let's take 0.2% of events, but at least 100, at most 1000:
     n = input.size()/50; // originally /500,
     if(n < 100) n=100;
     if(n > 1000) n=1000;
   }
   if(n > input.size()) n = input.size()-1;
   if(n == 0){
     cout << "MINT::generalisedPareto_estimateMaximum: "
      << input.size() << " too few events."
      << endl;
     return -9999;
   }
   double sum=0, sumsq=0;
   unsigned int counter=0;
   double lastVal=-9999;
   std::vector<double>::reverse_iterator it = input.rbegin();
   double maxVal = *it;
   for( ;
       it != input.rend() && counter < n;
       it++, counter++){
     if(dbThis) cout << *it << endl;
     lastVal = *it;
     sum += lastVal;
     sumsq += (lastVal) * (lastVal);
   }
   double threshold = 0.5*(lastVal + *it); // *it is one event beyond lastVal;
 
   double mean = sum/((double)n);
   double meansq = sumsq/((double)n);
   double var = meansq - mean*mean;
   double rms = sqrt(var);
 
   double xi = MINT::generalisedPareto_xiFromMeanRMS(mean - threshold, rms);
   double sg = MINT::generalisedPareto_sigmaFromMeanRMS(mean - threshold, rms);
 
   if(sg < -1.5*xi*(maxVal-threshold)) sg = fabs(1.5*xi*(maxVal-threshold));
 
   cout << "xi, sg before fit: xi = " << xi << ", sg = " << sg << endl;
   minimisePareto ll(input, threshold, xi, sg);
   Minimiser mini(&ll);
   mini.doFit();
   xi = ll.getXi();
   sg = fabs(ll.getSigma());
   cout << "xi, sg after fit: xi = " << xi << ", sg = " << sg << endl;
 
   double limity = -9999;
   if(xi < 0){
     limity = MINT::generalisedPareto_limit(xi, sg);
   }else{
     limity = MINT::generalisedPareto_yFromCL(CL, xi, sg);
   }
 
   double limit = limity + threshold;
 
   if(verbose || dbThis){
     cout << "MINT::generalisedPareto_estimateMaximum with CL = " << CL << endl;
     cout << "\n maxVal " << maxVal
      << "\n mean   " << mean
      << "\n rms    " << rms
      << "\n threshold " << threshold
      << "\n xi     " << xi
      << "\n sg     " << sg
      << "\n limity " << limity
      << "\n limit  " << limit
      << endl;
   }
   if(limit < maxVal){
     cout << "MINT::generalisedPareto_estimateMaximum with CL = " << CL
      << ": Something clearly went wrong"
      << "\n Estimated upper limit smaller than actual upper limit:"
      << " actual: " << maxVal << ", estimated " << limit << endl;
     actualMax = maxVal;
     paretoMax = maxVal;
     return maxVal;
   }
   actualMax = maxVal;
   paretoMax = limit;
   return limit;    
 }

◆ generalisedPareto_limit()

double MINT::generalisedPareto_limit	(	double	xi,
		double	sigma_bar
	)

Definition at line 56 of file GeneralisedPareto.cpp.

                                                                {
   if(xi >=0){
     cout << " MINT::generalisedPareto_limit: Limit only for negative xi."
      << " This xi = " << xi << endl;
     return -9999.0;
   }
   return -sigma_bar/xi;
 }

◆ generalisedPareto_logPdf()

double MINT::generalisedPareto_logPdf	(	double	y,
		double	xi,
		double	sigma_bar
	)

Definition at line 36 of file GeneralisedPareto.cpp.

                                                                           {
   double d = 1.0 + xi*y/fabs(sigma_bar);
   if(d < 0) return -99999;
   return -log(fabs(sigma_bar)) + log(1.0 + xi*y/fabs(sigma_bar)) *(-1.0/xi - 1.0);
 }

◆ generalisedPareto_pdf()

double MINT::generalisedPareto_pdf	(	double	y,
		double	xi,
		double	sigma_bar
	)

Definition at line 31 of file GeneralisedPareto.cpp.

                                                                        {
   double d = 1.0 + xi*y/fabs(sigma_bar);
   if(d < 0) return 0;
   return (1./fabs(sigma_bar))*pow(1.0 + xi*y/fabs(sigma_bar), -1.0/xi - 1.0);
 }

◆ generalisedPareto_sigmaFromMeanRMS()

double MINT::generalisedPareto_sigmaFromMeanRMS	(	double	mean,
		double	rms
	)

Definition at line 46 of file GeneralisedPareto.cpp.

                                                                       {
   // assuming threshold == 0, shift parameters if necessary
   return 0.5*mean*(1.0 + mean*mean/(rms*rms));
 }

◆ generalisedPareto_xiFromMeanRMS()

double MINT::generalisedPareto_xiFromMeanRMS	(	double	mean,
		double	rms
	)

Definition at line 42 of file GeneralisedPareto.cpp.

                                                                    {
   // assuming threshold == 0, shift parameters if necessary
   return 0.5*(1.0 - mean*mean/(rms*rms));
 }

◆ generalisedPareto_yFromCL()

double MINT::generalisedPareto_yFromCL	(	double	CL,
		double	xi,
		double	sigma_bar
	)

Definition at line 51 of file GeneralisedPareto.cpp.

                                                                             {
 
   return sigma_bar/xi * ( pow( 1.0 - CL , -xi) - 1.0 );
 }

◆ getWeight() [1/2]

template<typename EVT_TYPE >

double MINT::getWeight ( const EVT_TYPE & )

Definition at line 32 of file IWeightedEvent.h.

                                       {
     return 1;
   }

◆ getWeight() [2/2]

template<>

double MINT::getWeight ( const MINT::IWeightedEvent & evt )

inline

Definition at line 36 of file IWeightedEvent.h.

                                                    {
     return evt.getWeight();
   }

◆ keyFinder() [1/2]

template<typename Key , typename Val >

const Val& MINT::keyFinder	(	const Key &	k,
		const std::map< Key, Val > &	m,
		const Val &	dummy,
		bool &	successFlag
	)

Definition at line 20 of file Utils.h.

                            {
   typename std::map< Key , Val >::const_iterator it = m.find(k);
   if(it == m.end()){
     successFlag = false;
     return dummy;
   }else{
     successFlag = true;
     return it->second;
   }
 }

◆ keyFinder() [2/2]

template<typename Key , typename Val >

const Val& MINT::keyFinder	(	const Key &	k,
		const std::map< Key, Val > &	m,
		const Val &	dummy
	)

Definition at line 36 of file Utils.h.

                            {
   bool successFlag;
   return keyFinder<Key, Val>(k, m, dummy, successFlag);
 }

◆ LeviCita() [1/5]

int MINT::LeviCita	(	int	a,
		int	b
	)

Definition at line 41 of file Utils.cpp.

                               {
   std::vector<int> v(2);
   v[0]=a; v[1]=b;
   return MINT::LeviCita(v);
 }

◆ LeviCita() [2/5]

int MINT::LeviCita	(	int	a,
		int	b,
		int	c
	)

Definition at line 46 of file Utils.cpp.

                                      {
   std::vector<int> v(3);
   v[0]=a; v[1]=b; v[2]=c;
   return MINT::LeviCita(v);
 }

◆ LeviCita() [3/5]

int MINT::LeviCita	(	int	a,
		int	b,
		int	c,
		int	d
	)

Definition at line 51 of file Utils.cpp.

                                             {
   std::vector<int> v(4);
   v[0]=a; v[1]=b; v[2]=c; v[3]=d;
   return MINT::LeviCita(v);
 }

◆ LeviCita() [4/5]

int MINT::LeviCita	(	int	a,
		int	b,
		int	c,
		int	d,
		int	e
	)

Definition at line 56 of file Utils.cpp.

                                                    {
   std::vector<int> v(5);
   v[0]=a; v[1]=b; v[2]=c; v[3]=d; v[4]=e;
   return MINT::LeviCita(v);
 }

◆ LeviCita() [5/5]

int MINT::LeviCita ( const std::vector< int > & v )

Definition at line 62 of file Utils.cpp.

                                          {
   if(v.size() <=1) return 1;
   
   std::vector<int> checkMultiples(v.size(), 0);
   int p=1;
   for(unsigned int i=0; i<v.size(); i++){
     if(v[i] < 0 || v[i] >= (int) v.size()) return 0;
     if(++(checkMultiples[i]) > 1) return 0;
   }
   for(unsigned int i=0; i<v.size()-1; i++){
     for(unsigned int j=i+1; j < v.size(); j++){
       if(v[i] > v[j]) p*= -1;
     }
   }
   return p;
 }

◆ makeTMatrixTSym()

template<typename T >

TMatrixTSym<T> MINT::makeTMatrixTSym ( const TMatrixT< T > & m )

Definition at line 45 of file Utils.h.

                                                     {
   TMatrixTSym<T> ms(m.GetNcols());
   for(int i=0; i < ms.GetNcols(); i++){
     for(int j=i; j < ms.GetNcols(); j++){    
       ms(i,j) = ms(j,i) = m(i,j);
     }
   }
   return ms;
 }

◆ nearestInt()

int MINT::nearestInt ( double f )

Definition at line 26 of file Utils.cpp.

                             {
   if(f >= 0) return ((int)(f+0.5));
   
   f *= -1;
   
   return - ((int)(f+0.5));
 }

◆ operator>>()

NamedParameterStream& MINT::operator>>	(	NamedParameterStream &	eam,
		std::string &	ing
	)

Definition at line 8 of file NamedParameterStream.cpp.

                   {
   std::getline(eam,ing);
   return eam;
 }

◆ stringtime()

std::string MINT::stringtime ( double dt )

Definition at line 14 of file Utils.cpp.

                                     {
   int dt = (int) ddt;
   std::string str;
   int sec = 1;
   int min = sec*60;
   int h   = min*60;
   if(dt >= h)   str += MINT::anythingToString( (int) (dt/h) ) + " h ";
   if(dt >= min) str += MINT::anythingToString( (int) (dt%h)/min ) + " min ";
   str               += MINT::anythingToString(dt%min) + " s";
   return str;
 }

◆ stringToAnything()

template<typename T >

void MINT::stringToAnything	(	const std::string &	str,
		T &	anything
	)

Definition at line 56 of file Utils.h.

                                                         {
   std::stringstream strm(str);
   strm >> anything;
 }

Classes

Enumerations

Functions

Enumeration Type Documentation

◆ OWNERSHIP

Function Documentation

◆ A_is_in_B()

◆ anythingToString()

◆ anyVectorToString()

◆ cexp()

◆ FitComplexMaker()

◆ generalisedPareto_cumulative()

◆ generalisedPareto_estimateMaximum() [1/2]

◆ generalisedPareto_estimateMaximum() [2/2]

◆ generalisedPareto_limit()

◆ generalisedPareto_logPdf()

◆ generalisedPareto_pdf()

◆ generalisedPareto_sigmaFromMeanRMS()

◆ generalisedPareto_xiFromMeanRMS()

◆ generalisedPareto_yFromCL()

◆ getWeight() [1/2]

◆ getWeight() [2/2]

◆ keyFinder() [1/2]

◆ keyFinder() [2/2]

◆ LeviCita() [1/5]

◆ LeviCita() [2/5]

◆ LeviCita() [3/5]

◆ LeviCita() [4/5]

◆ LeviCita() [5/5]

◆ makeTMatrixTSym()

◆ nearestInt()

◆ operator>>()

◆ stringtime()

◆ stringToAnything()