values-bitset.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, 2008 00008 * 00009 * Last modified: 00010 * $Date: 2009-12-17 15:16:53 +0100 (Thu, 17 Dec 2009) $ by $Author: schulte $ 00011 * $Revision: 10207 $ 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 Values { 00039 00045 template<class BS> 00046 class BitSet { 00047 private: 00049 const BS& bs; 00051 unsigned int cur; 00053 unsigned int limit; 00055 void move(void); 00056 public: 00058 00059 00060 BitSet(const BS& bs); 00062 BitSet(const BS& bs, int n, int m); 00064 00066 00067 00068 bool operator ()(void) const; 00070 void operator ++(void); 00072 00074 00075 00076 int val(void) const; 00078 }; 00079 00080 00081 template<class BS> 00082 forceinline 00083 BitSet<BS>::BitSet(const BS& bs0) 00084 : bs(bs0), cur(bs.next(0)), limit(bs.size()) { 00085 } 00086 00087 template<class BS> 00088 forceinline 00089 BitSet<BS>::BitSet(const BS& bs0, int n, int m) 00090 : bs(bs0), 00091 cur(bs.next(static_cast<unsigned int>(n))), 00092 limit(std::min(bs.size(),static_cast<unsigned int>(m)+1)) { 00093 } 00094 00095 template<class BS> 00096 forceinline void 00097 BitSet<BS>::operator ++(void) { 00098 cur=bs.next(cur+1); 00099 } 00100 template<class BS> 00101 forceinline bool 00102 BitSet<BS>::operator ()(void) const { 00103 return cur < limit; 00104 } 00105 00106 template<class BS> 00107 forceinline int 00108 BitSet<BS>::val(void) const { 00109 return static_cast<int>(cur); 00110 } 00111 00112 }}} 00113 00114 // STATISTICS: iter-any