Generated on Thu Mar 22 10:39:42 2012 for Gecode by doxygen 1.6.3

ranges-list.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, 2010
00008  *
00009  *  Last modified:
00010  *     $Date: 2011-08-08 18:04:53 +0200 (Mon, 08 Aug 2011) $ by $Author: schulte $
00011  *     $Revision: 12253 $
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   class RangeListIter {
00046   protected:
00048     class RangeList : public Support::BlockClient<RangeList,Region> {
00049     public:
00051       int min, max;
00053       RangeList* next;
00054     };
00056     class RLIO : public Support::BlockAllocator<RangeList,Region> {
00057     public:
00059       unsigned int use_cnt;
00061       RLIO(Region& r);
00062     };
00064     RLIO* rlio;
00066     RangeList* h;
00068     RangeList* c;
00070     void set(RangeList* l);
00072     RangeList* get(void) const;
00074     RangeList* range(int min, int max, RangeList*& f);
00076     RangeList* range(int min, int max);
00078     template<class I>
00079     RangeList* range(I& i, RangeList*& f);
00081     template<class I>
00082     RangeList* range(I& i);
00084     template<class I>
00085     RangeList* copy(I& i);
00086   public:
00088 
00089 
00090     RangeListIter(void);
00092     RangeListIter(const RangeListIter& i);
00094     RangeListIter(Region& r);
00096     void init(Region& r);
00098     RangeListIter& operator =(const RangeListIter& i);
00100 
00102 
00103 
00104     bool operator ()(void) const;
00106     void operator ++(void);
00108     void reset(void);
00110 
00112 
00113 
00114     int min(void) const;
00116     int max(void) const;
00118     unsigned int width(void) const;
00120 
00122     ~RangeListIter(void);
00123   };
00124 
00125 
00126   forceinline
00127   RangeListIter::RLIO::RLIO(Region& r) 
00128     : Support::BlockAllocator<RangeList,Region>(r), use_cnt(1) {}
00129 
00130 
00131   forceinline
00132   RangeListIter::RangeListIter(void) 
00133     : rlio(NULL) {}
00134 
00135   forceinline
00136   RangeListIter::RangeListIter(Region& r) 
00137     : rlio(new (r.ralloc(sizeof(RLIO))) RLIO(r)), 
00138       h(NULL), c(NULL) {}
00139 
00140   forceinline void
00141   RangeListIter::init(Region& r) {
00142     rlio = new (r.ralloc(sizeof(RLIO))) RLIO(r);
00143     h = c = NULL;
00144   }
00145 
00146   forceinline
00147   RangeListIter::RangeListIter(const RangeListIter& i) 
00148     : rlio(i.rlio), h(i.h), c(i.c)  {
00149     rlio->use_cnt++;
00150   }
00151 
00152   forceinline RangeListIter&
00153   RangeListIter::operator =(const RangeListIter& i) {
00154     if (&i != this) {
00155       if (--rlio->use_cnt == 0) {
00156         Region& r = rlio->allocator();
00157         rlio->~RLIO();
00158         r.rfree(rlio,sizeof(RLIO));
00159       }
00160       rlio = i.rlio;
00161       rlio->use_cnt++;
00162       c=i.c; h=i.h;
00163     }
00164     return *this;
00165   }
00166 
00167   forceinline
00168   RangeListIter::~RangeListIter(void) {
00169     if (--rlio->use_cnt == 0) {
00170       Region& r = rlio->allocator();
00171       rlio->~RLIO();
00172       r.rfree(rlio,sizeof(RLIO));
00173     }
00174   }
00175 
00176 
00177   forceinline void
00178   RangeListIter::set(RangeList* l) {
00179     h = c = l;
00180   }
00181 
00182   forceinline RangeListIter::RangeList*
00183   RangeListIter::get(void) const {
00184     return h;
00185   }
00186 
00187   forceinline RangeListIter::RangeList*
00188   RangeListIter::range(int min, int max, RangeList*& f) {
00189     RangeList* t;
00190     // Take element from freelist if possible
00191     if (f != NULL) {
00192       t = f; f = f->next;
00193     } else {
00194       t = new (*rlio) RangeList;
00195     }
00196     t->min = min; t->max = max;
00197     return t;
00198   }
00199 
00200   forceinline RangeListIter::RangeList*
00201   RangeListIter::range(int min, int max) {
00202     RangeList* t = new (*rlio) RangeList;
00203     t->min = min; t->max = max;
00204     return t;
00205   }
00206 
00207   template<class I>
00208   forceinline RangeListIter::RangeList*
00209   RangeListIter::range(I& i, RangeList*& f) {
00210     return range(i.min(),i.max(),f);
00211   }
00212 
00213   template<class I>
00214   forceinline RangeListIter::RangeList*
00215   RangeListIter::range(I& i) {
00216     return range(i.min(),i.max());
00217   }
00218 
00219   template<class I>
00220   inline RangeListIter::RangeList*
00221   RangeListIter::copy(I& i) {
00222     RangeList*  h;
00223     RangeList** c = &h; 
00224     for ( ; i(); ++i) {
00225       RangeList* t = range(i);
00226       *c = t; c = &t->next;
00227     }
00228     *c = NULL;
00229     return h;
00230   }
00231 
00232   forceinline bool
00233   RangeListIter::operator ()(void) const {
00234     return c != NULL;
00235   }
00236 
00237   forceinline void
00238   RangeListIter::operator ++(void) {
00239     c = c->next;
00240   }
00241 
00242   forceinline void
00243   RangeListIter::reset(void) {
00244     c = h;
00245   }
00246 
00247   forceinline int
00248   RangeListIter::min(void) const {
00249     return c->min;
00250   }
00251   forceinline int
00252   RangeListIter::max(void) const {
00253     return c->max;
00254   }
00255   forceinline unsigned int
00256   RangeListIter::width(void) const {
00257     return static_cast<unsigned int>(c->max-c->min)+1;
00258   }
00259 
00260 }}}
00261 
00262 // STATISTICS: iter-any
00263