ranges-cache.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, 2004 00008 * 00009 * Last modified: 00010 * $Date: 2010-07-28 16:13:53 +0200 (Wed, 28 Jul 2010) $ by $Author: schulte $ 00011 * $Revision: 11292 $ 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 Cache : public RangeListIter { 00051 public: 00053 00054 00055 Cache(void); 00057 Cache(const Cache& m); 00059 Cache(Region& r, I& i); 00061 void init(Region& r, I& i); 00063 Cache& operator =(const Cache& m); 00065 }; 00066 00067 00068 template<class I> 00069 forceinline 00070 Cache<I>::Cache(void) {} 00071 00072 template<class I> 00073 forceinline 00074 Cache<I>::Cache(const Cache& m) 00075 : RangeListIter(m) {} 00076 00077 template<class I> 00078 void 00079 Cache<I>::init(Region& r, I& i) { 00080 RangeListIter::init(r); 00081 RangeList* h = NULL; 00082 RangeList** p = &h; 00083 for (; i(); ++i) { 00084 RangeList* t = new (*rlio) RangeList; 00085 *p = t; p = &t->next; 00086 t->min = i.min(); 00087 t->max = i.max(); 00088 } 00089 *p = NULL; 00090 RangeListIter::set(h); 00091 } 00092 00093 template<class I> 00094 forceinline 00095 Cache<I>::Cache(Region& r, I& i) { 00096 init(r,i); 00097 } 00098 00099 template<class I> 00100 forceinline Cache<I>& 00101 Cache<I>::operator =(const Cache<I>& m) { 00102 return static_cast<Cache&>(RangeListIter::operator =(m)); 00103 } 00104 00105 }}} 00106 00107 // STATISTICS: iter-any 00108