Generated on Sat Feb 7 2015 02:01:26 for Gecode by doxygen 1.8.9.1
ranges-minmax.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, 2004
8  *
9  * Last modified:
10  * $Date: 2008-12-05 16:43:57 +0100 (Fri, 05 Dec 2008) $ by $Author: schulte $
11  * $Revision: 7989 $
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 namespace Gecode { namespace Iter { namespace Ranges {
39 
51  class MinMax {
52  protected:
54  int mi;
56  int ma;
58  void finish(void);
59  public:
61 
62  MinMax(void);
65  MinMax(int min, int max);
67 
69 
70  bool operator ()(void) const;
73 
75 
76  int min(void) const;
79  int max(void) const;
81  unsigned int width(void) const;
83  };
84 
85  forceinline void
87  mi = 1; ma = 0;
88  }
89 
91  MinMax::MinMax(void) {}
92 
95  : mi(min), ma(max) {}
96 
97  forceinline bool
98  MinMax::operator ()(void) const {
99  return mi <= ma;
100  }
101 
102  forceinline int
103  MinMax::min(void) const {
104  return mi;
105  }
106  forceinline int
107  MinMax::max(void) const {
108  return ma;
109  }
110  forceinline unsigned int
111  MinMax::width(void) const {
112  return static_cast<unsigned int>(ma-mi)+1;
113  }
114 
115 }}}
116 
117 // STATISTICS: iter-any
118 
int max(void) const
Return largest value of range.
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition: arithmetic.cpp:57
unsigned int width(void) const
Return width of range (distance between minimum and maximum)
Base for range iterators with explicit min and max.
int min(void) const
Return smallest value of range.
void finish(void)
Set range such that iteration stops
MinMax(void)
Default constructor.
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition: arithmetic.cpp:75
bool operator()(void) const
Test whether iterator is still at a range or done.
int mi
Minimum of current range.
#define forceinline
Definition: config.hpp:132
Gecode toplevel namespace
int ma
Maximum of current range.