Jip J. Dekker
981be2067e
git-subtree-dir: software/gecode_on_replay git-subtree-split: 8051d92b9c89e49cccfbd1c201371580d7703ab4
114 lines
3.4 KiB
C++
114 lines
3.4 KiB
C++
/* Boost interval/compare/possible.hpp template implementation file
|
|
*
|
|
* Copyright 2003 Guillaume Melquiond
|
|
*
|
|
* 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_COMPARE_POSSIBLE_HPP
|
|
#define GECODE_BOOST_NUMERIC_INTERVAL_COMPARE_POSSIBLE_HPP
|
|
|
|
#include <gecode/third-party/boost/numeric/interval/detail/interval_prototype.hpp>
|
|
#include <gecode/third-party/boost/numeric/interval/detail/test_input.hpp>
|
|
|
|
namespace gecode_boost {
|
|
namespace numeric {
|
|
namespace interval_lib {
|
|
namespace compare {
|
|
namespace possible {
|
|
|
|
template<class T, class Policies1, class Policies2> inline
|
|
bool operator<(const interval<T, Policies1>& x, const interval<T, Policies2>& y)
|
|
{
|
|
if (detail::test_input(x, y)) throw comparison_error();
|
|
return x.lower() < y.upper();
|
|
}
|
|
|
|
template<class T, class Policies> inline
|
|
bool operator<(const interval<T, Policies>& x, const T& y)
|
|
{
|
|
if (detail::test_input(x, y)) throw comparison_error();
|
|
return x.lower() < y;
|
|
}
|
|
|
|
template<class T, class Policies1, class Policies2> inline
|
|
bool operator<=(const interval<T, Policies1>& x, const interval<T, Policies2>& y)
|
|
{
|
|
if (detail::test_input(x, y)) throw comparison_error();
|
|
return x.lower() <= y.upper();
|
|
}
|
|
|
|
template<class T, class Policies> inline
|
|
bool operator<=(const interval<T, Policies>& x, const T& y)
|
|
{
|
|
if (detail::test_input(x, y)) throw comparison_error();
|
|
return x.lower() <= y;
|
|
}
|
|
|
|
template<class T, class Policies1, class Policies2> inline
|
|
bool operator>(const interval<T, Policies1>& x, const interval<T, Policies2>& y)
|
|
{
|
|
if (detail::test_input(x, y)) throw comparison_error();
|
|
return x.upper() > y.lower();
|
|
}
|
|
|
|
template<class T, class Policies> inline
|
|
bool operator>(const interval<T, Policies>& x, const T& y)
|
|
{
|
|
if (detail::test_input(x, y)) throw comparison_error();
|
|
return x.upper() > y;
|
|
}
|
|
|
|
template<class T, class Policies1, class Policies2> inline
|
|
bool operator>=(const interval<T, Policies1>& x, const interval<T, Policies2>& y)
|
|
{
|
|
if (detail::test_input(x, y)) throw comparison_error();
|
|
return x.upper() >= y.lower();
|
|
}
|
|
|
|
template<class T, class Policies> inline
|
|
bool operator>=(const interval<T, Policies>& x, const T& y)
|
|
{
|
|
if (detail::test_input(x, y)) throw comparison_error();
|
|
return x.upper() >= y;
|
|
}
|
|
|
|
template<class T, class Policies1, class Policies2> inline
|
|
bool operator==(const interval<T, Policies1>& x, const interval<T, Policies2>& y)
|
|
{
|
|
if (detail::test_input(x, y)) throw comparison_error();
|
|
return x.lower() <= y.upper() && x.upper() >= y.lower();
|
|
}
|
|
|
|
template<class T, class Policies> inline
|
|
bool operator==(const interval<T, Policies>& x, const T& y)
|
|
{
|
|
if (detail::test_input(x, y)) throw comparison_error();
|
|
return x.lower() <= y && x.upper() >= y;
|
|
}
|
|
|
|
template<class T, class Policies1, class Policies2> inline
|
|
bool operator!=(const interval<T, Policies1>& x, const interval<T, Policies2>& y)
|
|
{
|
|
if (detail::test_input(x, y)) throw comparison_error();
|
|
return x.lower() != y.upper() || x.upper() != y.lower();
|
|
}
|
|
|
|
template<class T, class Policies> inline
|
|
bool operator!=(const interval<T, Policies>& x, const T& y)
|
|
{
|
|
if (detail::test_input(x, y)) throw comparison_error();
|
|
return x.lower() != y || x.upper() != y;
|
|
}
|
|
|
|
} // namespace possible
|
|
} // namespace compare
|
|
} // namespace interval_lib
|
|
} // namespace numeric
|
|
} // namespace gecode_boost
|
|
|
|
|
|
#endif // GECODE_BOOST_NUMERIC_INTERVAL_COMPARE_POSSIBLE_HPP
|