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
|
/* -*- 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.
*
*/
#include <gecode/set/convex.hh>
namespace Gecode { namespace Set { namespace Convex {
Actor*
ConvexHull::copy(Space& home) {
return new (home) ConvexHull(home,*this);
}
ExecStatus
ConvexHull::propagate(Space& home, const ModEventDelta&) {
//x1 is the convex hull of x0
GECODE_ME_CHECK( x1.cardMin(home,x0.cardMin()) );
GECODE_ME_CHECK( x0.cardMax(home,x1.cardMax()) );
do {
//intersect x1 with (x0.lubMin(),x0.lubMax())
//This empties x1 if x0.ub is empty. twice.
GECODE_ME_CHECK( x1.exclude(home,Limits::min,
x0.lubMin()-1) );
GECODE_ME_CHECK( x1.exclude(home,x0.lubMax()+1,
Limits::max) );
int minElement = std::min(x1.glbMin(),x0.glbMin());
int maxElement = std::max(x1.glbMax(),x0.glbMax());
if (minElement<maxElement) {
GECODE_ME_CHECK( x1.include(home, minElement, maxElement));
}
unsigned int cardMin = x1.cardMin();
Region r;
LubRanges<SetView> ubRangeIt(x1);
Iter::Ranges::Cache ubRangeItC(r,ubRangeIt);
for (;ubRangeItC();++ubRangeItC) {
if (ubRangeItC.width() < cardMin
|| ubRangeItC.min() > minElement //No need to test for empty lb.
|| ubRangeItC.max() < maxElement
) {
GECODE_ME_CHECK( x1.exclude(home,
ubRangeItC.min(), ubRangeItC.max()) );
}
}
LubRanges<SetView> ubRangeIt2(x1);
GECODE_ME_CHECK(x0.intersectI(home,ubRangeIt2) );
if (x1.lubMin()!=BndSet::MIN_OF_EMPTY) {
if(x1.lubMin()==x1.glbMin()) {
GECODE_ME_CHECK(x0.include(home,x1.lubMin()));
}
if(x1.lubMax()==x1.glbMax()) {
GECODE_ME_CHECK(x0.include(home,x1.lubMax()));
}
}
} while(x0.assigned()&&!x1.assigned());
//If x0 is assigned, x1 should be too.
assert(x1.assigned() || !x0.assigned());
if (x1.assigned()) {
return home.ES_SUBSUMED(*this);
}
return ES_NOFIX;
}
}}}
// STATISTICS: set-prop
|
