1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Guido Tack <tack@gecode.org>
* Christian Schulte <schulte@gecode.org>
*
* Contributing authors:
* Gabor Szokoli <szokoli@gecode.org>
*
* Copyright:
* Guido Tack, 2004
* Christian Schulte, 2004
* Gabor Szokoli, 2004
*
* 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.
*
*/
namespace Gecode { namespace Set { namespace Rel {
template<class View0, class View1>
forceinline
Eq<View0,View1>::Eq(Home home, View0 x, View1 y)
: MixBinaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>(home,x,y) {}
template<class View0, class View1>
forceinline
Eq<View0,View1>::Eq(Space& home, Eq& p)
: MixBinaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>(home,p) {}
template<class View0, class View1>
ExecStatus
Eq<View0,View1>::post(Home home, View0 x, View1 y) {
if (!same(x,y))
(void) new (home) Eq(home,x,y);
return ES_OK;
}
template<class View0, class View1>
Actor*
Eq<View0,View1>::copy(Space& home) {
return new (home) Eq(home,*this);
}
template<class View0, class View1>
ExecStatus
Eq<View0,View1>::propagate(Space& home, const ModEventDelta& med) {
ModEvent me0 = View0::me(med);
ModEvent me1 = View1::me(med);
Region r;
if (testSetEventLB(me0,me1)) {
GlbRanges<View0> x0lb(x0);
GlbRanges<View1> x1lb(x1);
Iter::Ranges::Union<GlbRanges<View0>,GlbRanges<View1> > lbu(x0lb,x1lb);
Iter::Ranges::Cache lbuc(r,lbu);
GECODE_ME_CHECK(x0.includeI(home,lbuc));
lbuc.reset();
GECODE_ME_CHECK(x1.includeI(home,lbuc));
}
if (testSetEventUB(me0,me1)) {
LubRanges<View0> x0ub(x0);
LubRanges<View1> x1ub(x1);
Iter::Ranges::Inter<LubRanges<View0>,LubRanges<View1> > ubi(x0ub,x1ub);
Iter::Ranges::Cache ubic(r,ubi);
GECODE_ME_CHECK(x0.intersectI(home,ubic));
ubic.reset();
GECODE_ME_CHECK(x1.intersectI(home,ubic));
}
if (testSetEventCard(me0,me1)) {
unsigned int max = std::min(x0.cardMax(),x1.cardMax());
unsigned int min = std::max(x0.cardMin(),x1.cardMin());
GECODE_ME_CHECK(x0.cardMax(home,max));
GECODE_ME_CHECK(x1.cardMax(home,max));
GECODE_ME_CHECK(x0.cardMin(home,min));
GECODE_ME_CHECK(x1.cardMin(home,min));
}
if (x0.assigned()) {
assert (x1.assigned());
return home.ES_SUBSUMED(*this);
}
return shared(x0,x1) ? ES_NOFIX : ES_FIX;
}
}}}
// STATISTICS: set-prop
|
