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 * Last modified: 00010 * $Date: 2008-12-05 16:43:57 +0100 (Fri, 05 Dec 2008) $ by $Author: schulte $ 00011 * $Revision: 7989 $ 00012 * 00013 * This file is part of Gecode, the generic constraint 00014 * development environment: 00015 * http://www.gecode.org 00016 * 00017 * Permission is hereby granted, free of charge, to any person obtaining 00018 * a copy of this software and associated documentation files (the 00019 * "Software"), to deal in the Software without restriction, including 00020 * without limitation the rights to use, copy, modify, merge, publish, 00021 * distribute, sublicense, and/or sell copies of the Software, and to 00022 * permit persons to whom the Software is furnished to do so, subject to 00023 * the following conditions: 00024 * 00025 * The above copyright notice and this permission notice shall be 00026 * included in all copies or substantial portions of the Software. 00027 * 00028 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 00029 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 00030 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 00031 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 00032 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 00033 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 00034 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 00035 * 00036 */ 00037 00038 namespace Gecode { namespace Iter { namespace Ranges { 00039 00051 class MinMax { 00052 protected: 00054 int mi; 00056 int ma; 00058 void finish(void); 00059 public: 00061 00062 00063 MinMax(void); 00065 MinMax(int min, int max); 00067 00069 00070 00071 bool operator ()(void) const; 00073 00075 00076 00077 int min(void) const; 00079 int max(void) const; 00081 unsigned int width(void) const; 00083 }; 00084 00085 forceinline void 00086 MinMax::finish(void) { 00087 mi = 1; ma = 0; 00088 } 00089 00090 forceinline 00091 MinMax::MinMax(void) {} 00092 00093 forceinline 00094 MinMax::MinMax(int min, int max) 00095 : mi(min), ma(max) {} 00096 00097 forceinline bool 00098 MinMax::operator ()(void) const { 00099 return mi <= ma; 00100 } 00101 00102 forceinline int 00103 MinMax::min(void) const { 00104 return mi; 00105 } 00106 forceinline int 00107 MinMax::max(void) const { 00108 return ma; 00109 } 00110 forceinline unsigned int 00111 MinMax::width(void) const { 00112 return static_cast<unsigned int>(ma-mi)+1; 00113 } 00114 00115 }}} 00116 00117 // STATISTICS: iter-any 00118