ranges-positive.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, 2008 00008 * 00009 * Last modified: 00010 * $Date: 2010-07-28 17:35:33 +0200 (Wed, 28 Jul 2010) $ by $Author: schulte $ 00011 * $Revision: 11294 $ 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 #include <algorithm> 00039 00040 namespace Gecode { namespace Iter { namespace Ranges { 00041 00049 template<class I, bool strict=false> 00050 class Positive { 00051 protected: 00053 I i; 00054 public: 00056 00057 00058 Positive(void); 00060 Positive(I& i); 00062 void init(I& i); 00064 00066 00067 00068 bool operator ()(void) const; 00070 void operator ++(void); 00072 00074 00075 00076 int min(void) const; 00078 int max(void) const; 00080 unsigned int width(void) const; 00082 }; 00083 00084 00085 template<class I, bool strict> 00086 forceinline 00087 Positive<I,strict>::Positive(void) {} 00088 00089 template<class I, bool strict> 00090 forceinline void 00091 Positive<I,strict>::init(I& i0) { 00092 i=i0; 00093 if (strict) { 00094 while (i() && (i.max() < 0)) ++i; 00095 } else { 00096 while (i() && (i.max() <= 0)) ++i; 00097 } 00098 } 00099 00100 template<class I, bool strict> 00101 forceinline 00102 Positive<I,strict>::Positive(I& i) { 00103 init(i); 00104 } 00105 00106 template<class I, bool strict> 00107 forceinline void 00108 Positive<I,strict>::operator ++(void) { 00109 ++i; 00110 } 00111 template<class I, bool strict> 00112 forceinline bool 00113 Positive<I,strict>::operator ()(void) const { 00114 return i(); 00115 } 00116 00117 template<class I, bool strict> 00118 forceinline int 00119 Positive<I,strict>::min(void) const { 00120 if (strict) { 00121 return std::max(i.min(),1); 00122 } else { 00123 return std::max(i.min(),0); 00124 } 00125 } 00126 template<class I, bool strict> 00127 forceinline int 00128 Positive<I,strict>::max(void) const { 00129 return i.max(); 00130 } 00131 template<class I, bool strict> 00132 forceinline unsigned int 00133 Positive<I,strict>::width(void) const { 00134 return static_cast<unsigned int>(max()-min()+1); 00135 } 00136 00137 }}} 00138 00139 // STATISTICS: iter-any