lexicographic.hpp gecode/third-party/boost/numeric/interval/detail/interval_prototype.hpp gecode/third-party/boost/numeric/interval/detail/test_input.hpp /usr/include/gecode/third-party/boost/numeric/interval/compare.hpp gecode/third-party/boost/numeric/interval/detail/test_input.hpp /usr/include/gecode/third-party/boost/numeric/interval/compare/lexicographic.hpp gecode/third-party/boost/numeric/interval/detail/interval_prototype.hpp /usr/include/gecode/float.hh /usr/include/gecode/third-party/boost/numeric/interval/compare/lexicographic.hpp /usr/include/gecode/third-party/boost/numeric/interval.hpp /usr/include/gecode/float/rel.hh /usr/include/gecode/float/arithmetic.hh /usr/include/gecode/float/linear.hh /usr/include/gecode/float/branch.hh /usr/include/gecode/third-party/boost/numeric/interval/compare.hpp boost boost::numeric boost::numeric::interval_lib boost::numeric::interval_lib::compare boost::numeric::interval_lib::compare::lexicographic /*Boostinterval/compare/lexicographic.hpptemplateimplementationfile * *Copyright2002-2003GuillaumeMelquiond * *DistributedundertheBoostSoftwareLicense,Version1.0. *(SeeaccompanyingfileLICENSE_1_0.txtor *copyathttp://www.boost.org/LICENSE_1_0.txt) */ #ifndefBOOST_NUMERIC_INTERVAL_COMPARE_LEXICOGRAPHIC_HPP #defineBOOST_NUMERIC_INTERVAL_COMPARE_LEXICOGRAPHIC_HPP #include<gecode/third-party/boost/numeric/interval/detail/interval_prototype.hpp> #include<gecode/third-party/boost/numeric/interval/detail/test_input.hpp> namespaceboost{ namespacenumeric{ namespaceinterval_lib{ namespacecompare{ namespacelexicographic{ template<classT,classPolicies1,classPolicies2>inline booloperator<(constinterval<T,Policies1>&x,constinterval<T,Policies2>&y) { if(detail::test_input(x,y))throwcomparison_error(); constT&xl=x.lower(); constT&yl=y.lower(); returnxl<yl||(xl==yl&&x.upper()<y.upper()); } template<classT,classPolicies>inline booloperator<(constinterval<T,Policies>&x,constT&y) { if(detail::test_input(x,y))throwcomparison_error(); returnx.lower()<y; } template<classT,classPolicies1,classPolicies2>inline booloperator<=(constinterval<T,Policies1>&x,constinterval<T,Policies2>&y) { if(detail::test_input(x,y))throwcomparison_error(); constT&xl=x.lower(); constT&yl=y.lower(); returnxl<yl||(xl==yl&&x.upper()<=y.upper()); } template<classT,classPolicies>inline booloperator<=(constinterval<T,Policies>&x,constT&y) { if(detail::test_input(x,y))throwcomparison_error(); constT&xl=x.lower(); returnxl<y||(xl==y&&x.upper()<=y); } template<classT,classPolicies1,classPolicies2>inline booloperator>(constinterval<T,Policies1>&x,constinterval<T,Policies2>&y) { if(detail::test_input(x,y))throwcomparison_error(); constT&xl=x.lower(); constT&yl=y.lower(); returnxl>yl||(xl==yl&&x.upper()>y.upper()); } template<classT,classPolicies>inline booloperator>(constinterval<T,Policies>&x,constT&y) { if(detail::test_input(x,y))throwcomparison_error(); constT&xl=x.lower(); returnxl>y||(xl==y&&x.upper()>y); } template<classT,classPolicies1,classPolicies2>inline booloperator>=(constinterval<T,Policies1>&x,constinterval<T,Policies2>&y) { if(detail::test_input(x,y))throwcomparison_error(); constT&xl=x.lower(); constT&yl=y.lower(); returnxl>yl||(xl==yl&&x.upper()>=y.upper()); } template<classT,classPolicies>inline booloperator>=(constinterval<T,Policies>&x,constT&y) { if(detail::test_input(x,y))throwcomparison_error(); returnx.lower()>=y; } template<classT,classPolicies1,classPolicies2>inline booloperator==(constinterval<T,Policies1>&x,constinterval<T,Policies2>&y) { if(detail::test_input(x,y))throwcomparison_error(); returnx.lower()==y.lower()&&x.upper()==y.upper(); } template<classT,classPolicies>inline booloperator==(constinterval<T,Policies>&x,constT&y) { if(detail::test_input(x,y))throwcomparison_error(); returnx.lower()==y&&x.upper()==y; } template<classT,classPolicies1,classPolicies2>inline booloperator!=(constinterval<T,Policies1>&x,constinterval<T,Policies2>&y) { if(detail::test_input(x,y))throwcomparison_error(); returnx.lower()!=y.lower()||x.upper()!=y.upper(); } template<classT,classPolicies>inline booloperator!=(constinterval<T,Policies>&x,constT&y) { if(detail::test_input(x,y))throwcomparison_error(); returnx.lower()!=y||x.upper()!=y; } }//namespacelexicographic }//namespacecompare }//namespaceinterval_lib }//namespacenumeric }//namespaceboost #endif//BOOST_NUMERIC_INTERVAL_COMPARE_LEXICOGRAPHIC_HPP