490e837f7a
.../
... + -- EO
| |
| |
+-- src ----- + -- EDO
| |
| |
+-- test + -- MO
| |
| |
+-- tutorial + -- MOEO
| |
| |
+-- doc + -- SMP
| |
| |
... + -- EOMPI
|
|
+ -- EOSERIAL
Question for current maintainers: ./README: new release?
Also:
* Moving out eompi & eoserial modules (issue #2).
* Correction of the errors when executing "make doc" command.
* Adding a solution for the conflicting headers problem (see the two CMake Cache
Values: PROJECT_TAG & PROJECT_HRS_INSTALL_SUBPATH) (issue #1)
* Header inclusions:
** src: changing absolute paths into relative paths ('#include <...>' -> '#include "..."')
** test, tutorial: changing relative paths into absolute paths ('#include "..."' -> '#include <...>')
* Moving out some scripts from EDO -> to the root
* Add a new script for compilation and installation (see build_gcc_linux_install)
* Compilation with uBLAS library or EDO module: now ok
* Minor modifications on README & INSTALL files
* Comment eompi failed tests with no end
*** TODO: CPack (debian (DEB) & RedHat (RPM) packages) (issues #6 & #7) ***
212 lines
6.8 KiB
C++
Executable file
212 lines
6.8 KiB
C++
Executable file
/* Boost interval/arith2.hpp template implementation file
|
|
*
|
|
* This header provides some auxiliary arithmetic
|
|
* functions: fmod, sqrt, square, pov, inverse and
|
|
* a multi-interval division.
|
|
*
|
|
* 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 BOOST_NUMERIC_INTERVAL_ARITH2_HPP
|
|
#define BOOST_NUMERIC_INTERVAL_ARITH2_HPP
|
|
|
|
#include <boost/config.hpp>
|
|
#include <boost/numeric/interval/detail/interval_prototype.hpp>
|
|
#include <boost/numeric/interval/detail/test_input.hpp>
|
|
#include <boost/numeric/interval/detail/bugs.hpp>
|
|
#include <boost/numeric/interval/detail/division.hpp>
|
|
#include <boost/numeric/interval/arith.hpp>
|
|
#include <boost/numeric/interval/policies.hpp>
|
|
#include <algorithm>
|
|
#include <cmath>
|
|
|
|
namespace boost {
|
|
namespace numeric {
|
|
|
|
template<class T, class Policies> inline
|
|
interval<T, Policies> fmod(const interval<T, Policies>& x,
|
|
const interval<T, Policies>& y)
|
|
{
|
|
if (interval_lib::detail::test_input(x, y))
|
|
return interval<T, Policies>::empty();
|
|
typename Policies::rounding rnd;
|
|
typedef typename interval_lib::unprotect<interval<T, Policies> >::type I;
|
|
T const &yb = interval_lib::user::is_neg(x.lower()) ? y.lower() : y.upper();
|
|
T n = rnd.int_down(rnd.div_down(x.lower(), yb));
|
|
return (const I&)x - n * (const I&)y;
|
|
}
|
|
|
|
template<class T, class Policies> inline
|
|
interval<T, Policies> fmod(const interval<T, Policies>& x, const T& y)
|
|
{
|
|
if (interval_lib::detail::test_input(x, y))
|
|
return interval<T, Policies>::empty();
|
|
typename Policies::rounding rnd;
|
|
typedef typename interval_lib::unprotect<interval<T, Policies> >::type I;
|
|
T n = rnd.int_down(rnd.div_down(x.lower(), y));
|
|
return (const I&)x - n * I(y);
|
|
}
|
|
|
|
template<class T, class Policies> inline
|
|
interval<T, Policies> fmod(const T& x, const interval<T, Policies>& y)
|
|
{
|
|
if (interval_lib::detail::test_input(x, y))
|
|
return interval<T, Policies>::empty();
|
|
typename Policies::rounding rnd;
|
|
typedef typename interval_lib::unprotect<interval<T, Policies> >::type I;
|
|
T const &yb = interval_lib::user::is_neg(x) ? y.lower() : y.upper();
|
|
T n = rnd.int_down(rnd.div_down(x, yb));
|
|
return x - n * (const I&)y;
|
|
}
|
|
|
|
namespace interval_lib {
|
|
|
|
template<class T, class Policies> inline
|
|
interval<T, Policies> division_part1(const interval<T, Policies>& x,
|
|
const interval<T, Policies>& y, bool& b)
|
|
{
|
|
typedef interval<T, Policies> I;
|
|
b = false;
|
|
if (detail::test_input(x, y))
|
|
return I::empty();
|
|
if (in_zero(y))
|
|
if (!user::is_zero(y.lower()))
|
|
if (!user::is_zero(y.upper()))
|
|
return detail::div_zero_part1(x, y, b);
|
|
else
|
|
return detail::div_negative(x, y.lower());
|
|
else
|
|
if (!user::is_zero(y.upper()))
|
|
return detail::div_positive(x, y.upper());
|
|
else
|
|
return I::empty();
|
|
else
|
|
return detail::div_non_zero(x, y);
|
|
}
|
|
|
|
template<class T, class Policies> inline
|
|
interval<T, Policies> division_part2(const interval<T, Policies>& x,
|
|
const interval<T, Policies>& y, bool b = true)
|
|
{
|
|
if (!b) return interval<T, Policies>::empty();
|
|
return detail::div_zero_part2(x, y);
|
|
}
|
|
|
|
template<class T, class Policies> inline
|
|
interval<T, Policies> multiplicative_inverse(const interval<T, Policies>& x)
|
|
{
|
|
typedef interval<T, Policies> I;
|
|
if (detail::test_input(x))
|
|
return I::empty();
|
|
T one = static_cast<T>(1);
|
|
typename Policies::rounding rnd;
|
|
if (in_zero(x)) {
|
|
typedef typename Policies::checking checking;
|
|
if (!user::is_zero(x.lower()))
|
|
if (!user::is_zero(x.upper()))
|
|
return I::whole();
|
|
else
|
|
return I(checking::neg_inf(), rnd.div_up(one, x.lower()), true);
|
|
else
|
|
if (!user::is_zero(x.upper()))
|
|
return I(rnd.div_down(one, x.upper()), checking::pos_inf(), true);
|
|
else
|
|
return I::empty();
|
|
} else
|
|
return I(rnd.div_down(one, x.upper()), rnd.div_up(one, x.lower()), true);
|
|
}
|
|
|
|
namespace detail {
|
|
|
|
template<class T, class Rounding> inline
|
|
T pow_aux(const T& x_, int pwr, Rounding& rnd) // x and pwr are positive
|
|
{
|
|
T x = x_;
|
|
T y = (pwr & 1) ? x_ : static_cast<T>(1);
|
|
pwr >>= 1;
|
|
while (pwr > 0) {
|
|
x = rnd.mul_up(x, x);
|
|
if (pwr & 1) y = rnd.mul_up(x, y);
|
|
pwr >>= 1;
|
|
}
|
|
return y;
|
|
}
|
|
|
|
} // namespace detail
|
|
} // namespace interval_lib
|
|
|
|
template<class T, class Policies> inline
|
|
interval<T, Policies> pow(const interval<T, Policies>& x, int pwr)
|
|
{
|
|
BOOST_USING_STD_MAX();
|
|
using interval_lib::detail::pow_aux;
|
|
typedef interval<T, Policies> I;
|
|
|
|
if (interval_lib::detail::test_input(x))
|
|
return I::empty();
|
|
|
|
if (pwr == 0)
|
|
if (interval_lib::user::is_zero(x.lower())
|
|
&& interval_lib::user::is_zero(x.upper()))
|
|
return I::empty();
|
|
else
|
|
return I(static_cast<T>(1));
|
|
else if (pwr < 0)
|
|
return interval_lib::multiplicative_inverse(pow(x, -pwr));
|
|
|
|
typename Policies::rounding rnd;
|
|
|
|
if (interval_lib::user::is_neg(x.upper())) { // [-2,-1]
|
|
T yl = pow_aux(-x.upper(), pwr, rnd);
|
|
T yu = pow_aux(-x.lower(), pwr, rnd);
|
|
if (pwr & 1) // [-2,-1]^1
|
|
return I(-yu, -yl, true);
|
|
else // [-2,-1]^2
|
|
return I(yl, yu, true);
|
|
} else if (interval_lib::user::is_neg(x.lower())) { // [-1,1]
|
|
if (pwr & 1) { // [-1,1]^1
|
|
return I(-pow_aux(-x.lower(), pwr, rnd), pow_aux(x.upper(), pwr, rnd), true);
|
|
} else { // [-1,1]^2
|
|
return I(static_cast<T>(0), pow_aux(max BOOST_PREVENT_MACRO_SUBSTITUTION(-x.lower(), x.upper()), pwr, rnd), true);
|
|
}
|
|
} else { // [1,2]
|
|
return I(pow_aux(x.lower(), pwr, rnd), pow_aux(x.upper(), pwr, rnd), true);
|
|
}
|
|
}
|
|
|
|
template<class T, class Policies> inline
|
|
interval<T, Policies> sqrt(const interval<T, Policies>& x)
|
|
{
|
|
typedef interval<T, Policies> I;
|
|
if (interval_lib::detail::test_input(x) || interval_lib::user::is_neg(x.upper()))
|
|
return I::empty();
|
|
typename Policies::rounding rnd;
|
|
T l = !interval_lib::user::is_pos(x.lower()) ? static_cast<T>(0) : rnd.sqrt_down(x.lower());
|
|
return I(l, rnd.sqrt_up(x.upper()), true);
|
|
}
|
|
|
|
template<class T, class Policies> inline
|
|
interval<T, Policies> square(const interval<T, Policies>& x)
|
|
{
|
|
typedef interval<T, Policies> I;
|
|
if (interval_lib::detail::test_input(x))
|
|
return I::empty();
|
|
typename Policies::rounding rnd;
|
|
const T& xl = x.lower();
|
|
const T& xu = x.upper();
|
|
if (interval_lib::user::is_neg(xu))
|
|
return I(rnd.mul_down(xu, xu), rnd.mul_up(xl, xl), true);
|
|
else if (interval_lib::user::is_pos(x.lower()))
|
|
return I(rnd.mul_down(xl, xl), rnd.mul_up(xu, xu), true);
|
|
else
|
|
return I(static_cast<T>(0), (-xl > xu ? rnd.mul_up(xl, xl) : rnd.mul_up(xu, xu)), true);
|
|
}
|
|
|
|
} // namespace numeric
|
|
} // namespace boost
|
|
|
|
#endif // BOOST_NUMERIC_INTERVAL_ARITH2_HPP
|