numeric.h

Go to the documentation of this file.

/*
 *  Copyright (c) 2000-2022 Inria
 *  All rights reserved.
 *
 *  Redistribution and use in source and binary forms, with or without
 *  modification, are permitted provided that the following conditions are met:
 *
 *  * Redistributions of source code must retain the above copyright notice,
 *  this list of conditions and the following disclaimer.
 *  * Redistributions in binary form must reproduce the above copyright notice,
 *  this list of conditions and the following disclaimer in the documentation
 *  and/or other materials provided with the distribution.
 *  * Neither the name of the ALICE Project-Team nor the names of its
 *  contributors may be used to endorse or promote products derived from this
 *  software without specific prior written permission.
 *
 *  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 *  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 *  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 *  ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
 *  LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 *  CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 *  SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 *  INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 *  CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 *  ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 *  POSSIBILITY OF SUCH DAMAGE.
 *
 *  Contact: Bruno Levy
 *
 *     https://www.inria.fr/fr/bruno-levy
 *
 *     Inria,
 *     Domaine de Voluceau,
 *     78150 Le Chesnay - Rocquencourt
 *     FRANCE
 *
 */
 
#ifndef GEOGRAM_BASIC_NUMERIC
#define GEOGRAM_BASIC_NUMERIC
 
#include <geogram/basic/common.h>
#include <cmath>
#include <float.h>
#include <limits.h>
#include <algorithm> // for std::min / std::max
#include <stdint.h>
#include <limits>
#include <type_traits>
 
#ifndef M_PI
#define M_PI 3.14159265358979323846
#endif
 
namespace GEO {
 
    enum Sign {
        NEGATIVE = -1,
        ZERO = 0,
        POSITIVE = 1
    };
 
 
    template <class T>
    inline Sign geo_cmp(const T& a, const T& b) {
        return Sign((a > b) - (a < b));
    }
 
 
    template <class T>
    inline Sign geo_sgn(const T& x) {
        return geo_cmp(x, T(0));
    }
 
    namespace Numeric {
 
        typedef void* pointer;
 
        typedef int8_t int8;
 
        typedef int16_t int16;
 
        typedef int32_t int32;
 
        typedef int64_t int64;
 
        typedef uint8_t uint8;
 
        typedef uint16_t uint16;
 
        typedef uint32_t uint32;
 
        typedef uint64_t uint64;
 
        typedef float float32;
 
        typedef double float64;
 
        inline float32 max_float32() {
            return std::numeric_limits<float32>::max();
        }
 
        inline float32 min_float32() {
            // Note: numeric_limits<>::min() is not
            // what we want (it returns the smallest
            // positive non-denormal).
            return -max_float32();
        }
 
        inline float64 max_float64() {
            return std::numeric_limits<float64>::max();
        }
 
        inline float64 min_float64() {
            // Note: numeric_limits<>::min() is not
            // what we want (it returns the smallest
            // positive non-denormal).
            return -max_float64();
        }
 
        bool GEOGRAM_API is_nan(float32 x);
 
        bool GEOGRAM_API is_nan(float64 x);
 
        void GEOGRAM_API random_reset();
 
        int32 GEOGRAM_API random_int32();
 
        float32 GEOGRAM_API random_float32();
 
        float64 GEOGRAM_API random_float64();
 
        template <class T, bool is_numeric>
        struct LimitsHelper : std::numeric_limits<T> {
        };
 
        template <class T>
        struct LimitsHelper<T, true> : std::numeric_limits<T> {
            static const size_t size = sizeof(T);
            static const size_t numbits = 8 * sizeof(T);
        };
 
        template <class T>
        struct Limits :
            LimitsHelper<T, std::numeric_limits<T>::is_specialized> {
        };
 
        template <class T> inline void optimize_number_representation(T& x) {
            geo_argused(x);
        }
 
        template <class T> inline Sign ratio_compare(
            const T& a_num, const T& a_denom, const T& b_num, const T& b_denom
        ) {
            if(a_denom == b_denom) {
                return Sign(geo_cmp(a_num,b_num)*geo_sgn(a_denom));
            }
            return Sign(
                geo_cmp(a_num*b_denom, b_num*a_denom) *
                geo_sgn(a_denom) * geo_sgn(b_denom)
            );
        }
    }
 
    /************************************************************************/
 
 
    template <class T>
    inline T geo_sqr(T x) {
        return x * x;
    }
 
    template <class T>
    inline void geo_clamp(T& x, T min, T max) {
        if(x < min) {
            x = min;
        } else if(x > max) {
            x = max;
        }
    }
 
    typedef geo_index_t index_t;
 
    inline index_t max_index_t() {
        return std::numeric_limits<index_t>::max();
    }
 
    typedef geo_signed_index_t signed_index_t;
 
    inline signed_index_t max_signed_index_t() {
        return std::numeric_limits<signed_index_t>::max();
    }
 
    inline signed_index_t min_signed_index_t() {
        return std::numeric_limits<signed_index_t>::min();
    }
 
    typedef geo_coord_index_t coord_index_t;
 
    inline double round(double x) {
        return ((x - floor(x)) > 0.5 ? ceil(x) : floor(x));
    }
 
    /************************************************************************/
 
    static constexpr index_t NO_INDEX = index_t(-1);
 
    /************************************************************************/
 
    template <class T> struct is_scalar {
        typedef typename std::is_arithmetic<T>::type type;
        static constexpr bool value = std::is_arithmetic<T>::value;
    };
 
    /************************************************************************/
}
 
#endif