Jip J. Dekker
2572df0663
git-subtree-dir: software/gecode_base git-subtree-split: bbefcea214fec798a0f5acc442581984555acd21
108 lines
2.8 KiB
C++
108 lines
2.8 KiB
C++
/* Boost interval/compare/set.hpp template implementation file
|
|
*
|
|
* Copyright 2002-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_SET_HPP
|
|
#define GECODE_BOOST_NUMERIC_INTERVAL_COMPARE_SET_HPP
|
|
|
|
#include <gecode/third-party/boost/numeric/interval/detail/interval_prototype.hpp>
|
|
#include <gecode/third-party/boost/numeric/interval/detail/test_input.hpp>
|
|
#include <gecode/third-party/boost/numeric/interval/utility.hpp>
|
|
|
|
namespace gecode_boost {
|
|
namespace numeric {
|
|
namespace interval_lib {
|
|
namespace compare {
|
|
namespace set {
|
|
|
|
template<class T, class Policies1, class Policies2> inline
|
|
bool operator<(const interval<T, Policies1>& x, const interval<T, Policies2>& y)
|
|
{
|
|
return proper_subset(x, y);
|
|
}
|
|
|
|
template<class T, class Policies> inline
|
|
bool operator<(const interval<T, Policies>& x, const T& y)
|
|
{
|
|
(void)x; (void)y;
|
|
throw comparison_error();
|
|
}
|
|
|
|
template<class T, class Policies1, class Policies2> inline
|
|
bool operator<=(const interval<T, Policies1>& x, const interval<T, Policies2>& y)
|
|
{
|
|
return subset(x, y);
|
|
}
|
|
|
|
template<class T, class Policies> inline
|
|
bool operator<=(const interval<T, Policies>& x, const T& y)
|
|
{
|
|
(void)x; (void)y;
|
|
throw comparison_error();
|
|
}
|
|
|
|
template<class T, class Policies1, class Policies2> inline
|
|
bool operator>(const interval<T, Policies1>& x, const interval<T, Policies2>& y)
|
|
{
|
|
return proper_subset(y, x);
|
|
}
|
|
|
|
template<class T, class Policies> inline
|
|
bool operator>(const interval<T, Policies>& x, const T& y)
|
|
{
|
|
(void)x; (void)y;
|
|
throw comparison_error();
|
|
}
|
|
|
|
template<class T, class Policies1, class Policies2> inline
|
|
bool operator>=(const interval<T, Policies1>& x, const interval<T, Policies2>& y)
|
|
{
|
|
return subset(y, x);
|
|
}
|
|
|
|
template<class T, class Policies> inline
|
|
bool operator>=(const interval<T, Policies>& x, const T& y)
|
|
{
|
|
(void)x; (void)y;
|
|
throw comparison_error();
|
|
}
|
|
|
|
template<class T, class Policies1, class Policies2> inline
|
|
bool operator==(const interval<T, Policies1>& x, const interval<T, Policies2>& y)
|
|
{
|
|
return equal(y, x);
|
|
}
|
|
|
|
template<class T, class Policies> inline
|
|
bool operator==(const interval<T, Policies>& x, const T& y)
|
|
{
|
|
(void)x; (void)y;
|
|
throw comparison_error();
|
|
}
|
|
|
|
template<class T, class Policies1, class Policies2> inline
|
|
bool operator!=(const interval<T, Policies1>& x, const interval<T, Policies2>& y)
|
|
{
|
|
return !equal(y, x);
|
|
}
|
|
|
|
template<class T, class Policies> inline
|
|
bool operator!=(const interval<T, Policies>& x, const T& y)
|
|
{
|
|
(void)x; (void)y;
|
|
throw comparison_error();
|
|
}
|
|
|
|
} // namespace set
|
|
} // namespace compare
|
|
} // namespace interval_lib
|
|
} // namespace numeric
|
|
} // namespace gecode_boost
|
|
|
|
#endif // GECODE_BOOST_NUMERIC_INTERVAL_COMPARE_SET_HPP
|