main page
modules
namespaces
classes
files
Gecode home
Generated on Tue Jan 28 2020 00:00:00 for Gecode by
doxygen
1.8.17
gecode
int
val-set.hpp
Go to the documentation of this file.
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, 2011
8
*
9
* Last modified:
10
* $Date: 2016-04-19 17:19:45 +0200 (Tue, 19 Apr 2016) $ by $Author: schulte $
11
* $Revision: 14967 $
12
*
13
* This file is part of Gecode, the generic constraint
14
* development environment:
15
* http://www.gecode.org
16
*
17
* Permission is hereby granted, free of charge, to any person obtaining
18
* a copy of this software and associated documentation files (the
19
* "Software"), to deal in the Software without restriction, including
20
* without limitation the rights to use, copy, modify, merge, publish,
21
* distribute, sublicense, and/or sell copies of the Software, and to
22
* permit persons to whom the Software is furnished to do so, subject to
23
* the following conditions:
24
*
25
* The above copyright notice and this permission notice shall be
26
* included in all copies or substantial portions of the Software.
27
*
28
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
29
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
31
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
32
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
33
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
34
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35
*
36
*/
37
38
namespace
Gecode
{
namespace
Int {
39
40
/*
41
* Value sets
42
*
43
*/
44
forceinline
45
ValSet::ValSet
(
void
)
46
: fst(NULL), lst(NULL),
n
(0) {}
47
48
forceinline
void
49
ValSet::add
(
Space
& home,
int
v
) {
50
RangeList
*
c
=
fst
;
51
RangeList
**
p
= &
fst
;
52
while
(
c
!= NULL) {
53
if
(v < c->
min
()) {
54
if
(
v
+1 ==
c
->
min
()) {
55
c
->
min
(
v
);
n
++;
56
return
;
57
}
else
{
58
*
p
=
new
(home)
RangeList
(
v
,
v
,
c
);
n
++;
59
return
;
60
}
61
}
else
if
(v <= c->
max
()) {
62
// Value already included
63
return
;
64
}
else
if
(
v
==
c
->
max
()+1) {
65
if
((
c
->next() != NULL) && (
v
+1 ==
c
->next()->
min
())) {
66
c
->next()->
min
(
c
->
min
());
67
*
p
=
c
->next();
68
c
->dispose(home,
c
);
69
}
else
{
70
c
->
max
(
v
);
71
}
72
n
++;
73
return
;
74
}
else
{
75
// FIXME: HOW TO CAST HERE?
76
p
=
reinterpret_cast<
RangeList
**
>
(
c
->nextRef());
77
c
= *
p
;
78
}
79
}
80
*
p
=
new
(home)
RangeList
(
v
,
v
,NULL);
n
++;
81
lst
= *
p
;
82
}
83
84
forceinline
int
85
ValSet::size
(
void
)
const
{
86
return
n
;
87
}
88
89
forceinline
bool
90
ValSet::empty
(
void
)
const
{
91
return
n
== 0;
92
}
93
94
forceinline
int
95
ValSet::min
(
void
)
const
{
96
return
fst
->
min
();
97
}
98
99
forceinline
int
100
ValSet::max
(
void
)
const
{
101
return
lst
->
max
();
102
}
103
104
forceinline
void
105
ValSet::update
(
Space
& home,
bool
share,
ValSet
& vs) {
106
(void) share;
107
if
(vs.
n
> 0) {
108
n
= vs.
n
;
109
// Count number of ranges
110
int
m = 0;
111
for
(
RangeList
*
c
= vs.
fst
;
c
!= NULL;
c
=
c
->next())
112
m++;
113
fst
= home.
alloc
<
RangeList
>(m);
114
lst
=
fst
+ (m-1);
115
int
i
=0;
116
for
(
RangeList
*
c
= vs.
fst
;
c
!= NULL;
c
=
c
->next()) {
117
fst
[
i
].
min
(
c
->
min
());
fst
[
i
].
max
(
c
->
max
());
118
fst
[
i
].
next
(
fst
+
i
+1);
119
i
++;
120
}
121
lst
->
next
(NULL);
122
}
123
}
124
125
forceinline
void
126
ValSet::flush
(
void
) {
127
fst
=
lst
= NULL;
128
}
129
130
forceinline
void
131
ValSet::dispose
(
Space
& home) {
132
if
(
fst
!= NULL)
133
fst
->
dispose
(home,
lst
);
134
}
135
136
forceinline
137
ValSet::Ranges::Ranges
(
const
ValSet
& vs)
138
:
c
(vs.fst) {}
139
140
forceinline
bool
141
ValSet::Ranges::operator ()
(
void
)
const
{
142
return
c
!= NULL;
143
}
144
145
forceinline
void
146
ValSet::Ranges::operator ++
(
void
) {
147
c
=
c
->next();
148
}
149
150
forceinline
int
151
ValSet::Ranges::min
(
void
)
const
{
152
return
c
->
min
();
153
}
154
forceinline
int
155
ValSet::Ranges::max
(
void
)
const
{
156
return
c
->
max
();
157
}
158
159
forceinline
unsigned
int
160
ValSet::Ranges::width
(
void
)
const
{
161
return
c
->width();
162
}
163
164
template
<
class
View>
165
forceinline
Iter::Ranges::CompareStatus
166
ValSet::compare
(View
x
)
const
{
167
if
(
empty
() || (
x
.max() <
min
()) || (
x
.min() >
max
()))
168
return
Iter::Ranges::CS_DISJOINT
;
169
ValSet::Ranges
vsr(*
this
);
170
ViewRanges<View>
xr(
x
);
171
return
Iter::Ranges::compare
(xr,vsr);
172
}
173
174
template
<
class
View>
175
forceinline
bool
176
ValSet::subset
(View
x
)
const
{
177
if
(
empty
() || (
x
.min() <
min
()) || (
x
.max() >
max
()))
178
return
false
;
179
ValSet::Ranges
vsr(*
this
);
180
ViewRanges<View>
xr(
x
);
181
return
Iter::Ranges::subset
(xr,vsr);
182
}
183
184
}}
185
186
// STATISTICS: int-other
Gecode::Int::ValSet::max
int max(void) const
Return largest value (provided the set is not empty)
Definition:
val-set.hpp:100
Gecode::x
Post propagator for SetVar x
Definition:
set.hh:784
Gecode::Int::ValSet::Ranges::Ranges
Ranges(const ValSet &vs)
Initialize.
Definition:
val-set.hpp:137
forceinline
#define forceinline
Definition:
config.hpp:173
Gecode::Int::ValSet::Ranges::operator()
bool operator()(void) const
Test whether iterator is still at a range or done.
Definition:
val-set.hpp:141
Gecode::FloatVal::max
friend FloatVal max(const FloatVal &x, const FloatVal &y)
Definition:
val.hpp:390
Gecode::RangeList::min
int min(void) const
Return minimum.
Definition:
range-list.hpp:168
Gecode::FloatVal::min
friend FloatVal min(const FloatVal &x, const FloatVal &y)
Definition:
val.hpp:402
Gecode::Int::ValSet
Class for storing values of already assigned views.
Definition:
val-set.hh:48
Gecode::Int::ValSet::empty
bool empty(void) const
Test whether set is empty.
Definition:
val-set.hpp:90
Test::Int::Basic::i
Gecode::IntArgs i(4, 1, 2, 3, 4)
Gecode::Int::ValSet::lst
RangeList * lst
Last element of range list.
Definition:
val-set.hh:53
Gecode::Space
Computation spaces.
Definition:
core.hpp:1748
Gecode::Iter::Ranges::subset
bool subset(I &i, J &j)
Check whether range iterator i is subset of range iterator j.
Definition:
ranges-operations.hpp:101
Gecode
Gecode toplevel namespace
Gecode::Int::ViewRanges
Range iterator for integer views.
Definition:
view.hpp:54
Gecode::Int::ValSet::size
int size(void) const
Return size (number of values)
Definition:
val-set.hpp:85
Gecode::Int::ValSet::Ranges
Iterator over ranges.
Definition:
val-set.hh:82
Gecode::Int::ValSet::flush
void flush(void)
Flush entries.
Definition:
val-set.hpp:126
Gecode::Int::ValSet::dispose
void dispose(Space &home)
Dispose value set.
Definition:
val-set.hpp:131
Gecode::Space::alloc
T * alloc(long unsigned int n)
Allocate block of n objects of type T from space heap.
Definition:
core.hpp:2868
Gecode::RangeList::max
int max(void) const
Return maximum.
Definition:
range-list.hpp:172
Gecode::Int::ValSet::n
int n
Number of stored values (integer precision is sufficient)
Definition:
val-set.hh:55
Gecode::Int::ValSet::Ranges::max
int max(void) const
Return largest value of range.
Definition:
val-set.hpp:155
Gecode::Int::ValSet::compare
Iter::Ranges::CompareStatus compare(View x) const
Compare view x with value set.
Definition:
val-set.hpp:166
Test::Int::Distinct::v
const int v[7]
Definition:
distinct.cpp:263
Gecode::Iter::Ranges::CompareStatus
CompareStatus
Comapre two iterators with each other.
Definition:
ranges-operations.hpp:64
Gecode::RangeList::dispose
void dispose(Space &home, RangeList *l)
Free memory for all elements between this and l (inclusive)
Definition:
range-list.hpp:205
Gecode::Int::ValSet::min
int min(void) const
Return smallest value (provided the set is not empty)
Definition:
val-set.hpp:95
Gecode::Int::ValSet::ValSet
ValSet(void)
Initialize.
Definition:
val-set.hpp:45
Gecode::Int::ValSet::Ranges::operator++
void operator++(void)
Move iterator to next range (if possible)
Definition:
val-set.hpp:146
Gecode::Int::ValSet::Ranges::width
unsigned int width(void) const
Return width of range (distance between minimum and maximum)
Definition:
val-set.hpp:160
Gecode::Int::ValSet::Ranges::min
int min(void) const
Return smallest value of range.
Definition:
val-set.hpp:151
Test::Float::Arithmetic::c
Gecode::FloatVal c(-8, 8)
Gecode::RangeList::next
RangeList * next(void) const
Return next element.
Definition:
range-list.hpp:145
n
int n
Number of negative literals for node type.
Definition:
bool-expr.cpp:238
Gecode::RangeList
Lists of ranges (intervals)
Definition:
range-list.hpp:53
Gecode::Iter::Ranges::compare
CompareStatus compare(I &i, J &j)
Check whether range iterator i is a subset of j, or whether they are disjoint.
Definition:
ranges-operations.hpp:131
Gecode::Int::ValSet::update
void update(Space &home, bool share, ValSet &vs)
Update value set during cloning.
Definition:
val-set.hpp:105
Gecode::Int::ValSet::subset
bool subset(View x) const
Whether all values of x are included in the value set.
Definition:
val-set.hpp:176
p
int p
Number of positive literals for node type.
Definition:
bool-expr.cpp:236
Gecode::Int::ValSet::add
void add(Space &home, int v)
Add value v to value set.
Definition:
val-set.hpp:49
Gecode::Iter::Ranges::CS_DISJOINT
@ CS_DISJOINT
Intersection is empty.
Definition:
ranges-operations.hpp:66
Gecode::Int::ValSet::fst
RangeList * fst
First element of range list.
Definition:
val-set.hh:51