main page
modules
namespaces
classes
files
Gecode home
Generated on Thu Mar 7 2013 10:21:36 for Gecode by
doxygen
1.8.3.1
gecode
iter
ranges-minus.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, 2004
8
*
9
* Last modified:
10
* $Date: 2011-08-09 02:04:53 +1000 (Tue, 09 Aug 2011) $ by $Author: schulte $
11
* $Revision: 12253 $
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
51
class
Minus
:
public
RangeListIter
{
52
public
:
54
55
56
Minus
(
void
);
58
Minus
(
const
Minus
&
m
);
60
template
<
class
I>
61
Minus
(
Region
&
r
, I&
i
);
63
template
<
class
I>
64
void
init
(
Region
& r, I& i);
66
Minus
&
operator =
(
const
Minus
& m);
68
};
69
70
71
forceinline
72
Minus::Minus
(
void
) {}
73
74
forceinline
75
Minus::Minus
(
const
Minus
&
m
)
76
:
RangeListIter
(m) {}
77
78
template
<
class
I>
79
void
80
Minus::init
(
Region
&
r
, I&
i
) {
81
RangeListIter::init
(r);
82
RangeList
* p = NULL;
83
for
(;
i
(); ++
i
) {
84
RangeList
* t =
new
(*rlio)
RangeList
;
85
t->
next
= p;
86
t->
min
= -i.max();
87
t->
max
= -i.min();
88
p = t;
89
}
90
RangeListIter::set
(p);
91
}
92
93
template
<
class
I>
94
forceinline
95
Minus::Minus
(
Region
&
r
, I&
i
) {
96
init
(r,i);
97
}
98
99
forceinline
Minus
&
100
Minus::operator =
(
const
Minus
&
m
) {
101
return
static_cast<
Minus
&
>
(
RangeListIter::operator =
(m));
102
}
103
104
}}}
105
106
// STATISTICS: iter-any
107