Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
5.8 kB · 229 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * * Copyright: * Christian Schulte, 2003 * * This file is part of Gecode, the generic constraint * development environment: * http://www.gecode.org * * Permission is hereby granted, free of charge, to any person obtaining * a copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be * included in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. * */
namespace Gecode { namespace Int {
/* * Testing equality * */
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; }
}}
// STATISTICS: int-var