main page
modules
namespaces
classes
files
Gecode home
Generated on Thu Feb 21 2013 23:11:47 for Gecode by
doxygen
1.8.3.1
gecode
iter
values-union.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: 2011-02-02 00:31:23 +1100 (Wed, 02 Feb 2011) $ by $Author: schulte $
11
* $Revision: 11595 $
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
Values {
39
46
template
<
class
I,
class
J>
47
class
Union
{
48
protected
:
50
I
i
;
52
J
j
;
54
int
v
;
56
bool
done
;
57
public
:
59
60
61
Union
(
void
);
63
Union
(I&
i
, J&
j
);
65
void
init
(I&
i
, J&
j
);
67
69
70
71
bool
operator ()
(
void
)
const
;
73
void
operator ++
(
void
);
75
77
78
79
int
val
(
void
)
const
;
81
};
82
83
84
template
<
class
I,
class
J>
85
forceinline
86
Union<I,J>::Union
(
void
) :
v
(0) {}
87
88
template
<
class
I,
class
J>
89
forceinline
void
90
Union<I,J>::operator ++
(
void
) {
91
if
(
i
()) {
92
if
(j()) {
93
if
(
i
.val() == j.val()) {
94
v
=
i
.val(); ++
i
; ++j;
95
}
else
if
(
i
.val() < j.val()) {
96
v
=
i
.val(); ++
i
;
97
}
else
{
98
v
=j.val(); ++j;
99
}
100
}
else
{
101
v
=
i
.val(); ++
i
;
102
}
103
}
else
if
(j()) {
104
v
=j.val(); ++j;
105
}
else
{
106
done=
true
;
107
}
108
}
109
110
template
<
class
I,
class
J>
111
inline
void
112
Union<I,J>::init
(I& i0, J& j0) {
113
i
=i0; j=j0;
v
=0; done=
false
;
114
operator ++();
115
}
116
117
template
<
class
I,
class
J>
118
forceinline
119
Union<I,J>::Union
(I& i0, J& j0) :
i
(i0), j(j0),
v
(0), done(false) {
120
operator ++
();
121
}
122
123
template
<
class
I,
class
J>
124
forceinline
bool
125
Union<I,J>::operator ()
(
void
)
const
{
126
return
!done;
127
}
128
129
template
<
class
I,
class
J>
130
forceinline
int
131
Union<I,J>::val
(
void
)
const
{
132
return
v
;
133
}
134
135
}}}
136
137
// STATISTICS: iter-any