Jip J. Dekker
3e72b0e857
git-subtree-dir: software/gecode_on_record git-subtree-split: 37ed9bda495ea87e63217c19a374b5a93bb0078e
121 lines
5.1 KiB
C++
121 lines
5.1 KiB
C++
/* Boost interval/rounded_arith.hpp template implementation file
|
|
*
|
|
* Copyright 2002-2003 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion
|
|
*
|
|
* Distributed under the Boost Software License, Version 1.0.
|
|
* (See accompanying file LICENSE_1_0.txt or
|
|
* copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
*/
|
|
|
|
#ifndef GECODE_BOOST_NUMERIC_INTERVAL_ROUNDED_ARITH_HPP
|
|
#define GECODE_BOOST_NUMERIC_INTERVAL_ROUNDED_ARITH_HPP
|
|
|
|
#include <gecode/third-party/boost/numeric/interval/rounding.hpp>
|
|
#include <gecode/third-party/boost/numeric/interval/detail/bugs.hpp>
|
|
#include <gecode/third-party/boost/config/no_tr1/cmath.hpp>
|
|
|
|
namespace gecode_boost {
|
|
namespace numeric {
|
|
namespace interval_lib {
|
|
|
|
/*
|
|
* Three classes of rounding: exact, std, opp
|
|
* See documentation for details.
|
|
*/
|
|
|
|
template<class T, class Rounding>
|
|
struct rounded_arith_exact: Rounding {
|
|
void init() { }
|
|
template<class U> T conv_down(U const &v) { return v; }
|
|
template<class U> T conv_up (U const &v) { return v; }
|
|
T add_down (const T& x, const T& y) { return x + y; }
|
|
T add_up (const T& x, const T& y) { return x + y; }
|
|
T sub_down (const T& x, const T& y) { return x - y; }
|
|
T sub_up (const T& x, const T& y) { return x - y; }
|
|
T mul_down (const T& x, const T& y) { return x * y; }
|
|
T mul_up (const T& x, const T& y) { return x * y; }
|
|
T div_down (const T& x, const T& y) { return x / y; }
|
|
T div_up (const T& x, const T& y) { return x / y; }
|
|
T median (const T& x, const T& y) { return (x + y) / 2; }
|
|
T sqrt_down(const T& x)
|
|
{ GECODE_BOOST_NUMERIC_INTERVAL_using_math(sqrt); return sqrt(x); }
|
|
T sqrt_up (const T& x)
|
|
{ GECODE_BOOST_NUMERIC_INTERVAL_using_math(sqrt); return sqrt(x); }
|
|
T int_down (const T& x)
|
|
{ GECODE_BOOST_NUMERIC_INTERVAL_using_math(floor); return floor(x); }
|
|
T int_up (const T& x)
|
|
{ GECODE_BOOST_NUMERIC_INTERVAL_using_math(ceil); return ceil(x); }
|
|
};
|
|
|
|
template<class T, class Rounding>
|
|
struct rounded_arith_std: Rounding {
|
|
# define GECODE_BOOST_DN(EXPR) this->downward(); return this->force_rounding(EXPR)
|
|
# define GECODE_BOOST_NR(EXPR) this->to_nearest(); return this->force_rounding(EXPR)
|
|
# define GECODE_BOOST_UP(EXPR) this->upward(); return this->force_rounding(EXPR)
|
|
void init() { }
|
|
template<class U> T conv_down(U const &v) { GECODE_BOOST_DN(v); }
|
|
template<class U> T conv_up (U const &v) { GECODE_BOOST_UP(v); }
|
|
T add_down(const T& x, const T& y) { GECODE_BOOST_DN(x + y); }
|
|
T sub_down(const T& x, const T& y) { GECODE_BOOST_DN(x - y); }
|
|
T mul_down(const T& x, const T& y) { GECODE_BOOST_DN(x * y); }
|
|
T div_down(const T& x, const T& y) { GECODE_BOOST_DN(x / y); }
|
|
T add_up (const T& x, const T& y) { GECODE_BOOST_UP(x + y); }
|
|
T sub_up (const T& x, const T& y) { GECODE_BOOST_UP(x - y); }
|
|
T mul_up (const T& x, const T& y) { GECODE_BOOST_UP(x * y); }
|
|
T div_up (const T& x, const T& y) { GECODE_BOOST_UP(x / y); }
|
|
T median(const T& x, const T& y) { GECODE_BOOST_NR((x + y) / 2); }
|
|
T sqrt_down(const T& x)
|
|
{ GECODE_BOOST_NUMERIC_INTERVAL_using_math(sqrt); GECODE_BOOST_DN(sqrt(x)); }
|
|
T sqrt_up (const T& x)
|
|
{ GECODE_BOOST_NUMERIC_INTERVAL_using_math(sqrt); GECODE_BOOST_UP(sqrt(x)); }
|
|
T int_down(const T& x) { this->downward(); return this->to_int(x); }
|
|
T int_up (const T& x) { this->upward(); return this->to_int(x); }
|
|
# undef GECODE_BOOST_DN
|
|
# undef GECODE_BOOST_NR
|
|
# undef GECODE_BOOST_UP
|
|
};
|
|
|
|
template<class T, class Rounding>
|
|
struct rounded_arith_opp: Rounding {
|
|
void init() { this->upward(); }
|
|
# define GECODE_BOOST_DN(EXPR) \
|
|
this->downward(); \
|
|
T r = this->force_rounding(EXPR); \
|
|
this->upward(); \
|
|
return r
|
|
# define GECODE_BOOST_NR(EXPR) \
|
|
this->to_nearest(); \
|
|
T r = this->force_rounding(EXPR); \
|
|
this->upward(); \
|
|
return r
|
|
# define GECODE_BOOST_UP(EXPR) return this->force_rounding(EXPR)
|
|
# define GECODE_BOOST_UP_NEG(EXPR) return -this->force_rounding(EXPR)
|
|
template<class U> T conv_down(U const &v) { GECODE_BOOST_UP_NEG(-v); }
|
|
template<class U> T conv_up (U const &v) { GECODE_BOOST_UP(v); }
|
|
T add_down(const T& x, const T& y) { GECODE_BOOST_UP_NEG((-x) - y); }
|
|
T sub_down(const T& x, const T& y) { GECODE_BOOST_UP_NEG(y - x); }
|
|
T mul_down(const T& x, const T& y) { GECODE_BOOST_UP_NEG(x * (-y)); }
|
|
T div_down(const T& x, const T& y) { GECODE_BOOST_UP_NEG(x / (-y)); }
|
|
T add_up (const T& x, const T& y) { GECODE_BOOST_UP(x + y); }
|
|
T sub_up (const T& x, const T& y) { GECODE_BOOST_UP(x - y); }
|
|
T mul_up (const T& x, const T& y) { GECODE_BOOST_UP(x * y); }
|
|
T div_up (const T& x, const T& y) { GECODE_BOOST_UP(x / y); }
|
|
T median (const T& x, const T& y) { GECODE_BOOST_NR((x + y) / 2); }
|
|
T sqrt_down(const T& x)
|
|
{ GECODE_BOOST_NUMERIC_INTERVAL_using_math(sqrt); GECODE_BOOST_DN(sqrt(x)); }
|
|
T sqrt_up (const T& x)
|
|
{ GECODE_BOOST_NUMERIC_INTERVAL_using_math(sqrt); GECODE_BOOST_UP(sqrt(x)); }
|
|
T int_down(const T& x) { return -this->to_int(-x); }
|
|
T int_up (const T& x) { return this->to_int(x); }
|
|
# undef GECODE_BOOST_DN
|
|
# undef GECODE_BOOST_NR
|
|
# undef GECODE_BOOST_UP
|
|
# undef GECODE_BOOST_UP_NEG
|
|
};
|
|
|
|
} // namespace interval_lib
|
|
} // namespace numeric
|
|
} // namespace gecode_boost
|
|
|
|
#endif // GECODE_BOOST_NUMERIC_INTERVAL_ROUNDED_ARITH_HPP
|