Generated on Thu Feb 21 2013 23:11:42 for Gecode by doxygen 1.8.3.1
link-multi.hpp
Go to the documentation of this file.
1 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2 /*
3  * Main authors:
4  * Christian Schulte <schulte@gecode.org>
5  *
6  * Copyright:
7  * Christian Schulte, 2007
8  *
9  * Last modified:
10  * $Date: 2012-02-22 16:04:20 +1100 (Wed, 22 Feb 2012) $ by $Author: tack $
11  * $Revision: 12537 $
12  *
13  * This file is part of Gecode, the generic constraint
14  * development environment:
15  * http://www.gecode.org
16  *
17  * Permission is hereby granted, free of charge, to any person obtaining
18  * a copy of this software and associated documentation files (the
19  * "Software"), to deal in the Software without restriction, including
20  * without limitation the rights to use, copy, modify, merge, publish,
21  * distribute, sublicense, and/or sell copies of the Software, and to
22  * permit persons to whom the Software is furnished to do so, subject to
23  * the following conditions:
24  *
25  * The above copyright notice and this permission notice shall be
26  * included in all copies or substantial portions of the Software.
27  *
28  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
29  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
31  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
32  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
33  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
34  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35  *
36  */
37 
38 namespace Gecode { namespace Int { namespace Channel {
39 
41  LinkMulti::LinkMulti(Home home, ViewArray<BoolView>& x, IntView y, int o0)
42  : MixNaryOnePropagator<BoolView,PC_BOOL_NONE,IntView,PC_INT_DOM>
43  (home,x,y), c(home), status(S_NONE), o(o0) {
44  x.subscribe(home,*new (home) Advisor(home,*this,c));
45  // Propagator is scheduled because of the dependency subscription
46  }
47 
50  int n=x.size();
51  GECODE_ME_CHECK(y.gq(home,o));
52  GECODE_ME_CHECK(y.lq(home,o+n-1));
53  assert(n > 0);
54  if (n == 1) {
55  GECODE_ME_CHECK(x[0].one(home));
56  assert(y.val() == o);
57  } else if (y.assigned()) {
58  int j=y.val()-o;
59  GECODE_ME_CHECK(x[j].one(home));
60  for (int i=0; i<j; i++)
61  GECODE_ME_CHECK(x[i].zero(home));
62  for (int i=j+1; i<n; i++)
63  GECODE_ME_CHECK(x[i].zero(home));
64  } else {
65  for (int i=n; i--; )
66  if (x[i].one()) {
67  for (int j=0; j<i; j++)
68  GECODE_ME_CHECK(x[j].zero(home));
69  for (int j=i+1; j<n; j++)
70  GECODE_ME_CHECK(x[j].zero(home));
71  GECODE_ME_CHECK(y.eq(home,o+i));
72  return ES_OK;
73  } else if (x[i].zero()) {
74  GECODE_ME_CHECK(y.nq(home,o+i));
75  }
76  (void) new (home) LinkMulti(home,x,y,o);
77  }
78  return ES_OK;
79  }
80 
81 }}}
82 
83 // STATISTICS: int-prop
84