util.h

Go to the documentation of this file.

/*
 * This program source code file is part of KICAD, a free EDA CAD application.
 *
 * Copyright (c) 2005 Michael Niedermayer <[email protected]>
 * Copyright (C) CERN
 * Copyright The KiCad Developers, see AUTHORS.txt for contributors.
 *
 * @author Tomasz Wlostowski <[email protected]>
 *
 * The equals() method to compare two floating point values adapted from
 * AlmostEqualRelativeAndAbs() on
 * https://randomascii.wordpress.com/2012/02/25/comparing-floating-point-numbers-2012-edition/
 * (C) Bruce Dawson subject to the Apache 2.0 license.
 *
 * 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 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <https://www.gnu.org/licenses/>.
 */
 
#ifndef UTIL_H
#define UTIL_H
 
#include <config.h>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <limits>
#include <typeinfo>
#include <type_traits>
#include <algorithm>

void kimathLogDebug( const char* aFormatString, ... );

void kimathLogOverflow( double v, const char* aTypeName );
 
 
// Suppress an annoying warning that the explicit rounding we do is not precise
#ifdef HAVE_WIMPLICIT_FLOAT_CONVERSION
    _Pragma( "GCC diagnostic push" ) \
    _Pragma( "GCC diagnostic ignored \"-Wimplicit-int-float-conversion\"" )
#endif
 

template <typename in_type = long long int, typename ret_type = int>
inline constexpr ret_type KiCheckedCast( in_type v )
{
    if constexpr( std::is_same_v<in_type, long long int> && std::is_same_v<ret_type, int> )
    {
        if( v > std::numeric_limits<int>::max() )
        {
            kimathLogOverflow( double( v ), typeid( int ).name() );
 
            return std::numeric_limits<int>::max();
        }
        else if( v < std::numeric_limits<int>::lowest() )
        {
            kimathLogOverflow( double( v ), typeid( int ).name() );
 
            return std::numeric_limits<int>::lowest();
        }
 
        return int( v );
    }
    else
    {
        return v;
    }
}
 

template <typename fp_type, typename ret_type = int>
constexpr ret_type KiROUND( fp_type v, bool aQuiet = false )
{
    using limits = std::numeric_limits<ret_type>;
 
#if __cplusplus >= 202302L // isnan is not constexpr until C++23
    if constexpr( std::is_floating_point_v<fp_type> )
    {
        if( std::isnan( v ) )
        {
            if( !aQuiet )
                kimathLogOverflow( double( v ), typeid( ret_type ).name() );
 
            return 0;
        }
    }
#endif
 
    long long rounded = std::llround( v );
    long long clamped = std::clamp<long long>( rounded,
                                              static_cast<long long>( limits::lowest() ),
                                              static_cast<long long>( limits::max() ) );
 
    if( !aQuiet && clamped != rounded )
        kimathLogOverflow( double( v ), typeid( ret_type ).name() );
 
    return static_cast<ret_type>( clamped );
}
 
#ifdef HAVE_WIMPLICIT_FLOAT_CONVERSION
    _Pragma( "GCC diagnostic pop" )
#endif

 
template <typename T>
T rescale( T aNumerator, T aValue, T aDenominator )
{
    return aNumerator * aValue / aDenominator;
}
 
template <typename T>
constexpr int sign( T val )
{
    return ( T( 0 ) < val) - ( val < T( 0 ) );
}
 
// explicit specializations for integer types, taking care of overflow.
template <>
int rescale( int aNumerator, int aValue, int aDenominator );
 
template <>
int64_t rescale( int64_t aNumerator, int64_t aValue, int64_t aDenominator );
 

template <class T>
typename std::enable_if<std::is_floating_point<T>::value, bool>::type
equals( T aFirst, T aSecond, T aEpsilon = std::numeric_limits<T>::epsilon() )
{
    const T diff = std::abs( aFirst - aSecond );
 
    if( diff < aEpsilon )
    {
        return true;
    }
 
    aFirst = std::abs( aFirst );
    aSecond = std::abs( aSecond );
    T largest = aFirst > aSecond ? aFirst : aSecond;
 
    if( diff <= largest * aEpsilon )
    {
        return true;
    }
 
    return false;
}
 
 
#endif // UTIL_H