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
130
131
132
133
134
135
136
137
138
139
140
141
|
/* -*- 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/sequence.hh>
namespace Gecode { namespace Set { namespace Sequence {
/*
* "Sequenced union" propagator
*
*/
Actor*
SeqU::copy(Space& home) {
return new (home) SeqU(home,*this);
}
ExecStatus
SeqU::propagateSeqUnion(Space& home,
bool& modified, ViewArray<SetView>& x,
SetView& y) {
Region r;
GlbRanges<SetView>* XLBs = r.alloc<GlbRanges<SetView> >(x.size());
for (int i=x.size(); i--; ) {
GlbRanges<SetView> lb(x[i]);
XLBs[i]=lb;
}
Iter::Ranges::NaryAppend<GlbRanges<SetView> > u(XLBs,x.size());
GECODE_ME_CHECK_MODIFIED(modified, y.includeI(home,u));
GLBndSet before(home);
for (int i=0; i<x.size(); i++) {
LubRanges<SetView> xiub(x[i]);
before.includeI(home, xiub);
BndSetRanges beforeR(before);
GlbRanges<SetView> ylb(y);
Iter::Ranges::Diff<GlbRanges<SetView>, BndSetRanges> diff(ylb, beforeR);
if (diff()) {
GECODE_ME_CHECK_MODIFIED(modified, x[i].exclude(home, diff.min(),
Limits::max));
}
}
before.dispose(home);
GLBndSet after(home);
for (int i=x.size(); i--; ) {
LubRanges<SetView> xiub(x[i]);
after.includeI(home, xiub);
BndSetRanges afterR(after);
GlbRanges<SetView> ylb(y);
Iter::Ranges::Diff<GlbRanges<SetView>, BndSetRanges> diff(ylb, afterR);
if (diff()) {
int max = diff.max();
for (; diff(); ++diff)
max = diff.max();
GECODE_ME_CHECK_MODIFIED(modified, x[i].exclude(home,
Limits::min,
max));
}
}
after.dispose(home);
return ES_FIX;
}
//Enforces sequentiality and ensures y contains union of Xi lower bounds.
ExecStatus
SeqU::propagate(Space& home, const ModEventDelta& med) {
ModEvent me0 = SetView::me(med);
bool ubevent = Rel::testSetEventUB(me0);
bool anybevent = Rel::testSetEventAnyB(me0);
bool cardevent = Rel::testSetEventCard(me0);
bool modified = false;
bool assigned=false;
bool oldModified = false;
do {
oldModified = modified;
modified = false;
if (oldModified || modified || anybevent || cardevent)
GECODE_ES_CHECK(propagateSeq(home,modified,assigned,x));
if (oldModified || modified || anybevent)
GECODE_ES_CHECK(propagateSeqUnion(home,modified,x,y));
if (oldModified || modified || ubevent)
GECODE_ES_CHECK(RelOp::unionNXiUB(home,modified,x,y,unionOfDets));
if (oldModified || modified || ubevent)
GECODE_ES_CHECK(RelOp::partitionNYUB(home,modified,x,y,unionOfDets));
if (oldModified || modified || anybevent)
GECODE_ES_CHECK(RelOp::partitionNXiLB(home,modified,x,y,unionOfDets));
if (oldModified || modified || cardevent || ubevent)
GECODE_ES_CHECK(RelOp::partitionNCard(home,modified,x,y,unionOfDets));
} while (modified);
for (int i=x.size(); i--;)
if (!x[i].assigned())
return ES_FIX;
return home.ES_SUBSUMED(*this);
}
}}}
// STATISTICS: set-prop
|
