Generated on Thu Apr 5 2018 19:44:19 for Gecode by doxygen 1.8.13
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$ by $Author$
11  * $Revision$
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  */
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
106  if (vs.n > 0) {
107  n = vs.n;
108  // Count number of ranges
109  int m = 0;
110  for (RangeList* c = vs.fst; c != NULL; c = c->next())
111  m++;
112  fst = home.alloc<RangeList>(m);
113  lst = fst + (m-1);
114  int i=0;
115  for (RangeList* c = vs.fst; c != NULL; c = c->next()) {
116  fst[i].min(c->min()); fst[i].max(c->max());
117  fst[i].next(fst+i+1);
118  i++;
119  }
120  lst->next(NULL);
121  }
122  }
123 
124  forceinline void
126  fst = lst = NULL;
127  }
128 
129  forceinline void
131  if (fst != NULL)
132  fst->dispose(home,lst);
133  }
134 
137  : c(vs.fst) {}
138 
139  forceinline bool
141  return c != NULL;
142  }
143 
144  forceinline void
146  c = c->next();
147  }
148 
149  forceinline int
150  ValSet::Ranges::min(void) const {
151  return c->min();
152  }
153  forceinline int
154  ValSet::Ranges::max(void) const {
155  return c->max();
156  }
157 
158  forceinline unsigned int
159  ValSet::Ranges::width(void) const {
160  return c->width();
161  }
162 
163  template<class View>
165  ValSet::compare(View x) const {
166  if (empty() || (x.max() < min()) || (x.min() > max()))
168  ValSet::Ranges vsr(*this);
169  ViewRanges<View> xr(x);
170  return Iter::Ranges::compare(xr,vsr);
171  }
172 
173  template<class View>
174  forceinline bool
175  ValSet::subset(View x) const {
176  if (empty() || (x.min() < min()) || (x.max() > max()))
177  return false;
178  ValSet::Ranges vsr(*this);
179  ViewRanges<View> xr(x);
180  return Iter::Ranges::subset(xr,vsr);
181  }
182 
183 }}
184 
185 // STATISTICS: int-other
unsigned int width(void) const
Return width of range (distance between minimum and maximum)
Definition: val-set.hpp:159
RangeList * fst
First element of range list.
Definition: val-set.hh:51
int max(void) const
Return largest value (provided the set is not empty)
Definition: val-set.hpp:100
bool empty(void) const
Test whether set is empty.
Definition: val-set.hpp:90
bool operator()(void) const
Test whether iterator is still at a range or done.
Definition: val-set.hpp:140
RangeList * next(void) const
Return next element.
Definition: range-list.hpp:145
int min(void) const
Return minimum.
Definition: range-list.hpp:168
RangeList * lst
Last element of range list.
Definition: val-set.hh:53
#define forceinline
Definition: config.hpp:182
Computation spaces.
Definition: core.hpp:1668
Range iterator for integer views.
Definition: view.hpp:54
T * alloc(long unsigned int n)
Allocate block of n objects of type T from space heap.
Definition: core.hpp:2757
Gecode::FloatVal c(-8, 8)
int p
Number of positive literals for node type.
Definition: bool-expr.cpp:236
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
Definition: bool-expr.cpp:238
void dispose(Space &home)
Dispose value set.
Definition: val-set.hpp:130
Iterator over ranges.
Definition: val-set.hh:82
int size(void) const
Return size (number of values)
Definition: val-set.hpp:85
void flush(void)
Flush entries.
Definition: val-set.hpp:125
int max(void) const
Return maximum.
Definition: range-list.hpp:172
Ranges(const ValSet &vs)
Initialize.
Definition: val-set.hpp:136
CompareStatus
Comapre two iterators with each other.
void update(Space &home, ValSet &vs)
Update value set during cloning.
Definition: val-set.hpp:105
void operator++(void)
Move iterator to next range (if possible)
Definition: val-set.hpp:145
const int v[7]
Definition: distinct.cpp:263
int n
Number of stored values (integer precision is sufficient)
Definition: val-set.hh:55
Iter::Ranges::CompareStatus compare(View x) const
Compare view x with value set.
Definition: val-set.hpp:165
int min(void) const
Return smallest value (provided the set is not empty)
Definition: val-set.hpp:95
Post propagator for SetVar x
Definition: set.hh:769
Class for storing values of already assigned views.
Definition: val-set.hh:48
void dispose(Space &home, RangeList *l)
Free memory for all elements between this and l (inclusive)
Definition: range-list.hpp:205
bool subset(I &i, J &j)
Check whether range iterator i is subset of range iterator j.
int max(void) const
Return largest value of range.
Definition: val-set.hpp:154
int min(void) const
Return smallest value of range.
Definition: val-set.hpp:150
Lists of ranges (intervals)
Definition: range-list.hpp:53
CompareStatus compare(I &i, J &j)
Check whether range iterator i is a subset of j, or whether they are disjoint.
Gecode toplevel namespace
ValSet(void)
Initialize.
Definition: val-set.hpp:45
bool subset(View x) const
Whether all values of x are included in the value set.
Definition: val-set.hpp:175
friend FloatVal max(const FloatVal &x, const FloatVal &y)
Definition: val.hpp:390
RangeList ** nextRef(void)
Return pointer to next element.
Definition: range-list.hpp:150
friend FloatVal min(const FloatVal &x, const FloatVal &y)
Definition: val.hpp:402
void add(Space &home, int v)
Add value v to value set.
Definition: val-set.hpp:49
unsigned int width(void) const
Return width (distance between maximum and minimum)
Definition: range-list.hpp:176