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 * Last modified: 00010 * $Date: 2009-01-26 15:15:18 +0100 (Mon, 26 Jan 2009) $ by $Author: schulte $ 00011 * $Revision: 8109 $ 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 00050 class Array { 00051 public: 00053 class Range { 00054 public: 00055 int min; int max; 00056 }; 00057 protected: 00059 Range* r; 00061 int c; 00063 int n; 00064 public: 00066 00067 00068 Array(void); 00070 Array(Range* r, int n); 00072 void init(Range* r, int n); 00074 00076 00077 00078 bool operator ()(void) const; 00080 void operator ++(void); 00082 void reset(void); 00084 00086 00087 00088 int min(void) const; 00090 int max(void) const; 00092 unsigned int width(void) const; 00094 }; 00095 00096 00097 forceinline 00098 Array::Array(void) {} 00099 00100 forceinline 00101 Array::Array(Range* r0, int n0) 00102 : r(r0), c(0), n(n0) {} 00103 00104 forceinline void 00105 Array::init(Range* r0, int n0) { 00106 r=r0; c=0; n=n0; 00107 } 00108 00109 forceinline void 00110 Array::operator ++(void) { 00111 c++; 00112 } 00113 forceinline bool 00114 Array::operator ()(void) const { 00115 return c < n; 00116 } 00117 00118 forceinline void 00119 Array::reset(void) { 00120 c=0; 00121 } 00122 00123 forceinline int 00124 Array::min(void) const { 00125 return r[c].min; 00126 } 00127 forceinline int 00128 Array::max(void) const { 00129 return r[c].max; 00130 } 00131 forceinline unsigned int 00132 Array::width(void) const { 00133 return static_cast<unsigned int>(r[c].max-r[c].min)+1; 00134 } 00135 00136 }}} 00137 00138 // STATISTICS: iter-any 00139