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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 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 Int { namespace Dom {
template<class View, ReifyMode rm>
forceinline
ReIntSet<View,rm>::ReIntSet
(Home home, View x, const IntSet& s, BoolView b)
: ReUnaryPropagator<View,PC_INT_DOM,BoolView>(home,x,b), is(s) {
home.notice(*this,AP_DISPOSE);
}
template<class View, ReifyMode rm>
forceinline size_t
ReIntSet<View,rm>::dispose(Space& home) {
home.ignore(*this,AP_DISPOSE);
is.~IntSet();
(void) ReUnaryPropagator<View,PC_INT_DOM,BoolView>::dispose(home);
return sizeof(*this);
}
template<class View, ReifyMode rm>
ExecStatus
ReIntSet<View,rm>::post(Home home, View x, const IntSet& s, BoolView b) {
if (s.ranges() == 0) {
if (rm == RM_PMI)
return ES_OK;
GECODE_ME_CHECK(b.zero(home));
} else if (s.ranges() == 1) {
return ReRange<View,rm>::post(home,x,s.min(),s.max(),b);
} else if (b.one()) {
if (rm == RM_PMI)
return ES_OK;
IntSetRanges i_is(s);
GECODE_ME_CHECK(x.inter_r(home,i_is,false));
} else if (b.zero()) {
if (rm == RM_IMP)
return ES_OK;
IntSetRanges i_is(s);
GECODE_ME_CHECK(x.minus_r(home,i_is,false));
} else {
(void) new (home) ReIntSet<View,rm>(home,x,s,b);
}
return ES_OK;
}
template<class View, ReifyMode rm>
forceinline
ReIntSet<View,rm>::ReIntSet(Space& home, ReIntSet& p)
: ReUnaryPropagator<View,PC_INT_DOM,BoolView>(home,p), is(p.is) {
}
template<class View, ReifyMode rm>
Actor*
ReIntSet<View,rm>::copy(Space& home) {
return new (home) ReIntSet(home,*this);
}
template<class View, ReifyMode rm>
ExecStatus
ReIntSet<View,rm>::propagate(Space& home, const ModEventDelta&) {
IntSetRanges i_is(is);
if (b.one()) {
if (rm != RM_PMI)
GECODE_ME_CHECK(x0.inter_r(home,i_is,false));
return home.ES_SUBSUMED(*this);
}
if (b.zero()) {
if (rm != RM_IMP)
GECODE_ME_CHECK(x0.minus_r(home,i_is,false));
return home.ES_SUBSUMED(*this);
}
{
ViewRanges<View> i_x(x0);
switch (Iter::Ranges::compare(i_x,i_is)) {
case Iter::Ranges::CS_SUBSET:
if (rm != RM_IMP)
GECODE_ME_CHECK(b.one_none(home));
return home.ES_SUBSUMED(*this);
case Iter::Ranges::CS_DISJOINT:
if (rm != RM_PMI)
GECODE_ME_CHECK(b.zero_none(home));
return home.ES_SUBSUMED(*this);
case Iter::Ranges::CS_NONE:
break;
default: GECODE_NEVER;
}
}
return ES_FIX;
}
}}}
// STATISTICS: int-prop
|
