virtual-ranges.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 { namespace Virt { 00039 00045 class Iterator { 00046 public: 00048 00049 00050 virtual void operator ++(void) = 0; 00052 virtual bool operator ()(void) = 0; 00054 00055 00056 00057 virtual int min(void) const = 0; 00059 virtual int max(void) const = 0; 00061 virtual unsigned int width(void) const = 0; 00063 00065 virtual ~Iterator(void); 00066 }; 00067 00068 forceinline 00069 Iterator::~Iterator(void) {} 00070 00079 template<class I> 00080 class RangesTemplate : public Iterator { 00081 private: 00083 IsRangeIter<I> _checkI; 00084 private: 00086 I i; 00087 public: 00089 00090 00091 RangesTemplate(I& i); 00093 void init(I& i); 00095 00096 00097 00098 virtual void operator ++(void); 00100 virtual bool operator ()(void); 00102 00104 00105 00106 virtual int min(void) const; 00108 virtual int max(void) const; 00110 virtual unsigned int width(void) const; 00112 }; 00113 00114 template<class I> 00115 RangesTemplate<I>::RangesTemplate(I& i0) : i(i0) {} 00116 00117 template<class I> 00118 void 00119 RangesTemplate<I>::init(I& i0) { i=i0; } 00120 00121 template<class I> 00122 bool 00123 RangesTemplate<I>::operator ()(void) { return i(); } 00124 00125 template<class I> 00126 void 00127 RangesTemplate<I>::operator ++(void) { ++i; } 00128 00129 template<class I> 00130 int 00131 RangesTemplate<I>::min(void) const { return i.min(); } 00132 00133 template<class I> 00134 int 00135 RangesTemplate<I>::max(void) const { return i.max(); } 00136 00137 template<class I> 00138 unsigned int 00139 RangesTemplate<I>::width(void) const { return i.width(); } 00140 00141 }}}} 00142 00143 // STATISTICS: iter-any