You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and dots ('.'), can be up to 35 characters long. Letters must be lowercase.
113 lines
3.3 KiB
113 lines
3.3 KiB
/* 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 BOOST_NUMERIC_INTERVAL_COMPARE_POSSIBLE_HPP |
|
#define BOOST_NUMERIC_INTERVAL_COMPARE_POSSIBLE_HPP |
|
|
|
#include <boost/numeric/interval/detail/interval_prototype.hpp> |
|
#include <boost/numeric/interval/detail/test_input.hpp> |
|
|
|
namespace 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 boost |
|
|
|
|
|
#endif // BOOST_NUMERIC_INTERVAL_COMPARE_POSSIBLE_HPP
|
|
|