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 Value iterator from range iterator
38 *
39 * \ingroup FuncIterValues
40 */
41 template<class I>
42 class ToValues {
43 protected:
44 /// Range iterator used
45 I i;
46 /// Current value
47 int cur;
48 /// End of current range
49 int max;
50 /// Initialize iterator
51 void start(void);
52 public:
53 /// \name Constructors and initialization
54 //@{
55 /// Default constructor
56 ToValues(void);
57 /// Initialize with values from range iterator \a i
58 ToValues(I& i);
59 /// Initialize with values from range iterator \a i
60 void init(I& i);
61 //@}
62
63 /// \name Iteration control
64 //@{
65 /// Test whether iterator is still at a value or done
66 bool operator ()(void) const;
67 /// Move iterator to next value (if possible)
68 void operator ++(void);
69 //@}
70
71 /// \name Value access
72 //@{
73 /// Return current value
74 int val(void) const;
75 //@}
76 };
77
78
79
80 template<class I>
81 forceinline
82 ToValues<I>::ToValues(void) {}
83
84 template<class I>
85 forceinline void
86 ToValues<I>::start(void) {
87 if (i()) {
88 cur = i.min(); max = i.max();
89 } else {
90 cur = 1; max = 0;
91 }
92 }
93
94 template<class I>
95 forceinline
96 ToValues<I>::ToValues(I& i0)
97 : i(i0) {
98 start();
99 }
100
101 template<class I>
102 forceinline void
103 ToValues<I>::init(I& i0) {
104 i = i0;
105 start();
106 }
107
108
109 template<class I>
110 forceinline bool
111 ToValues<I>::operator ()(void) const {
112 return (cur <= max);
113 }
114
115 template<class I>
116 forceinline void
117 ToValues<I>::operator ++(void) {
118 ++cur;
119 if (cur > max) {
120 ++i;
121 if (i()) {
122 cur = i.min(); max = i.max();
123 }
124 }
125 }
126
127 template<class I>
128 forceinline int
129 ToValues<I>::val(void) const {
130 return cur;
131 }
132
133}}}
134
135// STATISTICS: iter-any
136