ranges-negative.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 00050 template<class I, bool strict=false> 00051 class Negative { 00052 protected: 00054 I i; 00055 public: 00057 00058 00059 Negative(void); 00061 Negative(I& i); 00063 void init(I& i); 00065 00067 00068 00069 bool operator ()(void) const; 00071 void operator ++(void); 00073 00075 00076 00077 int min(void) const; 00079 int max(void) const; 00081 unsigned int width(void) const; 00083 }; 00084 00085 00086 template<class I, bool strict> 00087 forceinline 00088 Negative<I,strict>::Negative(void) {} 00089 00090 template<class I, bool strict> 00091 forceinline void 00092 Negative<I,strict>::init(I& i0) { 00093 i=i0; 00094 } 00095 00096 template<class I, bool strict> 00097 forceinline 00098 Negative<I,strict>::Negative(I& i0) : i(i0) {} 00099 00100 template<class I, bool strict> 00101 forceinline void 00102 Negative<I,strict>::operator ++(void) { 00103 ++i; 00104 } 00105 template<class I, bool strict> 00106 forceinline bool 00107 Negative<I,strict>::operator ()(void) const { 00108 if (strict) { 00109 return i() && (i.min() < 0); 00110 } else { 00111 return i() && (i.min() <= 0); 00112 } 00113 } 00114 00115 template<class I, bool strict> 00116 forceinline int 00117 Negative<I,strict>::min(void) const { 00118 return i.min(); 00119 } 00120 template<class I, bool strict> 00121 forceinline int 00122 Negative<I,strict>::max(void) const { 00123 if (strict) { 00124 return std::min(i.max(),-1); 00125 } else { 00126 return std::min(i.max(),0); 00127 } 00128 } 00129 template<class I, bool strict> 00130 forceinline unsigned int 00131 Negative<I,strict>::width(void) const { 00132 return static_cast<unsigned int>(max()-min()+1); 00133 } 00134 00135 }}} 00136 00137 // STATISTICS: iter-any