Generated on Sat Feb 7 2015 02:01:26 for Gecode by doxygen 1.8.9.1
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  * Last modified:
10  * $Date: 2010-07-28 17:35:33 +0200 (Wed, 28 Jul 2010) $ by $Author: schulte $
11  * $Revision: 11294 $
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 #include <algorithm>
39 
40 namespace Gecode { namespace Iter { namespace Ranges {
41 
49  template<class I, bool strict=false>
50  class Positive {
51  protected:
53  I i;
54  public:
56 
57  Positive(void);
60  Positive(I& i);
62  void init(I& i);
64 
66 
67  bool operator ()(void) const;
70  void operator ++(void);
72 
74 
75  int min(void) const;
78  int max(void) const;
80  unsigned int width(void) const;
82  };
83 
84 
85  template<class I, bool strict>
88 
89  template<class I, bool strict>
90  forceinline void
92  i=i0;
93  if (strict) {
94  while (i() && (i.max() < 0)) ++i;
95  } else {
96  while (i() && (i.max() <= 0)) ++i;
97  }
98  }
99 
100  template<class I, bool strict>
103  init(i);
104  }
105 
106  template<class I, bool strict>
107  forceinline void
109  ++i;
110  }
111  template<class I, bool strict>
112  forceinline bool
114  return i();
115  }
116 
117  template<class I, bool strict>
118  forceinline int
120  if (strict) {
121  return std::max(i.min(),1);
122  } else {
123  return std::max(i.min(),0);
124  }
125  }
126  template<class I, bool strict>
127  forceinline int
129  return i.max();
130  }
131  template<class I, bool strict>
132  forceinline unsigned int
134  return static_cast<unsigned int>(max()-min()+1);
135  }
136 
137 }}}
138 
139 // STATISTICS: iter-any
const FloatNum max
Largest allowed float value.
Definition: float.hh:831
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition: arithmetic.cpp:57
void operator++(void)
Move iterator to next range (if possible)
void init(I &i)
Initialize with ranges from i.
Gecode::IntArgs i(4, 1, 2, 3, 4)
bool operator()(void) const
Test whether iterator is still at a range or done.
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition: arithmetic.cpp:75
#define forceinline
Definition: config.hpp:132
unsigned int width(void) const
Return width of range (distance between minimum and maximum)
Gecode toplevel namespace
int min(void) const
Return smallest value of range.
Range iterator for positive part of a range iterator.
int max(void) const
Return largest value of range.
Positive(void)
Default constructor.