main page
modules
namespaces
classes
files
Gecode home
Generated on Thu Mar 13 2014 04:39:34 for Gecode by
doxygen
1.8.1.2
gecode
iter
ranges-positive.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, 2008
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
#include <algorithm>
39
40
namespace
Gecode {
namespace
Iter {
namespace
Ranges {
41
49
template
<
class
I,
bool
strict=false>
50
class
Positive
{
51
protected
:
53
I
i
;
54
public
:
56
57
58
Positive
(
void
);
60
Positive
(I&
i
);
62
void
init
(I&
i
);
64
66
67
68
bool
operator ()
(
void
)
const
;
70
void
operator ++
(
void
);
72
74
75
76
int
min
(
void
)
const
;
78
int
max
(
void
)
const
;
80
unsigned
int
width
(
void
)
const
;
82
};
83
84
85
template
<
class
I,
bool
strict>
86
forceinline
87
Positive<I,strict>::Positive
(
void
) {}
88
89
template
<
class
I,
bool
strict>
90
forceinline
void
91
Positive<I,strict>::init
(I& i0) {
92
i
=i0;
93
if
(strict) {
94
while
(
i
() && (
i
.max() < 0)) ++
i
;
95
}
else
{
96
while
(
i
() && (
i
.max() <= 0)) ++
i
;
97
}
98
}
99
100
template
<
class
I,
bool
strict>
101
forceinline
102
Positive<I,strict>::Positive
(I&
i
) {
103
init(i);
104
}
105
106
template
<
class
I,
bool
strict>
107
forceinline
void
108
Positive<I,strict>::operator ++
(
void
) {
109
++
i
;
110
}
111
template
<
class
I,
bool
strict>
112
forceinline
bool
113
Positive<I,strict>::operator ()
(
void
)
const
{
114
return
i
();
115
}
116
117
template
<
class
I,
bool
strict>
118
forceinline
int
119
Positive<I,strict>::min
(
void
)
const
{
120
if
(strict) {
121
return
std::max
(
i
.min(),1);
122
}
else
{
123
return
std::max
(
i
.min(),0);
124
}
125
}
126
template
<
class
I,
bool
strict>
127
forceinline
int
128
Positive<I,strict>::max
(
void
)
const
{
129
return
i
.max();
130
}
131
template
<
class
I,
bool
strict>
132
forceinline
unsigned
int
133
Positive<I,strict>::width
(
void
)
const
{
134
return
static_cast<
unsigned
int
>
(
max
()-
min
()+1);
135
}
136
137
}}}
138
139
// STATISTICS: iter-any