This function performs destruction of the pool object. NOTE: this function is NOT thread-safe. It does not acquire pool lock, so you should NOT

This function performs given number of spin-wait iterations ************************************************************************/

This function unserializes boolean value from buffer buf buffer which contains value; leading spaces/tabs/newlines are ignored, t

This function unserializes double value from string buf buffer which contains value; leading spaces/tabs/newlines are ignored, tr

This function unserializes integer value from string buf buffer which contains value; leading spaces/tabs/newlines are ignored, t

This function unserializes 64-bit integer value from string buf buffer which contains value; leading spaces/tabs/newlines are ign

This function causes the calling thread to relinquish the CPU. The thread is moved to the end of the queue and some other thread gets to run. NOTE: t

Allocation of serializer: Integer array *************************************************************************/

Recurrent code for RankData(), splits problem into subproblems or calls basecase code (depending on problem complexity). INPUT PARAMETERS: XY

Bessel function of the second kind, order zero Returns Bessel function of the second kind, of order zero, of the argument. The domain is divided int

Bessel function of second kind of order one Returns Bessel function of the second kind of order one of the argument. The domain is divided into the

Binomial distribution Returns the sum of the terms 0 through k of the Binomial probability density: k -- ( n ) j n-j > ( ) p (1-

'bounds' value: maps X to [B1,B2] -- ALGLIB -- Copyright 20.03.2009 by Bochkanov Sergey ******************************************************

1-dimensional complex convolution. Extended subroutine which allows to choose convolution algorithm. Intended for internal use, ALGLIB users should c

1-dimensional real convolution. Extended subroutine which allows to choose convolution algorithm. Intended for internal use, ALGLIB users should call

Tail(T,N), accepts T<0 *************************************************************************/

Basic Cholesky solver for ScaleA*Cholesky(A)'*x = y. This subroutine assumes that: * A*ScaleA is well scaled * A is well-conditioned, so no zero divi

Internal Cholesky solver -- ALGLIB -- Copyright 27.01.2010 by Bochkanov Sergey ***************************************************************

Basic Cholesky solver for ScaleA*Cholesky(A)'*x = y. This subroutine assumes that: * A*ScaleA is well scaled * A is well-conditioned, so no zero divi

Internal Cholesky solver -- ALGLIB -- Copyright 27.01.2010 by Bochkanov Sergey ***************************************************************

* Create a tree node that subdivides the list of vecs from vind[first] * to vind[last]. The routine is called recursively on each sublist. *

* Create a tree node that subdivides the list of vecs from vind[first] * to vind[last]. The routine is called recursively on each sublist. *

recurrent subroutine for FFTFindSmoothRec -- ALGLIB -- Copyright 01.05.2009 by Bochkanov Sergey **********************************************

Factorizes task size N into product of two smaller sizes N1 and N2 INPUT PARAMETERS: N - task size, N>0 IsRoot - whether taks is r

This subroutine precomputes data for complex Bluestein's FFT and writes them to array PrecR[] at specified offset. It is responsibility of the

Computation of nodes and weights of a Gauss-Kronrod quadrature formula The algorithm generates the N-point Gauss-Kronrod quadrature formula with wei

This function returns random integer in [0,HQRNDMax] L'Ecuyer, Efficient and portable combined random number generators *****************************

Random number generator: normal numbers This function generates two independent random numbers from normal distribution. Its performance is equal to

This function generates random integer number in [0, N) 1. State structure must be initialized with HQRNDRandomize() or HQRNDSeed() 2. N can be any p

Power series for incomplete beta integral. Use when b*x is small and x not too close to 1. Cephes Math Library, Release 2.8: June, 2000 Copyright 19

Resizes X and: * preserves old contents of X * fills new elements by zeros -- ALGLIB -- Copyright 20.03.2009 by Bochkanov Sergey *************

Inverse of complemented imcomplete gamma integral Given p, the function finds x such that igamc( a, x ) = p. Starting with the approximate value

This function checks that first N values from X[] are finite -- ALGLIB -- Copyright 18.06.2010 by Bochkanov Sergey ***************************

Create a new circle that includes only this instance.

Serializer: allocation -- ALGLIB -- Copyright 14.03.2011 by Bochkanov Sergey *****************************************************************

This function creates buffer structure which can be used to perform parallel KD-tree requests. KD-tree subpackage provides two sets of request

Clears request fileds (to be sure that we don't forgot to clear something) *************************************************************************/

Loads a previous index from a binary file. * IMPORTANT NOTE: The set of data points is NOT stored in the file, so the * index object must be c

Loads a previous index from a binary file. * IMPORTANT NOTE: The set of data points is NOT stored in the file, so the * index object must be c

Tail(3.0, N1, N2) *************************************************************************/

Tail(S, 10, 15) *************************************************************************/

Tail(S, 11, 15) *************************************************************************/

Tail(S, 12, 15) *************************************************************************/

Tail(S, 13, 15) *************************************************************************/

Tail(S, 14, 15) *************************************************************************/

Tail(S, 5, 15) *************************************************************************/

Tail(S, 6, 15) *************************************************************************/

Tail(S, 7, 15) *************************************************************************/

Tail(S, 8, 15) *************************************************************************/

Tail(S, 9, 15) *************************************************************************/

Copies X[] to Buf.X[] Loads distance from X[] to bounding box. Initializes Buf.CurBox[]. -- ALGLIB -- Copyright 28.02.2010 by Bochkanov Sergey

Recursive subroutine for NN queries. -- ALGLIB -- Copyright 28.02.2010 by Bochkanov Sergey ***************************************************

R-NN query: all points within R-sphere centered at X, using external thread-local buffer, sorted by distance between point and X (by ascending)

Pearson product-moment correlation coefficient Input parameters: X - sample 1 (array indexes: [0..N-1]) Y - sample 2 (array i