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, 2008
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
34#include <algorithm>
35
36namespace Gecode { namespace Iter { namespace Ranges {
37
38 /**
39 * \brief Range iterator for positive part of a range iterator
40 *
41 * If \a strict is true, zero is excluded.
42 *
43 * \ingroup FuncIterRanges
44 */
45 template<class I, bool strict=false>
46 class Positive {
47 protected:
48 /// Input iterator
49 I i;
50 public:
51 /// \name Constructors and initialization
52 //@{
53 /// Default constructor
54 Positive(void);
55 /// Initialize with ranges from \a i
56 Positive(I& i);
57 /// Initialize with ranges from \a i
58 void init(I& i);
59 //@}
60
61 /// \name Iteration control
62 //@{
63 /// Test whether iterator is still at a range or done
64 bool operator ()(void) const;
65 /// Move iterator to next range (if possible)
66 void operator ++(void);
67 //@}
68
69 /// \name Range access
70 //@{
71 /// Return smallest value of range
72 int min(void) const;
73 /// Return largest value of range
74 int max(void) const;
75 /// Return width of range (distance between minimum and maximum)
76 unsigned int width(void) const;
77 //@}
78 };
79
80
81 template<class I, bool strict>
82 forceinline
83 Positive<I,strict>::Positive(void) {}
84
85 template<class I, bool strict>
86 forceinline void
87 Positive<I,strict>::init(I& i0) {
88 i=i0;
89 if (strict) {
90 while (i() && (i.max() < 0)) ++i;
91 } else {
92 while (i() && (i.max() <= 0)) ++i;
93 }
94 }
95
96 template<class I, bool strict>
97 forceinline
98 Positive<I,strict>::Positive(I& i) {
99 init(i);
100 }
101
102 template<class I, bool strict>
103 forceinline void
104 Positive<I,strict>::operator ++(void) {
105 ++i;
106 }
107 template<class I, bool strict>
108 forceinline bool
109 Positive<I,strict>::operator ()(void) const {
110 return i();
111 }
112
113 template<class I, bool strict>
114 forceinline int
115 Positive<I,strict>::min(void) const {
116 if (strict) {
117 return std::max(i.min(),1);
118 } else {
119 return std::max(i.min(),0);
120 }
121 }
122 template<class I, bool strict>
123 forceinline int
124 Positive<I,strict>::max(void) const {
125 return i.max();
126 }
127 template<class I, bool strict>
128 forceinline unsigned int
129 Positive<I,strict>::width(void) const {
130 return static_cast<unsigned int>(max()-min()+1);
131 }
132
133}}}
134
135// STATISTICS: iter-any