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: 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 00050 template<class I, bool strict=false> 00051 class Negative { 00052 private: 00054 IsRangeIter<I> _checkI; 00055 private: 00057 I i; 00058 public: 00060 00061 00062 Negative(void); 00064 Negative(I& i); 00066 void init(I& i); 00068 00070 00071 00072 bool operator ()(void) const; 00074 void operator ++(void); 00076 00078 00079 00080 int min(void) const; 00082 int max(void) const; 00084 unsigned int width(void) const; 00086 }; 00087 00088 00089 template<class I, bool strict> 00090 forceinline 00091 Negative<I,strict>::Negative(void) {} 00092 00093 template<class I, bool strict> 00094 forceinline void 00095 Negative<I,strict>::init(I& i0) { 00096 i=i0; 00097 } 00098 00099 template<class I, bool strict> 00100 forceinline 00101 Negative<I,strict>::Negative(I& i0) : i(i0) {} 00102 00103 template<class I, bool strict> 00104 forceinline void 00105 Negative<I,strict>::operator ++(void) { 00106 ++i; 00107 } 00108 template<class I, bool strict> 00109 forceinline bool 00110 Negative<I,strict>::operator ()(void) const { 00111 if (strict) { 00112 return i() && (i.min() < 0); 00113 } else { 00114 return i() && (i.min() <= 0); 00115 } 00116 } 00117 00118 template<class I, bool strict> 00119 forceinline int 00120 Negative<I,strict>::min(void) const { 00121 return i.min(); 00122 } 00123 template<class I, bool strict> 00124 forceinline int 00125 Negative<I,strict>::max(void) const { 00126 if (strict) { 00127 return std::min(i.max(),-1); 00128 } else { 00129 return std::min(i.max(),0); 00130 } 00131 } 00132 template<class I, bool strict> 00133 forceinline unsigned int 00134 Negative<I,strict>::width(void) const { 00135 return static_cast<unsigned int>(max()-min()+1); 00136 } 00137 00138 }}} 00139 00140 // STATISTICS: iter-any