main page
modules
namespaces
classes
files
Gecode home
Generated on Sat Aug 25 2012 03:32:51 for Gecode by
doxygen
1.8.1.2
gecode
iter
ranges-negative.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
50
template
<
class
I,
bool
strict=false>
51
class
Negative
{
52
protected
:
54
I
i
;
55
public
:
57
58
59
Negative
(
void
);
61
Negative
(I&
i
);
63
void
init
(I&
i
);
65
67
68
69
bool
operator ()
(
void
)
const
;
71
void
operator ++
(
void
);
73
75
76
77
int
min
(
void
)
const
;
79
int
max
(
void
)
const
;
81
unsigned
int
width
(
void
)
const
;
83
};
84
85
86
template
<
class
I,
bool
strict>
87
forceinline
88
Negative<I,strict>::Negative
(
void
) {}
89
90
template
<
class
I,
bool
strict>
91
forceinline
void
92
Negative<I,strict>::init
(I& i0) {
93
i
=i0;
94
}
95
96
template
<
class
I,
bool
strict>
97
forceinline
98
Negative<I,strict>::Negative
(I& i0) :
i
(i0) {}
99
100
template
<
class
I,
bool
strict>
101
forceinline
void
102
Negative<I,strict>::operator ++
(
void
) {
103
++
i
;
104
}
105
template
<
class
I,
bool
strict>
106
forceinline
bool
107
Negative<I,strict>::operator ()
(
void
)
const
{
108
if
(strict) {
109
return
i
() && (
i
.min() < 0);
110
}
else
{
111
return
i
() && (
i
.min() <= 0);
112
}
113
}
114
115
template
<
class
I,
bool
strict>
116
forceinline
int
117
Negative<I,strict>::min
(
void
)
const
{
118
return
i
.min();
119
}
120
template
<
class
I,
bool
strict>
121
forceinline
int
122
Negative<I,strict>::max
(
void
)
const
{
123
if
(strict) {
124
return
std::min
(
i
.max(),-1);
125
}
else
{
126
return
std::min
(
i
.max(),0);
127
}
128
}
129
template
<
class
I,
bool
strict>
130
forceinline
unsigned
int
131
Negative<I,strict>::width
(
void
)
const
{
132
return
static_cast<
unsigned
int
>
(
max
()-
min
()+1);
133
}
134
135
}}}
136
137
// STATISTICS: iter-any