main page
modules
namespaces
classes
files
Gecode home
Generated on Wed Sep 5 2012 18:52:00 for Gecode by
doxygen
1.8.1.1
gecode
iter
ranges-add.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, 2005
8
*
9
* Last modified:
10
* $Date: 2010-07-29 01:35:33 +1000 (Thu, 29 Jul 2010) $ by $Author: schulte $
11
* $Revision: 11294 $
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
Iter {
namespace
Ranges {
39
45
template
<
class
I>
46
class
AddRange
:
public
MinMax
{
47
protected
:
49
I
i
;
51
int
r_min
;
53
int
r_max
;
54
public
:
56
57
58
AddRange
(
void
);
60
AddRange
(I&
i
,
int
min
,
int
max
);
62
void
init
(I&
i
,
int
min
,
int
max
);
64
66
67
68
void
operator ++
(
void
);
70
};
71
72
78
template
<
class
I>
79
class
SubRange
:
public
AddRange
<I> {
80
public
:
82
83
84
SubRange
(
void
);
86
SubRange
(I&
i
,
int
min
,
int
max
);
88
void
init
(I& i,
int
min,
int
max);
90
};
91
92
template
<
class
I>
93
forceinline
94
AddRange<I>::AddRange
(
void
) {}
95
96
template
<
class
I>
97
forceinline
void
98
AddRange<I>::operator ++
(
void
) {
99
if
(
i
()) {
100
mi = r_min +
i
.min();
101
ma = r_max +
i
.max();
102
++
i
;
103
while
(
i
() && (ma+1 >= r_min+
i
.min())) {
104
ma = r_max +
i
.max(); ++
i
;
105
}
106
}
else
{
107
finish();
108
}
109
}
110
111
template
<
class
I>
112
forceinline
113
AddRange<I>::AddRange
(I& i0,
int
r_min0,
int
r_max0)
114
:
i
(i0), r_min(r_min0), r_max(r_max0) {
115
operator ++
();
116
}
117
118
template
<
class
I>
119
forceinline
void
120
AddRange<I>::init
(I& i0,
int
r_min0,
int
r_max0) {
121
i
= i0; r_min = r_min0; r_max = r_max0;
122
operator ++();
123
}
124
125
126
template
<
class
I>
127
forceinline
128
SubRange<I>::SubRange
(
void
) {}
129
130
template
<
class
I>
131
forceinline
132
SubRange<I>::SubRange
(I&
i
,
int
r_min,
int
r_max)
133
:
AddRange
<I>(i,-r_max,-r_min) {}
134
135
template
<
class
I>
136
forceinline
void
137
SubRange<I>::init
(I&
i
,
int
r_min,
int
r_max) {
138
AddRange<I>::init
(i,-r_max,-r_min);
139
}
140
141
}}}
142
143
// STATISTICS: iter-any
144