Generated on Sat Feb 7 2015 02:01:26 for Gecode by doxygen 1.8.9.1
values-bitset.hpp
Go to the documentation of this file.
1 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2 /*
3  * Main authors:
4  * Christian Schulte <schulte@gecode.org>
5  *
6  * Copyright:
7  * Christian Schulte, 2008
8  *
9  * Last modified:
10  * $Date: 2010-07-28 17:35:33 +0200 (Wed, 28 Jul 2010) $ by $Author: schulte $
11  * $Revision: 11294 $
12  *
13  * This file is part of Gecode, the generic constraint
14  * development environment:
15  * http://www.gecode.org
16  *
17  * Permission is hereby granted, free of charge, to any person obtaining
18  * a copy of this software and associated documentation files (the
19  * "Software"), to deal in the Software without restriction, including
20  * without limitation the rights to use, copy, modify, merge, publish,
21  * distribute, sublicense, and/or sell copies of the Software, and to
22  * permit persons to whom the Software is furnished to do so, subject to
23  * the following conditions:
24  *
25  * The above copyright notice and this permission notice shall be
26  * included in all copies or substantial portions of the Software.
27  *
28  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
29  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
31  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
32  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
33  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
34  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35  *
36  */
37 
38 namespace Gecode { namespace Iter { namespace Values {
39 
45  template<class BS>
46  class BitSet {
47  protected:
49  const BS& bs;
51  unsigned int cur;
53  unsigned int limit;
55  void move(void);
56  public:
58 
59  BitSet(const BS& bs);
62  BitSet(const BS& bs, int n, int m);
64 
66 
67  bool operator ()(void) const;
70  void operator ++(void);
72 
74 
75  int val(void) const;
78  };
79 
80 
81  template<class BS>
83  BitSet<BS>::BitSet(const BS& bs0)
84  : bs(bs0), cur(bs.next(0)), limit(bs.size()) {
85  }
86 
87  template<class BS>
89  BitSet<BS>::BitSet(const BS& bs0, int n, int m)
90  : bs(bs0),
91  cur(bs.next(static_cast<unsigned int>(n))),
92  limit(std::min(bs.size(),static_cast<unsigned int>(m)+1)) {
93  }
94 
95  template<class BS>
96  forceinline void
98  cur=bs.next(cur+1);
99  }
100  template<class BS>
101  forceinline bool
103  return cur < limit;
104  }
105 
106  template<class BS>
107  forceinline int
108  BitSet<BS>::val(void) const {
109  return static_cast<int>(cur);
110  }
111 
112 }}}
113 
114 // STATISTICS: iter-any
void move(void)
Move to next set bit.
unsigned int cur
Current value.
bool operator()(void) const
Test whether iterator is still at a value or done.
Value iterator for values in a bitset.
int n
Number of negative literals for node type.
Definition: bool-expr.cpp:238
unsigned int size(I &i)
Size of all ranges of range iterator i.
BitSet(const BS &bs)
Initialize with bitset bs.
unsigned int limit
Limit value.
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition: arithmetic.cpp:75
void operator++(void)
Move iterator to next value (if possible)
int val(void) const
Return current value.
#define forceinline
Definition: config.hpp:132
Gecode toplevel namespace