Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
7.6 kB · 300 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301/* -*- 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. * */
#include <gecode/int/rel.hh>
namespace Gecode { namespace Int { namespace Count {
/* * Counting domain consistent equality * */
template<class VY> forceinline bool isintset(VY y) { (void) y; return false; } template<> forceinline bool isintset(IntSet y) { (void) y; return true; }
template<class VY> forceinline bool isval(VY y) { return y.assigned(); } template<> forceinline bool isval(IntSet y) { (void) y; return true; }
forceinline void subscribe(Space& home, Propagator& p, IntSet& y) { (void) home; (void) p; (void) y; } template<class VY> forceinline void subscribe(Space& home, Propagator& p, VY y) { y.subscribe(home, p, PC_INT_DOM); }
forceinline void cancel(Space& home, Propagator& p, IntSet& y) { (void) home; (void) p; y.~IntSet(); } template<class VY> forceinline void cancel(Space& home, Propagator& p, VY y) { y.cancel(home, p, PC_INT_DOM); }
forceinline void reschedule(Space& home, Propagator& p, IntSet& y) { (void) home; (void) p; (void) y; } template<class VY> forceinline void reschedule(Space& home, Propagator& p, VY y) { (void) y; // To satisy MSVC y.schedule(home, p, PC_INT_DOM); }
forceinline void update(IntSet& y, Space& home, IntSet& py) { (void) home; y=py; } template<class VY> forceinline void update(VY& y, Space& home, VY py) { y.update(home, py); }
template<class VX> forceinline RelTest holds(VX x, ConstIntView y) { return rtest_eq_dom(x,y.val()); } template<class VX> forceinline RelTest holds(VX x, ZeroIntView) { return rtest_eq_dom(x,0); } template<class VX> forceinline RelTest holds(VX x, const IntSet& y) { if ((x.max() < y.min()) || (y.max() < x.min())) return RT_FALSE; ViewRanges<VX> rx(x); IntSetRanges ry(y); switch (Iter::Ranges::compare(rx,ry)) { case Iter::Ranges::CS_SUBSET: return RT_TRUE; case Iter::Ranges::CS_DISJOINT: return RT_FALSE; case Iter::Ranges::CS_NONE: return RT_MAYBE; default: GECODE_NEVER; } GECODE_NEVER; return RT_MAYBE; } template<class VX> forceinline RelTest holds(VX x, VX y) { return rtest_eq_dom(x,y); }
template<class VX> forceinline ExecStatus post_true(Home home, VX x, ConstIntView y) { GECODE_ME_CHECK(x.eq(home,y.val())); return ES_OK; } template<class VX> forceinline ExecStatus post_true(Home home, VX x, ZeroIntView) { GECODE_ME_CHECK(x.eq(home,0)); return ES_OK; } template<class VX> forceinline ExecStatus post_true(Home home, VX x, const IntSet& y) { IntSetRanges ry(y); GECODE_ME_CHECK(x.inter_r(home,ry,false)); return ES_OK; } template<class VX> forceinline ExecStatus post_true(Home home, ViewArray<VX>& x, ConstIntView y) { for (int i=0; i<x.size(); i++) GECODE_ME_CHECK(x[i].eq(home,y.val())); return ES_OK; } template<class VX> forceinline ExecStatus post_true(Home home, ViewArray<VX>& x, ZeroIntView) { for (int i=0; i<x.size(); i++) GECODE_ME_CHECK(x[i].eq(home,0)); return ES_OK; } template<class VX> forceinline ExecStatus post_true(Home home, ViewArray<VX>& x, const IntSet& y) { for (int i=0; i<x.size(); i++) { IntSetRanges ry(y); GECODE_ME_CHECK(x[i].inter_r(home,ry,false)); } return ES_OK; }
template<class VX> forceinline ExecStatus post_false(Home home, VX x, ConstIntView y) { GECODE_ME_CHECK(x.nq(home,y.val())); return ES_OK; } template<class VX> forceinline ExecStatus post_false(Home home, VX x, ZeroIntView) { GECODE_ME_CHECK(x.nq(home,0)); return ES_OK; } template<class VX> forceinline ExecStatus post_false(Home home, VX x, const IntSet& y) { IntSetRanges ry(y); GECODE_ME_CHECK(x.minus_r(home,ry,false)); return ES_OK; } template<class VX> forceinline ExecStatus post_false(Home home, ViewArray<VX>& x, ConstIntView y) { for (int i=0; i<x.size(); i++) GECODE_ME_CHECK(x[i].nq(home,y.val())); return ES_OK; } template<class VX> forceinline ExecStatus post_false(Home home, ViewArray<VX>& x, ZeroIntView) { for (int i=0; i<x.size(); i++) GECODE_ME_CHECK(x[i].nq(home,0)); return ES_OK; } template<class VX> forceinline ExecStatus post_false(Home home, ViewArray<VX>& x, const IntSet& y) { for (int i=0; i<x.size(); i++) { IntSetRanges ry(y); GECODE_ME_CHECK(x[i].minus_r(home,ry,false)); } return ES_OK; }
template<class VX> forceinline ExecStatus post_true(Home home, ViewArray<VX>& x, VX y) { ViewArray<VX> z(home,x.size()+1); z[x.size()] = y; for (int i=0; i<x.size(); i++) z[i] = x[i]; return Rel::NaryEqDom<VX>::post(home,z); } template<class VX> forceinline ExecStatus post_true(Home home, VX x, VX y) { return Rel::EqDom<VX,VX>::post(home,x,y); } template<class VX> forceinline ExecStatus post_false(Home home, ViewArray<VX>& x, VX y) { for (int i=0; i<x.size(); i++) GECODE_ES_CHECK((Rel::Nq<VX,VX>::post(home,x[i],y))); return ES_OK; } template<class VX> forceinline ExecStatus post_false(Home home, VX x, VX y) { return Rel::Nq<VX,VX>::post(home,x,y); }
template<class VX> forceinline ExecStatus prune(Space& home, ViewArray<VX>& x, ConstIntView) { (void) home; (void) x; return ES_OK; } template<class VX> forceinline ExecStatus prune(Space& home, ViewArray<VX>& x, ZeroIntView) { (void) home; (void) x; return ES_OK; } template<class VX> forceinline ExecStatus prune(Space& home, ViewArray<VX>& x, const IntSet& y) { (void) home; (void) x; (void) y; return ES_OK; } template<class VX> forceinline ExecStatus prune(Space& home, ViewArray<VX>& x, VX y) { if (x.size() == 0) return ES_OK; Region r; ViewRanges<VX>* rx = r.alloc<ViewRanges<VX> >(x.size()); for (int i=0; i<x.size(); i++) rx[i] = ViewRanges<VX>(x[i]); Iter::Ranges::NaryUnion u(r, rx, x.size()); GECODE_ME_CHECK(y.inter_r(home, u, false)); return ES_OK; }
}}}
// STATISTICS: int-prop