ranges-size.hpp
Go to the documentation of this file.
00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ 00002 /* 00003 * Main authors: 00004 * Guido Tack <tack@gecode.org> 00005 * 00006 * Copyright: 00007 * Guido Tack, 2006 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 namespace Gecode { namespace Iter { namespace Ranges { 00039 00049 template<class I> 00050 class Size { 00051 private: 00053 IsRangeIter<I> _checkI; 00054 protected: 00056 I i; 00058 unsigned int _size; 00059 public: 00061 00062 00063 Size(void); 00065 Size(I& i); 00067 void init(I& i); 00069 00071 00072 00073 bool operator ()(void); 00075 void operator ++(void); 00077 00079 00080 00081 int min(void) const; 00083 int max(void) const; 00085 unsigned int width(void) const; 00087 00089 00090 00091 unsigned int size(void) const; 00093 }; 00094 00095 00096 template<class I> 00097 forceinline 00098 Size<I>::Size(void) 00099 : _size(0) {} 00100 00101 template<class I> 00102 inline void 00103 Size<I>::init(I& i0) { 00104 i.init(i0); 00105 _size = 0; 00106 } 00107 00108 template<class I> 00109 inline 00110 Size<I>::Size(I& i0) : i(i0), _size(0) {} 00111 00112 template<class I> 00113 forceinline void 00114 Size<I>::operator ++(void) { 00115 _size += i.width(); 00116 ++i; 00117 } 00118 template<class I> 00119 forceinline bool 00120 Size<I>::operator ()(void) { 00121 return i(); 00122 } 00123 00124 template<class I> 00125 forceinline int 00126 Size<I>::min(void) const { 00127 return i.min(); 00128 } 00129 template<class I> 00130 forceinline int 00131 Size<I>::max(void) const { 00132 return i.max(); 00133 } 00134 template<class I> 00135 forceinline unsigned int 00136 Size<I>::width(void) const { 00137 return i.width(); 00138 } 00139 00140 template<class I> 00141 forceinline unsigned int 00142 Size<I>::size(void) const { 00143 return _size; 00144 } 00145 00146 }}} 00147 00148 // STATISTICS: iter-any 00149