Math.h

Go to the documentation of this file.

/*
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 3 of the License, or
 * (at your option) any later version.
 *
 * Written (W) 2012 Fernando José Iglesias García
 * Written (W) 2011 Siddharth Kherada
 * Written (W) 2011 Justin Patera
 * Written (W) 2011 Alesis Novik
 * Written (W) 2011-2012 Heiko Strathmann
 * Written (W) 1999-2009 Soeren Sonnenburg
 * Written (W) 1999-2008 Gunnar Raetsch
 * Written (W) 2007 Konrad Rieck
 * Copyright (C) 1999-2009 Fraunhofer Institute FIRST and Max-Planck-Society
 */

#ifndef __MATHEMATICS_H_
#define __MATHEMATICS_H_

#include <shogun/base/SGObject.h>
#include <shogun/lib/common.h>
#include <shogun/io/SGIO.h>
#include <shogun/base/Parallel.h>

#include <math.h>
#include <stdio.h>
#include <float.h>
#include <pthread.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/time.h>
#include <time.h>

#ifdef SUNOS
#include <ieeefp.h>
#endif

#ifdef log2
#define cygwin_log2 log2
#undef log2
#endif


#ifdef _GLIBCXX_CMATH
#if _GLIBCXX_USE_C99_MATH
#if !_GLIBCXX_USE_C99_FP_MACROS_DYNAMIC

  using std::signbit;

  using std::fpclassify;

  using std::isfinite;
  using std::isinf;
  using std::isnan;
  using std::isnormal;

  using std::isgreater;
  using std::isgreaterequal;
  using std::isless;
  using std::islessequal;
  using std::islessgreater;
  using std::isunordered;
#endif
#endif
#endif


#ifdef _WIN32
#ifndef isnan
#define isnan _isnan
#endif

#ifndef isfinite
#define isfinite _isfinite
#endif
#endif //_WIN32

#ifndef NAN
#include <stdlib.h>
#define NAN (strtod("NAN",NULL))
#endif

/* Size of RNG seed */
#define RNG_SEED_SIZE 256

/* Maximum stack size */
#define RADIX_STACK_SIZE        512

/* Stack macros */
#define radix_push(a, n, i)     sp->sa = a, sp->sn = n, (sp++)->si = i
#define radix_pop(a, n, i)      a = (--sp)->sa, n = sp->sn, i = sp->si

#ifndef DOXYGEN_SHOULD_SKIP_THIS

template <class T> struct radix_stack_t
{
    T *sa;
    size_t sn;
    uint16_t si;
};


template <class T1, class T2> struct thread_qsort
{
    T1* output;
    T2* index;
    uint32_t size;

    int32_t* qsort_threads;
    int32_t sort_limit;
    int32_t num_threads;
};
#endif // DOXYGEN_SHOULD_SKIP_THIS

namespace shogun
{
    class CSGObject;
class CMath : public CSGObject
{
    public:

        CMath();

        virtual ~CMath();


        //
        template <class T>
            static inline T min(T a, T b)
            {
                return (a<=b) ? a : b;
            }

        template <class T>
            static inline T max(T a, T b)
            {
                return (a>=b) ? a : b;
            }

        template <class T>
            static inline T clamp(T value, T lb, T ub)
            {
                if (value<=lb)
                    return lb;
                else if (value>=ub)
                    return ub;
                else
                    return value;
            }

        template <class T>
            static inline T abs(T a)
            {
                // can't be a>=0?(a):(-a), because compiler complains about
                // 'comparison always true' when T is unsigned
                if (a==0)
                    return 0;
                else if (a>0)
                    return a;
                else
                    return -a;
            }


        static inline float64_t round(float64_t d)
        {
            return ::floor(d+0.5);
        }

        static inline float64_t floor(float64_t d)
        {
            return ::floor(d);
        }

        static inline float64_t ceil(float64_t d)
        {
            return ::ceil(d);
        }

        template <class T>
            static inline T sign(T a)
            {
                if (a==0)
                    return 0;
                else return (a<0) ? (-1) : (+1);
            }

        template <class T>
            static inline void swap(T &a,T &b)
            {
            /* register for fast swaps */
                register T c=a;
                a=b;
                b=c;
            }

        template <class T>
            static inline T sq(T x)
            {
                return x*x;
            }

        static inline float32_t sqrt(float32_t x)
        {
            return ::sqrtf(x);
        }

        static inline float64_t sqrt(float64_t x)
        {
            return ::sqrt(x);
        }

        static inline floatmax_t sqrt(floatmax_t x)
        {
            //fall back to double precision sqrt if sqrtl is not
            //available
#ifdef HAVE_SQRTL
            return ::sqrtl(x);
#else
            return ::sqrt(x);
#endif
        }

        static inline float32_t invsqrt(float32_t x)
        {
            union float_to_int
            {
                float32_t f;
                int32_t i;
            };

            float_to_int tmp;
            tmp.f=x;

            float32_t xhalf = 0.5f * x;
            // store floating-point bits in integer tmp.i
            // and do initial guess for Newton's method
            tmp.i = 0x5f3759d5 - (tmp.i >> 1);
            x = tmp.f; // convert new bits into float
            x = x*(1.5f - xhalf*x*x); // One round of Newton's method
            return x;
        }

        static inline floatmax_t powl(floatmax_t x, floatmax_t n)
        {
            //fall back to double precision pow if powl is not
            //available
#ifdef HAVE_POWL
            return ::powl((long double) x, (long double) n);
#else
            return ::pow((double) x, (double) n);
#endif
        }

        static inline int32_t pow(int32_t x, int32_t n)
        {
            ASSERT(n>=0);
            int32_t result=1;
            while (n--)
                result*=x;

            return result;
        }

        static inline float64_t pow(float64_t x, int32_t n)
        {
            if (n>=0)
            {
                float64_t result=1;
                while (n--)
                    result*=x;

                return result;
            }
            else
                return ::pow((double)x, (double)n);
        }

        static inline float64_t pow(float64_t x, float64_t n)
        {
            return ::pow((double) x, (double) n);
        }

        static inline float64_t exp(float64_t x)
        {
            return ::exp((double) x);
        }

        static inline float64_t atan(float64_t x)
        {
            return ::atan((double) x);
        }

        static inline float64_t log10(float64_t v)
        {
            return ::log(v)/::log(10.0);
        }

        static inline float64_t log2(float64_t v)
        {
#ifdef HAVE_LOG2
            return ::log2(v);
#else
            return ::log(v)/::log(2.0);
#endif //HAVE_LOG2
        }

        static inline float64_t log(float64_t v)
        {
            return ::log(v);
        }

        static inline float64_t sin(float64_t x)
        {
            return ::sin(x);
        }

        static inline float64_t cos(float64_t x)
        {
            return ::cos(x);
        }

        static float64_t area_under_curve(float64_t* xy, int32_t len, bool reversed)
        {
            ASSERT(len>0 && xy);

            float64_t area = 0.0;

            if (!reversed)
            {
                for (int i=1; i<len; i++)
                    area += 0.5*(xy[2*i]-xy[2*(i-1)])*(xy[2*i+1]+xy[2*(i-1)+1]);
            }
            else
            {
                for (int i=1; i<len; i++)
                    area += 0.5*(xy[2*i+1]-xy[2*(i-1)+1])*(xy[2*i]+xy[2*(i-1)]);
            }

            return area;
        }

        static inline int64_t factorial(int32_t n)
        {
            int64_t res=1;
            for (int i=2; i<=n; i++)
                res*=i ;
            return res ;
        }

        static void init_random(uint32_t initseed=0)
        {
            if (initseed==0)
            {
                struct timeval tv;
                gettimeofday(&tv, NULL);
                seed=(uint32_t) (4223517*getpid()*tv.tv_sec*tv.tv_usec);
            }
            else
                seed=initseed;
#if !defined(CYGWIN) && !defined(__INTERIX)
            //seed=42
            //SG_SPRINT("initializing random number generator with %d (seed size %d)\n", seed, RNG_SEED_SIZE);
            initstate(seed, CMath::rand_state, RNG_SEED_SIZE);
#endif
        }

        static inline int64_t random()
        {
#if defined(CYGWIN) || defined(__INTERIX)
            return rand();
#else
            return ::random();
#endif
        }

        static inline uint64_t random(uint64_t min_value, uint64_t max_value)
        {
            uint64_t ret = min_value + (uint64_t) ((max_value-min_value+1) * (random() / (RAND_MAX+1.0)));
            ASSERT(ret>=min_value && ret<=max_value);
            return ret ;
        }

        static inline int64_t random(int64_t min_value, int64_t max_value)
        {
            int64_t ret = min_value + (int64_t) ((max_value-min_value+1) * (random() / (RAND_MAX+1.0)));
            ASSERT(ret>=min_value && ret<=max_value);
            return ret ;
        }

        static inline uint32_t random(uint32_t min_value, uint32_t max_value)
        {
            uint32_t ret = min_value + (uint32_t) ((max_value-min_value+1) * (random() / (RAND_MAX+1.0)));
            ASSERT(ret>=min_value && ret<=max_value);
            return ret ;
        }

        static inline int32_t random(int32_t min_value, int32_t max_value)
        {
            int32_t ret = min_value + (int32_t) ((max_value-min_value+1) * (random() / (RAND_MAX+1.0)));
            ASSERT(ret>=min_value && ret<=max_value);
            return ret ;
        }

        static inline float32_t random(float32_t min_value, float32_t max_value)
        {
            float32_t ret = min_value + ((max_value-min_value) * (random() / (1.0*RAND_MAX)));

            if (ret<min_value || ret>max_value)
                SG_SPRINT("min_value:%10.10f value: %10.10f max_value:%10.10f", min_value, ret, max_value);
            ASSERT(ret>=min_value && ret<=max_value);
            return ret;
        }

        static inline float64_t random(float64_t min_value, float64_t max_value)
        {
            float64_t ret = min_value + ((max_value-min_value) * (random() / (1.0*RAND_MAX)));

            if (ret<min_value || ret>max_value)
                SG_SPRINT("min_value:%10.10f value: %10.10f max_value:%10.10f", min_value, ret, max_value);
            ASSERT(ret>=min_value && ret<=max_value);
            return ret;
        }

        static inline floatmax_t random(floatmax_t min_value, floatmax_t max_value)
        {
            floatmax_t ret = min_value + ((max_value-min_value) * (random() / (1.0*RAND_MAX)));

            if (ret<min_value || ret>max_value)
                SG_SPRINT("min_value:%10.10f value: %10.10f max_value:%10.10f", min_value, ret, max_value);
            ASSERT(ret>=min_value && ret<=max_value);
            return ret;
        }

        static inline float32_t normal_random(float32_t mean, float32_t std_dev)
        {
            // sets up variables & makes sure rand_s.range == (0,1)
            float32_t ret;
            float32_t rand_u;
            float32_t rand_v;
            float32_t rand_s;
            do
            {
                rand_u = random(-1.0, 1.0);
                rand_v = random(-1.0, 1.0);
                rand_s = rand_u*rand_u + rand_v*rand_v;
            } while ((rand_s == 0) || (rand_s >= 1));

            // the meat & potatos, and then the mean & standard deviation shifting...
            ret = rand_u*sqrt(-2.0*log(rand_s)/rand_s);
            ret = std_dev*ret + mean;
            return ret;
        }

        static inline float64_t normal_random(float64_t mean, float64_t std_dev)
        {
            float64_t ret;
            float64_t rand_u;
            float64_t rand_v;
            float64_t rand_s;
            do
            {
                rand_u = random(-1.0, 1.0);
                rand_v = random(-1.0, 1.0);
                rand_s = rand_u*rand_u + rand_v*rand_v;
            } while ((rand_s == 0) || (rand_s >= 1));

            ret = rand_u*sqrt(-2.0*log(rand_s)/rand_s);
            ret = std_dev*ret + mean;
            return ret;
        }

        static inline float32_t randn_float()
        {
            return normal_random(0.0, 1.0);
        }

        static inline float64_t randn_double()
        {
            return normal_random(0.0, 1.0);
        }

        template <class T>
            static int32_t get_num_nonzero(T* vec, int32_t len)
            {
                int32_t nnz = 0;
                for (index_t i=0; i<len; ++i)
                    nnz += vec[i] != 0;

                return nnz;
            }

        static inline SGVector<int32_t> randperm_vec(int32_t n)
        {
            SGVector<int32_t> result(randperm(n), n);
            return result;
        }

        static inline int32_t* randperm(int32_t n)
        {
            int32_t* perm = SG_MALLOC(int32_t, n);

            if (!perm)
                return NULL;
            for (int32_t i = 0; i < n; i++)
                perm[i] = i;
            for (int32_t i = 0; i < n; i++)
                swap(perm[random(0, n - 1)], perm[i]);
            return perm;
        }

        static inline int64_t nchoosek(int32_t n, int32_t k)
        {
            int64_t res=1;

            for (int32_t i=n-k+1; i<=n; i++)
                res*=i;

            return res/factorial(k);
        }

        static void sort(int32_t *a, int32_t cols, int32_t sort_col=0);
        static void sort(float64_t *a, int32_t*idx, int32_t N);

        /*
         * Inline function to extract the byte at position p (from left)
         * of an 64 bit integer. The function is somewhat identical to
         * accessing an array of characters via [].
         */

        template <class T>
            inline static void radix_sort(T* array, int32_t size)
            {
                radix_sort_helper(array,size,0);
            }

        template <class T>
            static inline uint8_t byte(T word, uint16_t p)
            {
                return (word >> (sizeof(T)-p-1) * 8) & 0xff;
            }

        template <class T>
            static void radix_sort_helper(T* array, int32_t size, uint16_t i)
            {
                static size_t count[256], nc, cmin;
                T *ak;
                uint8_t c=0;
                radix_stack_t<T> s[RADIX_STACK_SIZE], *sp, *olds, *bigs;
                T *an, *aj, *pile[256];
                size_t *cp, cmax;

                /* Push initial array to stack */
                sp = s;
                radix_push(array, size, i);

                /* Loop until all digits have been sorted */
                while (sp>s) {
                    radix_pop(array, size, i);
                    an = array + size;

                    /* Make character histogram */
                    if (nc == 0) {
                        cmin = 0xff;
                        for (ak = array; ak < an; ak++) {
                            c = byte(*ak, i);
                            count[c]++;
                            if (count[c] == 1) {
                                /* Determine smallest character */
                                if (c < cmin)
                                    cmin = c;
                                nc++;
                            }
                        }

                        /* Sort recursively if stack size too small */
                        if (sp + nc > s + RADIX_STACK_SIZE) {
                            radix_sort_helper(array, size, i);
                            continue;
                        }
                    }

                    /*
                     * Set pile[]; push incompletely sorted bins onto stack.
                     * pile[] = pointers to last out-of-place element in bins.
                     * Before permuting: pile[c-1] + count[c] = pile[c];
                     * during deal: pile[c] counts down to pile[c-1].
                     */
                    olds = bigs = sp;
                    cmax = 2;
                    ak = array;
                    pile[0xff] = an;
                    for (cp = count + cmin; nc > 0; cp++) {
                        /* Find next non-empty pile */
                        while (*cp == 0)
                            cp++;
                        /* Pile with several entries */
                        if (*cp > 1) {
                            /* Determine biggest pile */
                            if (*cp > cmax) {
                                cmax = *cp;
                                bigs = sp;
                            }

                            if (i < sizeof(T)-1)
                                radix_push(ak, *cp, (uint16_t) (i + 1));
                        }
                        pile[cp - count] = ak += *cp;
                        nc--;
                    }

                    /* Play it safe -- biggest bin last. */
                    swap(*olds, *bigs);

                    /*
                     * Permute misplacements home. Already home: everything
                     * before aj, and in pile[c], items from pile[c] on.
                     * Inner loop:
                     *      r = next element to put in place;
                     *      ak = pile[r[i]] = location to put the next element.
                     *      aj = bottom of 1st disordered bin.
                     * Outer loop:
                     *      Once the 1st disordered bin is done, ie. aj >= ak,
                     *      aj<-aj + count[c] connects the bins in array linked list;
                     *      reset count[c].
                     */
                    aj = array;
                    while (aj<an)
                    {
                        T r;

                        for (r = *aj; aj < (ak = --pile[c = byte(r, i)]);)
                            swap(*ak, r);

                        *aj = r;
                        aj += count[c];
                        count[c] = 0;
                    }
                }
            }

        template <class T>
            static void insertion_sort(T* output, int32_t size)
            {
                for (int32_t i=0; i<size-1; i++)
                {
                    int32_t j=i-1;
                    T value=output[i];
                    while (j >= 0 && output[j] > value)
                    {
                        output[j+1] = output[j];
                        j--;
                    }
                    output[j+1]=value;
                }
            }

        template <class T>
            static index_t find_position_to_insert(SGVector<T> vector, T element)
        {
            index_t i;
            for (i=0; i<vector.vlen; ++i)
            {
                if (vector[i]>element)
                    break;
            }
            return i;
        }

        template <class T>
            static void qsort(SGVector<T> vector)
        {
            qsort(vector.vector, vector.vlen);
        }

        template <class T>
            static void qsort(T* output, int32_t size)
            {
                if (size==1)
                    return;

                if (size==2)
                {
                    if (output[0] > output [1])
                        swap(output[0],output[1]);
                    return;
                }
                //T split=output[random(0,size-1)];
                T split=output[size/2];

                int32_t left=0;
                int32_t right=size-1;

                while (left<=right)
                {
                    while (output[left] < split)
                        left++;
                    while (output[right] > split)
                        right--;

                    if (left<=right)
                    {
                        swap(output[left],output[right]);
                        left++;
                        right--;
                    }
                }

                if (right+1> 1)
                    qsort(output,right+1);

                if (size-left> 1)
                    qsort(&output[left],size-left);
            }

        template <class T>
            static void qsort(T** vector, index_t length)
            {
                if (length==1)
                    return;

                if (length==2)
                {
                    if (*vector[0]>*vector[1])
                        swap(vector[0],vector[1]);
                    return;
                }
                T* split=vector[length/2];

                int32_t left=0;
                int32_t right=length-1;

                while (left<=right)
                {
                    while (*vector[left]<*split)
                        ++left;
                    while (*vector[right]>*split)
                        --right;

                    if (left<=right)
                    {
                        swap(vector[left],vector[right]);
                        ++left;
                        --right;
                    }
                }

                if (right+1>1)
                    qsort(vector,right+1);

                if (length-left>1)
                    qsort(&vector[left],length-left);
            }

        template <class T> static void display_bits(T word, int32_t width=8*sizeof(T))
        {
            ASSERT(width>=0);
            for (int i=0; i<width; i++)
            {
                T mask = ((T) 1)<<(sizeof(T)*8-1);
                while (mask)
                {
                    if (mask & word)
                        SG_SPRINT("1");
                    else
                        SG_SPRINT("0");

                    mask>>=1;
                }
            }
        }

        template <class T1,class T2>
            static void qsort_index(T1* output, T2* index, uint32_t size);

        template <class T1,class T2>
            static void qsort_backward_index(
                T1* output, T2* index, int32_t size);

        template <class T1,class T2>
            inline static void parallel_qsort_index(T1* output, T2* index, uint32_t size, int32_t n_threads, int32_t limit=262144)
            {
                int32_t n=0;
                thread_qsort<T1,T2> t;
                t.output=output;
                t.index=index;
                t.size=size;
                t.qsort_threads=&n;
                t.sort_limit=limit;
                t.num_threads=n_threads;
                parallel_qsort_index<T1,T2>(&t);
            }


        template <class T1,class T2>
            static void* parallel_qsort_index(void* p);


        /* finds the smallest element in output and puts that element as the
           first element  */
        template <class T>
            static void min(float64_t* output, T* index, int32_t size);

        /* finds the n smallest elements in output and puts these elements as the
           first n elements  */
        template <class T>
            static void nmin(
                float64_t* output, T* index, int32_t size, int32_t n);




        /* finds an element in a sorted array via binary search
         * returns -1 if not found */
        template <class T>
            static int32_t binary_search_helper(T* output, int32_t size, T elem)
            {
                int32_t start=0;
                int32_t end=size-1;

                if (size<1)
                    return 0;

                while (start<end)
                {
                    int32_t middle=(start+end)/2;

                    if (output[middle]>elem)
                        end=middle-1;
                    else if (output[middle]<elem)
                        start=middle+1;
                    else
                        return middle;
                }

                return start;
            }

        /* finds an element in a sorted array via binary search
         *     * returns -1 if not found */
        template <class T>
            static inline int32_t binary_search(T* output, int32_t size, T elem)
            {
                int32_t ind = binary_search_helper(output, size, elem);
                if (ind >= 0 && output[ind] == elem)
                    return ind;
                return -1;
            }

        /* Finds an element in a sorted array of pointers via binary search
         * Every element is dereferenced once before being compared
         *
         * @param array array of pointers to search in (assumed being sorted)
         * @param length length of array
         * @param elem pointer to element to search for
         * @return index of elem, -1 if not found */
        template<class T>
            static inline int32_t binary_search(T** vector, index_t length,
                    T* elem)
            {
                int32_t start=0;
                int32_t end=length-1;

                if (length<1)
                    return -1;

                while (start<end)
                {
                    int32_t middle=(start+end)/2;

                    if (*vector[middle]>*elem)
                        end=middle-1;
                    else if (*vector[middle]<*elem)
                        start=middle+1;
                    else
                    {
                        start=middle;
                        break;
                    }
                }

                if (start>=0&&*vector[start]==*elem)
                    return start;

                return -1;
            }

        template <class T>
            static int32_t binary_search_max_lower_equal(
                T* output, int32_t size, T elem)
            {
                int32_t ind = binary_search_helper(output, size, elem);

                if (output[ind]<=elem)
                    return ind;
                if (ind>0 && output[ind-1] <= elem)
                    return ind-1;
                return -1;
            }

        static float64_t Align(
            char * seq1, char* seq2, int32_t l1, int32_t l2, float64_t gapCost);



        inline static uint32_t get_seed()
        {
            return CMath::seed;
        }

        inline static uint32_t get_log_range()
        {
            return CMath::LOGRANGE;
        }

#ifdef USE_LOGCACHE

        inline static uint32_t get_log_accuracy()
        {
            return CMath::LOGACCURACY;
        }
#endif

        inline static int is_finite(double f)
        {
#if defined(isfinite) && !defined(SUNOS)
            return isfinite(f);
#else
            return finite(f);
#endif
        }

        inline static int is_infinity(double f)
        {
#ifdef SUNOS
            if (fpclass(f) == FP_NINF || fpclass(f) == FP_PINF)
                return 1;
            else
                return 0;
#else
            return isinf(f);
#endif
        }

        inline static int is_nan(double f)
        {
#ifdef SUNOS
            return isnand(f);
#else
            return isnan(f);
#endif
        }

#ifdef USE_LOGCACHE
        static inline float64_t logarithmic_sum(float64_t p, float64_t q)
        {
            float64_t diff;

            if (!CMath::is_finite(p))
                return q;

            if (!CMath::is_finite(q))
            {
                SG_SWARNING("INVALID second operand to logsum(%f,%f) expect undefined results\n", p, q);
                return NAN;
            }
            diff = p - q;
            if (diff > 0)
                return diff > LOGRANGE? p : p + logtable[(int)(diff * LOGACCURACY)];
            return -diff > LOGRANGE? q : q + logtable[(int)(-diff * LOGACCURACY)];
        }

        static void init_log_table();

        static int32_t determine_logrange();

        static int32_t determine_logaccuracy(int32_t range);
#else
        static inline float64_t logarithmic_sum(
                float64_t p, float64_t q)
        {
            float64_t diff;

            if (!CMath::is_finite(p))
                return q;
            if (!CMath::is_finite(q))
                return p;
            diff = p - q;
            if (diff > 0)
                return diff > LOGRANGE? p : p + log(1 + exp(-diff));
            return -diff > LOGRANGE? q : q + log(1 + exp(diff));
        }
#endif
#ifdef USE_LOGSUMARRAY

                static inline float64_t logarithmic_sum_array(
                    float64_t *p, int32_t len)
                {
                    if (len<=2)
                    {
                        if (len==2)
                            return logarithmic_sum(p[0],p[1]) ;
                        if (len==1)
                            return p[0];
                        return -INFTY ;
                    }
                    else
                    {
                        register float64_t *pp=p ;
                        if (len%2==1) pp++ ;
                        for (register int32_t j=0; j < len>>1; j++)
                            pp[j]=logarithmic_sum(pp[j<<1], pp[1+(j<<1)]) ;
                    }
                    return logarithmic_sum_array(p,len%2 + (len>>1)) ;
                }
#endif //USE_LOGSUMARRAY


                virtual const char* get_name() const { return "Mathematics"; }
    public:

                static const float64_t INFTY;
                static const float64_t ALMOST_INFTY;

                static const float64_t ALMOST_NEG_INFTY;

                static const float64_t PI;

                static const float64_t MACHINE_EPSILON;

                /* largest and smallest possible float64_t */
                static const float64_t MAX_REAL_NUMBER;
                static const float64_t MIN_REAL_NUMBER;

    protected:
                static int32_t LOGRANGE;

                static uint32_t seed;
                static char* rand_state;

#ifdef USE_LOGCACHE

                static int32_t LOGACCURACY;

                static float64_t* logtable;
#endif
};

//implementations of template functions
template <class T1,class T2>
void* CMath::parallel_qsort_index(void* p)
    {
        struct thread_qsort<T1,T2>* ps=(thread_qsort<T1,T2>*) p;
        T1* output=ps->output;
        T2* index=ps->index;
        uint32_t size=ps->size;
        int32_t* qsort_threads=ps->qsort_threads;
        int32_t sort_limit=ps->sort_limit;
        int32_t num_threads=ps->num_threads;

        if (size==2)
        {
            if (output[0] > output [1])
            {
                swap(output[0], output[1]);
                swap(index[0], index[1]);
            }
            return NULL;
        }
        //T1 split=output[random(0,size-1)];
        T1 split=output[size/2];

        int32_t left=0;
        int32_t right=size-1;

        while (left<=right)
        {
            while (output[left] < split)
                left++;
            while (output[right] > split)
                right--;

            if (left<=right)
            {
                swap(output[left], output[right]);
                swap(index[left], index[right]);
                left++;
                right--;
            }
        }
        bool lthread_start=false;
        bool rthread_start=false;
        pthread_t lthread;
        pthread_t rthread;
        struct thread_qsort<T1,T2> t1;
        struct thread_qsort<T1,T2> t2;

        if (right+1> 1 && (right+1< sort_limit || *qsort_threads >= num_threads-1))
            qsort_index(output,index,right+1);
        else if (right+1> 1)
        {
            (*qsort_threads)++;
            lthread_start=true;
            t1.output=output;
            t1.index=index;
            t1.size=right+1;
            t1.qsort_threads=qsort_threads;
            t1.sort_limit=sort_limit;
            t1.num_threads=num_threads;
            if (pthread_create(&lthread, NULL, parallel_qsort_index<T1,T2>, &t1) != 0)
            {
                lthread_start=false;
                (*qsort_threads)--;
                qsort_index(output,index,right+1);
            }
        }


        if (size-left> 1 && (size-left< sort_limit || *qsort_threads >= num_threads-1))
            qsort_index(&output[left],&index[left], size-left);
        else if (size-left> 1)
        {
            (*qsort_threads)++;
            rthread_start=true;
            t2.output=&output[left];
            t2.index=&index[left];
            t2.size=size-left;
            t2.qsort_threads=qsort_threads;
            t2.sort_limit=sort_limit;
            t2.num_threads=num_threads;
            if (pthread_create(&rthread, NULL, parallel_qsort_index<T1,T2>, &t2) != 0)
            {
                rthread_start=false;
                (*qsort_threads)--;
                qsort_index(&output[left],&index[left], size-left);
            }
        }

        if (lthread_start)
        {
            pthread_join(lthread, NULL);
            (*qsort_threads)--;
        }

        if (rthread_start)
        {
            pthread_join(rthread, NULL);
            (*qsort_threads)--;
        }

        return NULL;
    }

    template <class T1,class T2>
void CMath::qsort_index(T1* output, T2* index, uint32_t size)
{
    if (size==1)
        return;

    if (size==2)
    {
        if (output[0] > output [1])
        {
            swap(output[0],output[1]);
            swap(index[0],index[1]);
        }
        return;
    }
    //T1 split=output[random(0,size-1)];
    T1 split=output[size/2];

    int32_t left=0;
    int32_t right=size-1;

    while (left<=right)
    {
        while (output[left] < split)
            left++;
        while (output[right] > split)
            right--;

        if (left<=right)
        {
            swap(output[left],output[right]);
            swap(index[left],index[right]);
            left++;
            right--;
        }
    }

    if (right+1> 1)
        qsort_index(output,index,right+1);

    if (size-left> 1)
        qsort_index(&output[left],&index[left], size-left);
}

    template <class T1,class T2>
void CMath::qsort_backward_index(T1* output, T2* index, int32_t size)
{
    if (size==2)
    {
        if (output[0] < output [1])
        {
            swap(output[0],output[1]);
            swap(index[0],index[1]);
        }
        return;
    }

    //T1 split=output[random(0,size-1)];
    T1 split=output[size/2];

    int32_t left=0;
    int32_t right=size-1;

    while (left<=right)
    {
        while (output[left] > split)
            left++;
        while (output[right] < split)
            right--;

        if (left<=right)
        {
            swap(output[left],output[right]);
            swap(index[left],index[right]);
            left++;
            right--;
        }
    }

    if (right+1> 1)
        qsort_backward_index(output,index,right+1);

    if (size-left> 1)
        qsort_backward_index(&output[left],&index[left], size-left);
}

    template <class T>
void CMath::nmin(float64_t* output, T* index, int32_t size, int32_t n)
{
    if (6*n*size<13*size*CMath::log(size))
        for (int32_t i=0; i<n; i++)
            min(&output[i], &index[i], size-i) ;
    else
        qsort_index(output, index, size) ;
}

/* move the smallest entry in the array to the beginning */
    template <class T>
void CMath::min(float64_t* output, T* index, int32_t size)
{
    if (size<=1)
        return;
    float64_t min_elem=output[0];
    int32_t min_index=0;
    for (int32_t i=1; i<size; i++)
    {
        if (output[i]<min_elem)
        {
            min_index=i;
            min_elem=output[i];
        }
    }
    swap(output[0], output[min_index]);
    swap(index[0], index[min_index]);
}
}
#endif