libdpf/include/grotto/gadgets/powers/reciprocal.hpp

/// @file grotto/gadgets/powers/reciprocal.hpp
/// @author Ryan Henry <ryan.henry@ucalgary.ca>
/// @brief Cleartext reference for `reciprocal`.
/// @copyright Copyright (c) 2019-2023 Ryan Henry and others
/// @license Released under a GNU General Public v2.0 (GPLv2) license;
///          see [LICENSE.md](@ref license) for details.

#ifndef LIBDPF_INCLUDE_GROTTO_GADGETS_POWERS_RECIPROCAL_HPP__
#define LIBDPF_INCLUDE_GROTTO_GADGETS_POWERS_RECIPROCAL_HPP__

#include <cmath>
#include <array>
#include <limits>

#include "grotto/gadget_hints.hpp"

namespace grotto
{

namespace gadgets
{

HEDLEY_DIAGNOSTIC_PUSH
HEDLEY_DIAGNOSTIC_DISABLE_DEPRECATED


/// @brief Cleartext `reciprocal`.
/// @see grotto::eval_reduced
/// @note Straight-line cleartext. Fixed-point evaluation is the symbol in `@see` when that symbol is a LUT or an `eval_*` function.
/// \complexity One evaluation of `operator()` as written in this header. There is no domain scan and no loop. `Θ(1)` time and extra space relative to that expression.
struct HEDLEY_DEPRECATED_FOR(2026, grotto::eval_reduced) reciprocal
{
    /// @brief Evaluate the cleartext map.
    /// @tparam T argument and result type
    /// @param x the input
    /// @return the cleartext image of `x`
    /// \complexity The body is straight-line. `Θ(1)` time and extra space.
    template <typename T>
    T operator()(T x)
    {
        if (x == 0) return 0; // TODO
        if (x < 0) return std::max(1.0 / static_cast<double>(x), std::numeric_limits<T>::min());
        if (x > 0) return std::min(1.0 / static_cast<double>(x), std::numeric_limits<T>::max());
    }
};

template <>
struct gadget_hints<reciprocal>
{
    static constexpr double min = std::numeric_limits<double>::min();
    static constexpr double max = std::numeric_limits<double>::max();
    static constexpr double poles[] = { 0 };
    static constexpr double interesting_points[] = { 0 };
    static constexpr unsigned degree = 3;
    static constexpr bool has_canonical_representation = false;
    static constexpr double canonical_bounds[] = { };
    static constexpr std::array<double, degree+1> canonical_polys[] = { };
};

HEDLEY_DIAGNOSTIC_POP

}  // namespace gadgets

}  // namespace grotto

#endif  // LIBDPF_INCLUDE_GROTTO_GADGETS_POWERS_RECIPROCAL_HPP__