this repo has no description
dekker.one
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 * This file is part of Gecode, the generic constraint
10 * development environment:
11 * http://www.gecode.org
12 *
13 * Permission is hereby granted, free of charge, to any person obtaining
14 * a copy of this software and associated documentation files (the
15 * "Software"), to deal in the Software without restriction, including
16 * without limitation the rights to use, copy, modify, merge, publish,
17 * distribute, sublicense, and/or sell copies of the Software, and to
18 * permit persons to whom the Software is furnished to do so, subject to
19 * the following conditions:
20 *
21 * The above copyright notice and this permission notice shall be
22 * included in all copies or substantial portions of the Software.
23 *
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31 *
32 */
33
34namespace Gecode { namespace Iter { namespace Ranges {
35
36 /**
37 * \brief %Range iterator cache
38 *
39 * Allows to iterate the ranges as defined by the input iterator
40 * several times provided the Cache is %reset by the reset member
41 * function.
42 *
43 * \ingroup FuncIterRanges
44 */
45 class Cache : public RangeListIter {
46 public:
47 /// \name Constructors and initialization
48 //@{
49 /// Default constructor
50 Cache(void);
51 /// Copy constructor
52 Cache(const Cache& m);
53 /// Initialize with ranges from \a i
54 template<class I>
55 Cache(Region& r, I& i);
56 /// Initialize with ranges from \a i
57 template<class I>
58 void init(Region& r, I& i);
59 /// Assignment operator (both caches must be allocated from the same region)
60 Cache& operator =(const Cache& m);
61 //@}
62 };
63
64
65 forceinline
66 Cache::Cache(void) {}
67
68 forceinline
69 Cache::Cache(const Cache& m)
70 : RangeListIter(m) {}
71
72 template<class I>
73 void
74 Cache::init(Region& r, I& i) {
75 RangeListIter::init(r);
76 RangeList* h = nullptr;
77 RangeList** p = &h;
78 for (; i(); ++i) {
79 RangeList* t = new (*rlio) RangeList;
80 *p = t; p = &t->next;
81 t->min = i.min();
82 t->max = i.max();
83 }
84 *p = nullptr;
85 RangeListIter::set(h);
86 }
87
88 template<class I>
89 forceinline
90 Cache::Cache(Region& r, I& i) {
91 init(r,i);
92 }
93
94 forceinline Cache&
95 Cache::operator =(const Cache& m) {
96 return static_cast<Cache&>(RangeListIter::operator =(m));
97 }
98
99}}}
100
101// STATISTICS: iter-any
102