TIndex2 Class Reference

#include <EdbMath.h>

Inheritance diagram for TIndex2:

Collaboration diagram for TIndex2:

Public Member Functions
void	BuildIndex (int n, double *w)
Int_t	Find (Int_t major, Int_t minor)
Int_t	FindIndex (Int_t major)
Int_t	FindIndexArr (Int_t major, TArrayI &mina)
Int_t	Major (int i)
Int_t	Minor (int i)
void	Print ()
void	SetMinor (int i, Int_t minor)
	TIndex2 ()
	TIndex2 (int size)
virtual	~TIndex2 ()

Static Public Member Functions
static Double_t	BuildValue (Int_t major, Int_t minor)

Constructor & Destructor Documentation

TIndex2() [1/2]

TIndex2::TIndex2 ( )

inline

: TArrayD() {}

TIndex2() [2/2]

TIndex2::TIndex2 ( int  size )

inline

: TArrayD(size) {}

~TIndex2()

virtual TIndex2::~TIndex2 ( )

inlinevirtual

{}

Member Function Documentation

BuildIndex()

void TIndex2::BuildIndex	(	int	n,
		double *	w
	)

{
  Int_t  *ind = new Int_t[n];
  TMath::Sort(n,w,ind,0);
  Set(n);
  for (Int_t i=0;i<n;i++) {
    (*this)[i] = w[ind[i]];
  }
}

BuildValue()

static Double_t TIndex2::BuildValue ( Int_t  major, Int_t  minor  )

inlinestatic

{return major+minor*1e-9;}

Find()

Int_t TIndex2::Find	(	Int_t	major,
		Int_t	minor
	)

{
  if (GetSize()<1) return -1;
  Double_t value = BuildValue(major,minor);
  Int_t i = TMath::BinarySearch( fN, GetArray(), value);
  if (i < 0) return -1;
  if (TMath::Abs((*this)[i] - value) > 1.e-10) return -1;
  return i;
}

FindIndex()

Int_t TIndex2::FindIndex

(

Int_t

major

)

{
  // return the value of minor (this make sence in the case when major is unique)
  if (fN<1) return -1;
  Double_t value = (Double_t)major;
  Int_t i = TMath::BinarySearch( fN, GetArray(), value);
  if (i < -1) return -1;
  if (i == -1) i++;
  if(i>fN-1) return -1;
  if( (*this)[i]<major ) i++; 
  if(i>fN-1) return -1;
  if (TMath::Abs((*this)[i] - value) > .5) return -1;
  return (Int_t)( ((*this)[i]-value+1e-10)*1e+9 );
}

FindIndexArr()

Int_t TIndex2::FindIndexArr	(	Int_t	major,
		TArrayI &	mina
	)

{
  // return the number of found events with given major
  // Output: mina - array of minors - should be big enough
 
  if (fN<1) return -1;
  Double_t value = (Double_t)major;
  Int_t i = TMath::BinarySearch( fN, GetArray(), value);
  if (i < -1) return -1;
  if (i == -1) i++;
  if(i>fN-1) return -1;
  if( (*this)[i]<major ) i++; 
  if(i>fN-1) return -1;
  if (TMath::Abs((*this)[i] - value) > .5) return -1;
 
  int na=mina.fN;
  int ia=0;
  for(ia=0; ia<na; ia++) {
    if( (*this)[i+ia] > value+1-1e-10 ) break;
    mina[ia] = (Int_t)( ((*this)[i+ia]-value+1e-10)*1e+9 );
  }
  return ia;
}

Major()

Int_t TIndex2::Major ( int  i )

inline

{ return (Int_t)((*this)[i]); }

Minor()

Int_t TIndex2::Minor ( int  i )

inline

{ return (Int_t)(((*this)[i]- (Double_t)Major(i)+1e-10)*1e+9 ); }

Print()

void TIndex2::Print

(

)

{
  for(int i=0; i<fN; i++)
    printf("%d \t:  %d  %d\n",i,Major(i),Minor(i));
}

SetMinor()

void TIndex2::SetMinor ( int  i, Int_t  minor  )

inline

{ (*this)[i] = BuildValue( Major(i), minor ); }

---

The documentation for this class was generated from the following files:

• src/libEmath/EdbMath.h
• src/libEmath/EdbMath.cxx