ranges-add.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, 2005 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 namespace Gecode { namespace Iter { namespace Ranges { 00039 00045 template<class I> 00046 class AddRange : public MinMax { 00047 protected: 00049 I i; 00051 int r_min; 00053 int r_max; 00054 public: 00056 00057 00058 AddRange(void); 00060 AddRange(I& i, int min, int max); 00062 void init(I& i, int min, int max); 00064 00066 00067 00068 void operator ++(void); 00070 }; 00071 00072 00078 template<class I> 00079 class SubRange : public AddRange<I> { 00080 public: 00082 00083 00084 SubRange(void); 00086 SubRange(I& i, int min, int max); 00088 void init(I& i, int min, int max); 00090 }; 00091 00092 template<class I> 00093 forceinline 00094 AddRange<I>::AddRange(void) {} 00095 00096 template<class I> 00097 forceinline void 00098 AddRange<I>::operator ++(void) { 00099 if (i()) { 00100 mi = r_min + i.min(); 00101 ma = r_max + i.max(); 00102 ++i; 00103 while (i() && (ma+1 >= r_min+i.min())) { 00104 ma = r_max + i.max(); ++i; 00105 } 00106 } else { 00107 finish(); 00108 } 00109 } 00110 00111 template<class I> 00112 forceinline 00113 AddRange<I>::AddRange(I& i0, int r_min0, int r_max0) 00114 : i(i0), r_min(r_min0), r_max(r_max0) { 00115 operator ++(); 00116 } 00117 00118 template<class I> 00119 forceinline void 00120 AddRange<I>::init(I& i0, int r_min0, int r_max0) { 00121 i = i0; r_min = r_min0; r_max = r_max0; 00122 operator ++(); 00123 } 00124 00125 00126 template<class I> 00127 forceinline 00128 SubRange<I>::SubRange(void) {} 00129 00130 template<class I> 00131 forceinline 00132 SubRange<I>::SubRange(I& i, int r_min, int r_max) 00133 : AddRange<I>(i,-r_max,-r_min) {} 00134 00135 template<class I> 00136 forceinline void 00137 SubRange<I>::init(I& i, int r_min, int r_max) { 00138 AddRange<I>::init(i,-r_max,-r_min); 00139 } 00140 00141 }}} 00142 00143 // STATISTICS: iter-any 00144