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: 2009-09-08 21:10:29 +0200 (Tue, 08 Sep 2009) $ by $Author: schulte $ 00011 * $Revision: 9692 $ 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 private: 00053 IsRangeIter<I> _checkI; 00054 private: 00056 I i; 00057 public: 00059 00060 00061 Positive(void); 00063 Positive(I& i); 00065 void init(I& i); 00067 00069 00070 00071 bool operator ()(void) const; 00073 void operator ++(void); 00075 00077 00078 00079 int min(void) const; 00081 int max(void) const; 00083 unsigned int width(void) const; 00085 }; 00086 00087 00088 template<class I, bool strict> 00089 forceinline 00090 Positive<I,strict>::Positive(void) {} 00091 00092 template<class I, bool strict> 00093 forceinline void 00094 Positive<I,strict>::init(I& i0) { 00095 i=i0; 00096 if (strict) { 00097 while (i() && (i.max() < 0)) ++i; 00098 } else { 00099 while (i() && (i.max() <= 0)) ++i; 00100 } 00101 } 00102 00103 template<class I, bool strict> 00104 forceinline 00105 Positive<I,strict>::Positive(I& i) { 00106 init(i); 00107 } 00108 00109 template<class I, bool strict> 00110 forceinline void 00111 Positive<I,strict>::operator ++(void) { 00112 ++i; 00113 } 00114 template<class I, bool strict> 00115 forceinline bool 00116 Positive<I,strict>::operator ()(void) const { 00117 return i(); 00118 } 00119 00120 template<class I, bool strict> 00121 forceinline int 00122 Positive<I,strict>::min(void) const { 00123 if (strict) { 00124 return std::max(i.min(),1); 00125 } else { 00126 return std::max(i.min(),0); 00127 } 00128 } 00129 template<class I, bool strict> 00130 forceinline int 00131 Positive<I,strict>::max(void) const { 00132 return i.max(); 00133 } 00134 template<class I, bool strict> 00135 forceinline unsigned int 00136 Positive<I,strict>::width(void) const { 00137 return static_cast<unsigned int>(max()-min()+1); 00138 } 00139 00140 }}} 00141 00142 // STATISTICS: iter-any