gecode 中的变量比较
gecode中变量比较,如是否包括等是放在reltest这个文件中,代码很简单,需要注意的就是dom中能中间因为hole被分隔成为很多个部份,所以这里需要通过形如ViewRanges<VX> rx(x);进行遍历,需要下一个时直接++rx;
template<class VX, class VY> forceinline RelTest rtest_eq_bnd(VX x, VY y) { if ((x.min() > y.max()) || (x.max() < y.min())) return RT_FALSE; return (x.assigned() && y.assigned()) ? RT_TRUE : RT_MAYBE; } template<class VX, class VY> RelTest rtest_eq_dom_check(VX x, VY y) { ViewRanges<VX> rx(x); ViewRanges<VY> ry(y); while (rx() && ry()) { if (rx.max() < ry.min()) { ++rx; } else if (ry.max() < rx.min()) { ++ry; } else return RT_MAYBE; } return RT_FALSE; } template<class VX, class VY> forceinline RelTest rtest_eq_dom(VX x, VY y) { RelTest rt = rtest_eq_bnd(x,y); if (rt != RT_MAYBE) return rt; return (x.range() && y.range()) ? RT_MAYBE : rtest_eq_dom_check(x,y); } template<class VX> forceinline RelTest rtest_eq_bnd(VX x, int n) { if ((n > x.max()) || (n < x.min())) return RT_FALSE; return x.assigned() ? RT_TRUE : RT_MAYBE; } template<class VX> RelTest rtest_eq_dom_check(VX x, int n) { ViewRanges<VX> rx(x); while (n > rx.max()) ++rx; return (n >= rx.min()) ? RT_MAYBE : RT_FALSE; } template<class VX> forceinline RelTest rtest_eq_dom(VX x, int n) { RelTest rt = rtest_eq_bnd(x,n); if (rt != RT_MAYBE) return rt; return x.range() ? RT_MAYBE : rtest_eq_dom_check(x,n); } /* * Testing disequality * */ template<class VX, class VY> forceinline RelTest rtest_nq_bnd(VX x, VY y) { if ((x.min() > y.max()) || (x.max() < y.min())) return RT_TRUE; return (x.assigned() && y.assigned()) ? RT_FALSE : RT_MAYBE; } template<class VX, class VY> forceinline RelTest rtest_nq_dom_check(VX x, VY y) { ViewRanges<VX> rx(x); ViewRanges<VY> ry(y); while (rx() && ry()) { if (rx.max() < ry.min()) { ++rx; } else if (ry.max() < rx.min()) { ++ry; } else return RT_MAYBE; } return RT_TRUE; } template<class VX, class VY> forceinline RelTest rtest_nq_dom(VX x, VY y) { RelTest rt = rtest_nq_bnd(x,y); if (rt != RT_MAYBE) return rt; return (x.range() && y.range()) ? RT_MAYBE : rtest_nq_dom_check(x,y); } template<class VX> forceinline RelTest rtest_nq_bnd(VX x, int n) { if ((n > x.max()) || (n < x.min())) return RT_TRUE; return (x.assigned()) ? RT_FALSE : RT_MAYBE; } template<class VX> forceinline RelTest rtest_nq_dom_check(VX x, int n) { ViewRanges<VX> rx(x); while (n > rx.max()) ++rx; return (n >= rx.min()) ? RT_MAYBE : RT_TRUE; } template<class VX> forceinline RelTest rtest_nq_dom(VX x, int n) { RelTest rt = rtest_nq_bnd(x,n); if (rt != RT_MAYBE) return rt; return x.range() ? RT_MAYBE : rtest_nq_dom_check(x,n); } /* * Testing inequalities * */ template<class VX, class VY> forceinline RelTest rtest_lq(VX x, VY y) { if (x.max() <= y.min()) return RT_TRUE; if (x.min() > y.max()) return RT_FALSE; return RT_MAYBE; } template<class VX> forceinline RelTest rtest_lq(VX x, int n) { if (x.max() <= n) return RT_TRUE; if (x.min() > n) return RT_FALSE; return RT_MAYBE; } template<class VX, class VY> forceinline RelTest rtest_le(VX x, VY y) { if (x.max() < y.min()) return RT_TRUE; if (x.min() >= y.max()) return RT_FALSE; return RT_MAYBE; } template<class VX> forceinline RelTest rtest_le(VX x, int n) { if (x.max() < n) return RT_TRUE; if (x.min() >= n) return RT_FALSE; return RT_MAYBE; } template<class VX, class VY> forceinline RelTest rtest_gq(VX x, VY y) { if (x.max() < y.min()) return RT_FALSE; if (x.min() >= y.max()) return RT_TRUE; return RT_MAYBE; } template<class VX> forceinline RelTest rtest_gq(VX x, int n) { if (x.max() < n) return RT_FALSE; if (x.min() >= n) return RT_TRUE; return RT_MAYBE; } template<class VX, class VY> forceinline RelTest rtest_gr(VX x, VY y) { if (x.max() <= y.min()) return RT_FALSE; if (x.min() > y.max()) return RT_TRUE; return RT_MAYBE; } template<class VX> forceinline RelTest rtest_gr(VX x, int n) { if (x.max() <= n) return RT_FALSE; if (x.min() > n) return RT_TRUE; return RT_MAYBE; }