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, 2019
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
34#include <gecode/int/rel.hh>
35
36namespace Gecode { namespace Int { namespace Order {
37
38 forceinline
39 OrderProp::OrderProp(Home home, IntView _s0, int _p0, IntView _s1, int _p1,
40 BoolView _b)
41 : Propagator(home), s0(_s0), s1(_s1), b(_b), p0(_p0), p1(_p1) {
42 s0.subscribe(home,*this,PC_INT_BND);
43 s1.subscribe(home,*this,PC_INT_BND);
44 b.subscribe(home,*this,PC_INT_VAL);
45 }
46
47 forceinline ExecStatus
48 OrderProp::post(Home home, IntView s0, int p0, IntView s1, int p1,
49 BoolView b) {
50 if (s0.max() + p0 <= s1.min()) {
51 GECODE_ME_CHECK(b.zero(home));
52 } else if (s1.max() + p1 <= s0.min()) {
53 GECODE_ME_CHECK(b.one(home));
54 } else if ((s1.min() + p1 > s0.max()) || b.zero()) {
55 GECODE_ME_CHECK(b.zero(home));
56 return Rel::Lq<OffsetView,IntView>::post(home,OffsetView(s0,p0),s1);
57 } else if ((s0.min() + p0 > s1.max()) || b.one()) {
58 GECODE_ME_CHECK(b.one(home));
59 return Rel::Lq<OffsetView,IntView>::post(home,OffsetView(s1,p1),s0);
60 } else {
61 (void) new (home) OrderProp(home,s0,p0,s1,p1,b);
62 }
63 return ES_OK;
64 }
65
66 forceinline
67 OrderProp::OrderProp(Space& home, OrderProp& p)
68 : Propagator(home,p), p0(p.p0), p1(p.p1) {
69 s0.update(home,p.s0);
70 s1.update(home,p.s1);
71 b.update(home,p.b);
72 }
73
74}}}
75
76// STATISTICS: int-prop