Generated on Mon Nov 30 23:53:31 2009 for Gecode by doxygen 1.6.1

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-10-26 16:51:22 +0100 (Mon, 26 Oct 2009) $ by $Author: schulte $
00011  *     $Revision: 9988 $
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     int cur;
00053     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 void
00083   BitSet<BS>::move(void) {
00084     while ((cur < limit) && !bs.get(cur))
00085       cur++;
00086   }
00087 
00088   template<class BS>
00089   forceinline
00090   BitSet<BS>::BitSet(const BS& bs0) 
00091     : bs(bs0), cur(0), limit(bs.size()) {
00092     move();
00093   }
00094 
00095   template<class BS>
00096   forceinline
00097   BitSet<BS>::BitSet(const BS& bs0, int n, int m) 
00098     : bs(bs0), cur(n), limit(std::min(bs.size(),m)) {
00099     move();
00100   }
00101 
00102   template<class BS>
00103   forceinline void
00104   BitSet<BS>::operator ++(void) {
00105     cur++; move();
00106   }
00107   template<class BS>
00108   forceinline bool
00109   BitSet<BS>::operator ()(void) const {
00110     return cur < bs.size();
00111   }
00112 
00113   template<class BS>
00114   forceinline int
00115   BitSet<BS>::val(void) const {
00116     return cur;
00117   }
00118 
00119 }}}
00120 
00121 // STATISTICS: iter-any