explicit.hpp gecode/third-party/boost/numeric/interval/detail/interval_prototype.hpp /usr/include/gecode/third-party/boost/numeric/interval/compare.hpp gecode/third-party/boost/numeric/interval/detail/interval_prototype.hpp /usr/include/gecode/third-party/boost/numeric/interval/compare/explicit.hpp /usr/include/gecode/float.hh /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/third-party/boost/numeric/interval/compare/explicit.hpp /usr/include/gecode/float/branch.hh /usr/include/gecode/third-party/boost/numeric/interval/compare.hpp boost boost::numeric boost::numeric::interval_lib /*Boostinterval/compare/explicit.hpptemplateimplementationfile * *Copyright2000JensMaurer *Copyright2002HervéBrönnimann,GuillaumeMelquiond,SylvainPion * *DistributedundertheBoostSoftwareLicense,Version1.0. *(SeeaccompanyingfileLICENSE_1_0.txtor *copyathttp://www.boost.org/LICENSE_1_0.txt) */ #ifndefBOOST_NUMERIC_INTERVAL_COMPARE_EXPLICIT_HPP #defineBOOST_NUMERIC_INTERVAL_COMPARE_EXPLICIT_HPP #include<gecode/third-party/boost/numeric/interval/detail/interval_prototype.hpp> namespaceboost{ namespacenumeric{ namespaceinterval_lib{ /* *Certainly...operations */ template<classT,classPolicies1,classPolicies2>inline boolcerlt(constinterval<T,Policies1>&x,constinterval<T,Policies2>&y) { returnx.upper()<y.lower(); } template<classT,classPolicies>inline boolcerlt(constinterval<T,Policies>&x,constT&y) { returnx.upper()<y; } template<classT,classPolicies>inline boolcerlt(constT&x,constinterval<T,Policies>&y) { returnx<y.lower(); } template<classT,classPolicies1,classPolicies2>inline boolcerle(constinterval<T,Policies1>&x,constinterval<T,Policies2>&y) { returnx.upper()<=y.lower(); } template<classT,classPolicies>inline boolcerle(constinterval<T,Policies>&x,constT&y) { returnx.upper()<=y; } template<classT,classPolicies>inline boolcerle(constT&x,constinterval<T,Policies>&y) { returnx<=y.lower(); } template<classT,classPolicies1,classPolicies2>inline boolcergt(constinterval<T,Policies1>&x,constinterval<T,Policies2>&y) { returnx.lower()>y.upper(); } template<classT,classPolicies>inline boolcergt(constinterval<T,Policies>&x,constT&y) { returnx.lower()>y; } template<classT,classPolicies>inline boolcergt(constT&x,constinterval<T,Policies>&y) { returnx>y.upper(); } template<classT,classPolicies1,classPolicies2>inline boolcerge(constinterval<T,Policies1>&x,constinterval<T,Policies2>&y) { returnx.lower()>=y.upper(); } template<classT,classPolicies>inline boolcerge(constinterval<T,Policies>&x,constT&y) { returnx.lower()>=y; } template<classT,classPolicies>inline boolcerge(constT&x,constinterval<T,Policies>&y) { returnx>=y.upper(); } template<classT,classPolicies1,classPolicies2>inline boolcereq(constinterval<T,Policies1>&x,constinterval<T,Policies2>&y) { returnx.lower()==y.upper()&&y.lower()==x.upper(); } template<classT,classPolicies>inline boolcereq(constinterval<T,Policies>&x,constT&y) { returnx.lower()==y&&x.upper()==y; } template<classT,classPolicies>inline boolcereq(constT&x,constinterval<T,Policies>&y) { returnx==y.lower()&&x==y.upper(); } template<classT,classPolicies1,classPolicies2>inline boolcerne(constinterval<T,Policies1>&x,constinterval<T,Policies2>&y) { returnx.upper()<y.lower()||y.upper()<x.lower(); } template<classT,classPolicies>inline boolcerne(constinterval<T,Policies>&x,constT&y) { returnx.upper()<y||y<x.lower(); } template<classT,classPolicies>inline boolcerne(constT&x,constinterval<T,Policies>&y) { returnx<y.lower()||y.upper()<x; } /* *Possibly...comparisons */ template<classT,classPolicies1,classPolicies2>inline boolposlt(constinterval<T,Policies1>&x,constinterval<T,Policies2>&y) { returnx.lower()<y.upper(); } template<classT,classPolicies>inline boolposlt(constinterval<T,Policies>&x,constT&y) { returnx.lower()<y; } template<classT,classPolicies>inline boolposlt(constT&x,constinterval<T,Policies>&y) { returnx<y.upper(); } template<classT,classPolicies1,classPolicies2>inline boolposle(constinterval<T,Policies1>&x,constinterval<T,Policies2>&y) { returnx.lower()<=y.upper(); } template<classT,classPolicies>inline boolposle(constinterval<T,Policies>&x,constT&y) { returnx.lower()<=y; } template<classT,classPolicies>inline boolposle(constT&x,constinterval<T,Policies>&y) { returnx<=y.upper(); } template<classT,classPolicies1,classPolicies2>inline boolposgt(constinterval<T,Policies1>&x,constinterval<T,Policies2>&y) { returnx.upper()>y.lower(); } template<classT,classPolicies>inline boolposgt(constinterval<T,Policies>&x,constT&y) { returnx.upper()>y; } template<classT,classPolicies>inline boolposgt(constT&x,constinterval<T,Policies>&y) { returnx>y.lower(); } template<classT,classPolicies1,classPolicies2>inline boolposge(constinterval<T,Policies1>&x,constinterval<T,Policies2>&y) { returnx.upper()>=y.lower(); } template<classT,classPolicies>inline boolposge(constinterval<T,Policies>&x,constT&y) { returnx.upper()>=y; } template<classT,classPolicies>inline boolposge(constT&x,constinterval<T,Policies>&y) { returnx>=y.lower(); } template<classT,classPolicies1,classPolicies2>inline boolposeq(constinterval<T,Policies1>&x,constinterval<T,Policies2>&y) { returnx.upper()>=y.lower()&&y.upper()>=x.lower(); } template<classT,classPolicies>inline boolposeq(constinterval<T,Policies>&x,constT&y) { returnx.upper()>=y&&y>=x.lower(); } template<classT,classPolicies>inline boolposeq(constT&x,constinterval<T,Policies>&y) { returnx>=y.lower()&&y.upper()>=x; } template<classT,classPolicies1,classPolicies2>inline boolposne(constinterval<T,Policies1>&x,constinterval<T,Policies2>&y) { returnx.upper()!=y.lower()||y.upper()!=x.lower(); } template<classT,classPolicies>inline boolposne(constinterval<T,Policies>&x,constT&y) { returnx.upper()!=y||y!=x.lower(); } template<classT,classPolicies>inline boolposne(constT&x,constinterval<T,Policies>&y) { returnx!=y.lower()||y.upper()!=x; } }//namespaceinterval_lib }//namespacenumeric }//namespaceboost #endif//BOOST_NUMERIC_INTERVAL_COMPARE_EXPLICIT_HPP