Generated on Thu Apr 11 13:59:13 2019 for Gecode by doxygen 1.6.3

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  *  This file is part of Gecode, the generic constraint
00010  *  development environment:
00011  *     http://www.gecode.org
00012  *
00013  *  Permission is hereby granted, free of charge, to any person obtaining
00014  *  a copy of this software and associated documentation files (the
00015  *  "Software"), to deal in the Software without restriction, including
00016  *  without limitation the rights to use, copy, modify, merge, publish,
00017  *  distribute, sublicense, and/or sell copies of the Software, and to
00018  *  permit persons to whom the Software is furnished to do so, subject to
00019  *  the following conditions:
00020  *
00021  *  The above copyright notice and this permission notice shall be
00022  *  included in all copies or substantial portions of the Software.
00023  *
00024  *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
00025  *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
00026  *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
00027  *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
00028  *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
00029  *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
00030  *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
00031  *
00032  */
00033 
00034 namespace Gecode { namespace Iter { namespace Ranges {
00035 
00045   class Cache : public RangeListIter {
00046   public:
00048 
00049 
00050     Cache(void);
00052     Cache(const Cache& m);
00054     template<class I>
00055     Cache(Region& r, I& i);
00057     template<class I>
00058     void init(Region& r, I& i);
00060     Cache& operator =(const Cache& m);
00062   };
00063 
00064 
00065   forceinline
00066   Cache::Cache(void) {}
00067 
00068   forceinline
00069   Cache::Cache(const Cache& m)
00070     : RangeListIter(m) {}
00071 
00072   template<class I>
00073   void
00074   Cache::init(Region& r, I& i) {
00075     RangeListIter::init(r);
00076     RangeList* h = NULL;
00077     RangeList** p = &h;
00078     for (; i(); ++i) {
00079       RangeList* t = new (*rlio) RangeList;
00080       *p = t; p = &t->next;
00081       t->min = i.min();
00082       t->max = i.max();
00083     }
00084     *p = NULL;
00085     RangeListIter::set(h);
00086   }
00087 
00088   template<class I>
00089   forceinline
00090   Cache::Cache(Region& r, I& i) {
00091     init(r,i);
00092   }
00093 
00094   forceinline Cache&
00095   Cache::operator =(const Cache& m) {
00096     return static_cast<Cache&>(RangeListIter::operator =(m));
00097   }
00098 
00099 }}}
00100 
00101 // STATISTICS: iter-any
00102