Generated on Sat Jun 2 2018 07:17:44 for Gecode by doxygen 1.8.13
ranges-positive.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, 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 
36 namespace Gecode { namespace Iter { namespace Ranges {
37 
45  template<class I, bool strict=false>
46  class Positive {
47  protected:
49  I i;
50  public:
52 
53  Positive(void);
56  Positive(I& i);
58  void init(I& i);
60 
62 
63  bool operator ()(void) const;
66  void operator ++(void);
68 
70 
71  int min(void) const;
74  int max(void) const;
76  unsigned int width(void) const;
78  };
79 
80 
81  template<class I, bool strict>
84 
85  template<class I, bool strict>
86  forceinline void
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>
99  init(i);
100  }
101 
102  template<class I, bool strict>
103  forceinline void
105  ++i;
106  }
107  template<class I, bool strict>
108  forceinline bool
110  return i();
111  }
112 
113  template<class I, bool strict>
114  forceinline int
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
125  return i.max();
126  }
127  template<class I, bool strict>
128  forceinline unsigned int
130  return static_cast<unsigned int>(max()-min()+1);
131  }
132 
133 }}}
134 
135 // STATISTICS: iter-any
const FloatNum max
Largest allowed float value.
Definition: float.hh:844
unsigned int width(void) const
Return width of range (distance between minimum and maximum)
int max(void) const
Return largest value of range.
#define forceinline
Definition: config.hpp:185
void operator++(void)
Move iterator to next range (if possible)
void init(I &i)
Initialize with ranges from i.
int min(void) const
Return smallest value of range.
bool operator()(void) const
Test whether iterator is still at a range or done.
Gecode toplevel namespace
Range iterator for positive part of a range iterator.
Positive(void)
Default constructor.