ranges-array.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, 2006 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 00046 class Array { 00047 public: 00049 class Range { 00050 public: 00051 int min; 00052 int max; 00053 }; 00054 protected: 00056 Range* r; 00058 int c; 00060 int n; 00061 public: 00063 00064 00065 Array(void); 00067 Array(Range* r, int n); 00069 void init(Range* r, int n); 00071 00073 00074 00075 bool operator ()(void) const; 00077 void operator ++(void); 00079 void reset(void); 00081 00083 00084 00085 int min(void) const; 00087 int max(void) const; 00089 unsigned int width(void) const; 00091 }; 00092 00093 00094 forceinline 00095 Array::Array(void) {} 00096 00097 forceinline 00098 Array::Array(Range* r0, int n0) 00099 : r(r0), c(0), n(n0) {} 00100 00101 forceinline void 00102 Array::init(Range* r0, int n0) { 00103 r=r0; c=0; n=n0; 00104 } 00105 00106 forceinline void 00107 Array::operator ++(void) { 00108 c++; 00109 } 00110 forceinline bool 00111 Array::operator ()(void) const { 00112 return c < n; 00113 } 00114 00115 forceinline void 00116 Array::reset(void) { 00117 c=0; 00118 } 00119 00120 forceinline int 00121 Array::min(void) const { 00122 return r[c].min; 00123 } 00124 forceinline int 00125 Array::max(void) const { 00126 return r[c].max; 00127 } 00128 forceinline unsigned int 00129 Array::width(void) const { 00130 return static_cast<unsigned int>(r[c].max-r[c].min)+1; 00131 } 00132 00133 }}} 00134 00135 // STATISTICS: iter-any 00136