Generated on Fri Oct 19 11:25:10 2018 for Gecode by doxygen 1.6.3

ranges-minmax.hpp

Go to the documentation of this file.
00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
00002 /*
00003  *  Main authors:
00004  *     Christian Schulte <schulte@gecode.org>
00005  *
00006  *  Copyright:
00007  *     Christian Schulte, 2004
00008  *
00009  *  This file is part of Gecode, the generic constraint
00010  *  development environment:
00011  *     http://www.gecode.org
00012  *
00013  *  Permission is hereby granted, free of charge, to any person obtaining
00014  *  a copy of this software and associated documentation files (the
00015  *  "Software"), to deal in the Software without restriction, including
00016  *  without limitation the rights to use, copy, modify, merge, publish,
00017  *  distribute, sublicense, and/or sell copies of the Software, and to
00018  *  permit persons to whom the Software is furnished to do so, subject to
00019  *  the following conditions:
00020  *
00021  *  The above copyright notice and this permission notice shall be
00022  *  included in all copies or substantial portions of the Software.
00023  *
00024  *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
00025  *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
00026  *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
00027  *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
00028  *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
00029  *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
00030  *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
00031  *
00032  */
00033 
00034 namespace Gecode { namespace Iter { namespace Ranges {
00035 
00047   class MinMax {
00048   protected:
00050     int mi;
00052     int ma;
00054     void finish(void);
00055   public:
00057 
00058 
00059     MinMax(void);
00061     MinMax(int min, int max);
00063 
00065 
00066 
00067     bool operator ()(void) const;
00069 
00071 
00072 
00073     int min(void) const;
00075     int max(void) const;
00077     unsigned int width(void) const;
00079   };
00080 
00081   forceinline void
00082   MinMax::finish(void) {
00083     mi = 1; ma = 0;
00084   }
00085 
00086   forceinline
00087   MinMax::MinMax(void) {}
00088 
00089   forceinline
00090   MinMax::MinMax(int min, int max)
00091     : mi(min), ma(max) {}
00092 
00093   forceinline bool
00094   MinMax::operator ()(void) const {
00095     return mi <= ma;
00096   }
00097 
00098   forceinline int
00099   MinMax::min(void) const {
00100     return mi;
00101   }
00102   forceinline int
00103   MinMax::max(void) const {
00104     return ma;
00105   }
00106   forceinline unsigned int
00107   MinMax::width(void) const {
00108     return static_cast<unsigned int>(ma-mi)+1;
00109   }
00110 
00111 }}}
00112 
00113 // STATISTICS: iter-any
00114