Generated on Sat Feb 7 2015 02:01:26 for Gecode by doxygen 1.8.9.1
ranges-negative.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 
50  template<class I, bool strict=false>
51  class Negative {
52  protected:
54  I i;
55  public:
57 
58  Negative(void);
61  Negative(I& i);
63  void init(I& i);
65 
67 
68  bool operator ()(void) const;
71  void operator ++(void);
73 
75 
76  int min(void) const;
79  int max(void) const;
81  unsigned int width(void) const;
83  };
84 
85 
86  template<class I, bool strict>
89 
90  template<class I, bool strict>
91  forceinline void
93  i=i0;
94  }
95 
96  template<class I, bool strict>
99 
100  template<class I, bool strict>
101  forceinline void
103  ++i;
104  }
105  template<class I, bool strict>
106  forceinline bool
108  if (strict) {
109  return i() && (i.min() < 0);
110  } else {
111  return i() && (i.min() <= 0);
112  }
113  }
114 
115  template<class I, bool strict>
116  forceinline int
118  return i.min();
119  }
120  template<class I, bool strict>
121  forceinline int
123  if (strict) {
124  return std::min(i.max(),-1);
125  } else {
126  return std::min(i.max(),0);
127  }
128  }
129  template<class I, bool strict>
130  forceinline unsigned int
132  return static_cast<unsigned int>(max()-min()+1);
133  }
134 
135 }}}
136 
137 // STATISTICS: iter-any
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition: arithmetic.cpp:57
int max(void) const
Return largest value of range.
const FloatNum min
Smallest allowed float value.
Definition: float.hh:833
Gecode::IntArgs i(4, 1, 2, 3, 4)
bool operator()(void) const
Test whether iterator is still at a range or done.
Negative(void)
Default constructor.
Range iterator for negative part of a range iterator.
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition: arithmetic.cpp:75
unsigned int width(void) const
Return width of range (distance between minimum and maximum)
void init(I &i)
Initialize with ranges from i.
#define forceinline
Definition: config.hpp:132
void operator++(void)
Move iterator to next range (if possible)
int min(void) const
Return smallest value of range.
Gecode toplevel namespace