Computation of the complementary error function erfc(x).
The algorithm is based on a Chebyshev fit as denoted in
Numerical Recipes 2nd ed. on p. 214 (W.H.Press et al.).
The fractional error is always less than 1.2e-7.
--- Nve 14-nov-1998 UU-SAP Utrecht

Computation of the incomplete gamma function P(a,x)
The algorithm is based on the formulas and code as denoted in
Numerical Recipes 2nd ed. on p. 210-212 (W.H.Press et al.).
--- Nve 14-nov-1998 UU-SAP Utrecht

Computation of the incomplete gamma function P(a,x)
via its continued fraction representation.
The algorithm is based on the formulas and code as denoted in
Numerical Recipes 2nd ed. on p. 210-212 (W.H.Press et al.).
--- Nve 14-nov-1998 UU-SAP Utrecht

Computation of the incomplete gamma function P(a,x)
via its series representation.
The algorithm is based on the formulas and code as denoted in
Numerical Recipes 2nd ed. on p. 210-212 (W.H.Press et al.).
--- Nve 14-nov-1998 UU-SAP Utrecht

Computation of ln[gamma(z)] for all z>0.
The algorithm is based on the article by C.Lanczos [1] as denoted in
Numerical Recipes 2nd ed. on p. 207 (W.H.Press et al.).
[1] C.Lanczos, SIAM Journal of Numerical Analysis B1 (1964), 86.
The accuracy of the result is better than 2e-10.
--- Nve 14-nov-1998 UU-SAP Utrecht

Computation of the probability for a certain Chi-squared (chi2)
and number of degrees of freedom (ndf).
Calculations are based on the incomplete gamma function P(a,x),
where a=ndf/2 and x=chi2/2.
P(a,x) represents the probability that the observed Chi-squared
for a correct model should be less than the value chi2.
The returned probability corresponds to 1-P(a,x),
which denotes the probability that an observed Chi-squared exceeds
the value chi2 by chance, even for a correct model.
--- NvE 14-nov-1998 UU-SAP Utrecht

Binary search in an array of n values to locate value
Array is supposed to be sorted prior to this call.
If match is found, function returns position of element.
If no match found, function gives nearest element smaller than value.

Binary search in an array of n values to locate value
Array is supposed to be sorted prior to this call.
If match is found, function returns position of element.
If no match found, function gives nearest element smaller than value.

Binary search in an array of n values to locate value
Array is supposed to be sorted prior to this call.
If match is found, function returns position of element.
If no match found, function gives nearest element smaller than value.

Binary search in an array of n values to locate value
Array is supposed to be sorted prior to this call.
If match is found, function returns position of element.
If no match found, function gives nearest element smaller than value.

Binary search in an array of n values to locate value
Array is supposed to be sorted prior to this call.
If match is found, function returns position of element.
If no match found, function gives nearest element smaller than value.

Binary search in an array of n values to locate value
Array is supposed to be sorted prior to this call.
If match is found, function returns position of element.
If no match found, function gives nearest element smaller than value.

Binary search in an array of n values to locate value
Array is supposed to be sorted prior to this call.
If match is found, function returns position of element.
If no match found, function gives nearest element smaller than value.

Binary search in an array of n values to locate value
Array is supposed to be sorted prior to this call.
If match is found, function returns position of element.
If no match found, function gives nearest element smaller than value.

Sort the n1 elements of the Short_t array a.
In output the array index contains the indices of the sorted array.
If down is false sort in increasing order (default is decreasing order).
This is a translation of the CERNLIB routine sortzv (M101)
based on the quicksort algorithm.
NOTE that the array index must be created with a length >= n1
before calling this function.

Sort the n1 elements of the Int_t array a.
In output the array index contains the indices of the sorted array.
If down is false sort in increasing order (default is decreasing order).
This is a translation of the CERNLIB routine sortzv (M101)
based on the quicksort algorithm.
NOTE that the array index must be created with a length >= n1
before calling this function.

Sort the n1 elements of the Float_t array a.
In output the array index contains the indices of the sorted array.
If down is false sort in increasing order (default is decreasing order).
This is a translation of the CERNLIB routine sortzv (M101)
based on the quicksort algorithm.
NOTE that the array index must be created with a length >= n1
before calling this function.

Sort the n1 elements of the Double_t array a.
In output the array index contains the indices of the sorted array.
If down is false sort in increasing order (default is decreasing order).
This is a translation of the CERNLIB routine sortzv (M101)
based on the quicksort algorithm.
NOTE that the array index must be created with a length >= n1
before calling this function.

Calculates hash index from any char string
based on precalculated table of 256 specially selected
random numbers.
For string: i = TExMap::Hash(string,nstring);
For int: i = TExMap::Hash(&intword,sizeof(int));
For pointer: i = TExMap::Hash(&pointer,sizeof(void*));
Limitation: for ntxt>256 calculates hash only from first 256 bytes
V.Perev

This page has been automatically generated. If you have any comments or suggestions about the page layout send a mail to ROOT support, or contact the developers with any questions or problems regarding ROOT.