main page
modules
namespaces
classes
files
Gecode home
Generated on Fri Aug 24 2012 04:52:19 for Gecode by
doxygen
1.8.1.1
gecode
iter
ranges-cache.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
49
class
Cache
:
public
RangeListIter
{
50
public
:
52
53
54
Cache
(
void
);
56
Cache
(
const
Cache
&
m
);
58
template
<
class
I>
59
Cache
(
Region
&
r
, I&
i
);
61
template
<
class
I>
62
void
init
(
Region
& r, I& i);
64
Cache
&
operator =
(
const
Cache
& m);
66
};
67
68
69
forceinline
70
Cache::Cache
(
void
) {}
71
72
forceinline
73
Cache::Cache
(
const
Cache
&
m
)
74
:
RangeListIter
(m) {}
75
76
template
<
class
I>
77
void
78
Cache::init
(
Region
&
r
, I&
i
) {
79
RangeListIter::init
(r);
80
RangeList
*
h
= NULL;
81
RangeList
** p = &
h
;
82
for
(;
i
(); ++
i
) {
83
RangeList
* t =
new
(*rlio)
RangeList
;
84
*p = t; p = &t->
next
;
85
t->
min
= i.min();
86
t->
max
= i.max();
87
}
88
*p = NULL;
89
RangeListIter::set
(h);
90
}
91
92
template
<
class
I>
93
forceinline
94
Cache::Cache
(
Region
&
r
, I&
i
) {
95
init
(r,i);
96
}
97
98
forceinline
Cache
&
99
Cache::operator =
(
const
Cache
&
m
) {
100
return
static_cast<
Cache
&
>
(
RangeListIter::operator =
(m));
101
}
102
103
}}}
104
105
// STATISTICS: iter-any
106