Generated on Thu Mar 13 2014 04:39:33 for Gecode by doxygen 1.8.1.2
purge.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, 2009
8  *
9  * Last modified:
10  * $Date: 2011-07-13 02:03:22 +1000 (Wed, 13 Jul 2011) $ by $Author: tack $
11  * $Revision: 12176 $
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 {
39 
40  template<class OptTask, PropCond pc>
43  int n=t.size();
44  for (int i=n; i--; )
45  if (t[i].excluded()) {
46  t[i].cancel(home,p,pc); t[i]=t[--n];
47  }
48  t.size(n);
49 
50  return (t.size() < 2) ? home.ES_SUBSUMED(p) : ES_OK;
51  }
52 
53  template<class OptTask, PropCond pc, class Cap>
55  purge(Space& home, Propagator& p, TaskArray<OptTask>& t, Cap c) {
56  int n=t.size();
57  for (int i=n; i--; )
58  if (t[i].excluded()) {
59  t[i].cancel(home,p,pc); t[i]=t[--n];
60  }
61  t.size(n);
62  if (t.size() == 1) {
63  if (t[0].mandatory())
64  GECODE_ME_CHECK(c.gq(home, t[0].c()));
65  else if (c.min() < t[0].c())
66  return ES_OK;
67  }
68 
69  return (t.size() < 2) ? home.ES_SUBSUMED(p) : ES_OK;
70  }
71 
72 }}
73 
74 // STATISTICS: int-prop