Generated on Mon Aug 25 11:35:39 2008 for Gecode by doxygen 1.5.6

ranges-array.icc

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, 2006
00008  *
00009  *  Last modified:
00010  *     $Date: 2007-09-11 15:58:22 +0200 (Tue, 11 Sep 2007) $ by $Author: schulte $
00011  *     $Revision: 4973 $
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   class Array  {
00050   public:
00052     class Range {
00053     public:
00054       int min; int max;
00055     };
00056   protected:
00058     Range* r;
00060     int c;
00062     int n;
00063   public:
00065 
00066 
00067     Array(void);
00069     Array(Range* r, int n);
00071     void init(Range* r, int n);
00073 
00075 
00076 
00077     bool operator()(void) const;
00079     void operator++(void);
00081     void reset(void);
00083 
00085 
00086 
00087     int min(void) const;
00089     int max(void) const;
00091     unsigned int width(void) const;
00093   };
00094 
00095 
00096   forceinline
00097   Array::Array(void) {}
00098 
00099   forceinline
00100   Array::Array(Range* r0, int n0)
00101     : r(r0), c(0), n(n0) {}
00102 
00103   forceinline void
00104   Array::init(Range* r0, int n0) {
00105     r=r0; c=0; n=n0;
00106   }
00107 
00108   forceinline void
00109   Array::operator++(void) {
00110     c++;
00111   }
00112   forceinline bool
00113   Array::operator()(void) const {
00114     return c < n;
00115   }
00116 
00117   forceinline void
00118   Array::reset(void) {
00119     c=0;
00120   }
00121 
00122   forceinline int
00123   Array::min(void) const {
00124     return r[c].min;
00125   }
00126   forceinline int
00127   Array::max(void) const {
00128     return r[c].max;
00129   }
00130   forceinline unsigned int
00131   Array::width(void) const {
00132     return static_cast<unsigned int>(r[c].max-r[c].min)+1;
00133   }
00134 
00135 }}}
00136 
00137 // STATISTICS: iter-any
00138