this repo has no description
dekker.one
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 * This file is part of Gecode, the generic constraint
10 * development environment:
11 * http://www.gecode.org
12 *
13 * Permission is hereby granted, free of charge, to any person obtaining
14 * a copy of this software and associated documentation files (the
15 * "Software"), to deal in the Software without restriction, including
16 * without limitation the rights to use, copy, modify, merge, publish,
17 * distribute, sublicense, and/or sell copies of the Software, and to
18 * permit persons to whom the Software is furnished to do so, subject to
19 * the following conditions:
20 *
21 * The above copyright notice and this permission notice shall be
22 * included in all copies or substantial portions of the Software.
23 *
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31 *
32 */
33
34namespace Gecode { namespace Int {
35
36 template<class OptTask, class PL>
37 ExecStatus
38 purge(Space& home, Propagator& p, TaskArray<OptTask>& t) {
39 int n=t.size();
40 for (int i=n; i--; )
41 if (t[i].excluded()) {
42 t[i].cancel(home,p,PL::pc); t[i]=t[--n];
43 }
44 t.size(n);
45
46 return (t.size() < 2) ? home.ES_SUBSUMED(p) : ES_OK;
47 }
48
49 template<class OptTask, class PL, class Cap>
50 ExecStatus
51 purge(Space& home, Propagator& p, TaskArray<OptTask>& t, Cap c) {
52 int n=t.size();
53 for (int i=n; i--; )
54 if (t[i].excluded()) {
55 t[i].cancel(home,p,PL::pc); t[i]=t[--n];
56 }
57 t.size(n);
58 if (t.size() == 1) {
59 if (t[0].mandatory())
60 GECODE_ME_CHECK(c.gq(home, t[0].c()));
61 else if (c.min() < t[0].c())
62 return ES_OK;
63 }
64
65 return (t.size() < 2) ? home.ES_SUBSUMED(p) : ES_OK;
66 }
67
68}}
69
70// STATISTICS: int-prop