maths.h

Go to the documentation of this file.

#ifndef MATHS_H
#define MATHS_H
#include "coroutines.h"
#include "error.h"
 
namespace original {
 
constexpr l_floating E = 2.7182818284590452353602874713526624977572470937000;
 
constexpr l_floating PI = 3.1415926535897932384626433832795028841971693993751;
 
template<typename TYPE>
TYPE abs(TYPE a);
 
template<typename TYPE>
TYPE maximum(TYPE a, TYPE b);
 
template<typename TYPE>
TYPE minimum(TYPE a, TYPE b);
 
floating pow(floating base, integer exp);
 
template<std::integral INTEGER = int>
coroutine::generator<INTEGER> rangesOf(INTEGER start, INTEGER end, INTEGER steps = 1);
 
} // namespace original
 
// ----------------- Definitions of maths.h -----------------
 
template<typename TYPE>
auto original::abs(TYPE a) -> TYPE
{
    return a > TYPE{} ? a : -a;
}
 
template<typename TYPE>
auto original::maximum(TYPE a, TYPE b) -> TYPE
{
    return a > b ? a : b;
}
 
template<typename TYPE>
auto original::minimum(TYPE a, TYPE b) -> TYPE
{
    return a < b ? a : b;
}
 
inline auto original::pow(const floating base, const integer exp) -> floating
{
    if (base == 0 && exp <= 0)
    {
        throw valueError();
    }
    floating res = 1.0;
    for (integer i = 0; i < abs(exp); i += 1)
    {
        res *= base;
    }
    return exp >= 0 ? res : 1 / res;
}
 
template <std::integral INTEGER>
original::coroutine::generator<INTEGER> original::rangesOf(INTEGER start, INTEGER end, INTEGER steps)
{
    if (steps == 0 || (start - end) * steps > 0) {
        co_return;
    }
    if (steps > 0) {
        for (INTEGER i = start; i < end; i += steps) {
            co_yield i;
        }
    } else {
        for (INTEGER i = start; i > end; i += steps) {
            co_yield i;
        }
    }
}
 
#endif //MATHS_H