1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2004
*
* This file is part of Gecode, the generic constraint
* development environment:
* http://www.gecode.org
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*/
namespace Gecode { namespace Iter { namespace Ranges {
/**
* \brief Range iterator for computing set difference
*
* \ingroup FuncIterRanges
*/
template<class I, class J>
class Diff : public MinMax {
protected:
/// Iterator from which to subtract
I i;
/// Iterator to be subtracted
J j;
public:
/// \name Constructors and initialization
//@{
/// Default constructor
Diff(void);
/// Initialize with iterator \a i and \a j
Diff(I& i, J& j);
/// Initialize with iterator \a i and \a j
void init(I& i, J& j);
//@}
/// \name Iteration control
//@{
/// Move iterator to next range (if possible)
void operator ++(void);
//@}
};
template<class I, class J>
forceinline void
Diff<I,J>::operator ++(void) {
// Precondition: mi <= ma
// Task: find next mi greater than ma
while (true) {
if (!i()) break;
mi = ma+1;
ma = i.max();
if (mi > i.max()) {
++i;
if (!i()) break;
mi = i.min();
ma = i.max();
}
while (j() && (j.max() < mi))
++j;
if (j() && (j.min() <= ma)) {
// Now the interval [mi ... ma] must be shrunken
// Is [mi ... ma] completely consumed?
if ((mi >= j.min()) && (ma <= j.max()))
continue;
// Does [mi ... ma] overlap on the left?
if (j.min() <= mi) {
mi = j.max()+1;
// Search for max!
++j;
if (j() && (j.min() <= ma))
ma = j.min()-1;
} else {
ma = j.min()-1;
}
}
return;
}
finish();
}
template<class I, class J>
forceinline
Diff<I,J>::Diff(void) {}
template<class I, class J>
forceinline
Diff<I,J>::Diff(I& i0, J& j0)
: i(i0), j(j0) {
if (!i()) {
finish();
} else {
mi = i.min()-1; ma = mi;
operator ++();
}
}
template<class I, class J>
forceinline void
Diff<I,J>::init(I& i0, J& j0) {
i = i0; j = j0;
if (!i()) {
finish();
} else {
mi = i.min()-1; ma = mi;
operator ++();
}
}
}}}
// STATISTICS: iter-any
|
