Generated on Tue Feb 11 2025 17:33:26 for Gecode by doxygen 1.12.0
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 * This file is part of Gecode, the generic constraint
10 * development environment:
11 * http://www.gecode.org
12 *
13 * Permission is hereby granted, free of charge, to any person obtaining
14 * a copy of this software and associated documentation files (the
15 * "Software"), to deal in the Software without restriction, including
16 * without limitation the rights to use, copy, modify, merge, publish,
17 * distribute, sublicense, and/or sell copies of the Software, and to
18 * permit persons to whom the Software is furnished to do so, subject to
19 * the following conditions:
20 *
21 * The above copyright notice and this permission notice shall be
22 * included in all copies or substantial portions of the Software.
23 *
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31 *
32 */
33
34namespace Gecode { namespace Iter { namespace Values {
35
41 template<class BS>
42 class BitSet {
43 protected:
45 const BS& bs;
47 unsigned int cur;
49 unsigned int limit;
51 void move(void);
52 public:
54
55
56 BitSet(const BS& bs);
58 BitSet(const BS& bs, int n, int m);
60
62
63
64 bool operator ()(void) const;
66 void operator ++(void);
68
70
71
72 int val(void) const;
74 };
75
76
77 template<class BS>
79 BitSet<BS>::BitSet(const BS& bs0)
80 : bs(bs0), cur(bs.next(0)), limit(bs.size()) {
81 }
82
83 template<class BS>
85 BitSet<BS>::BitSet(const BS& bs0, int n, int m)
86 : bs(bs0),
87 cur(bs.next(static_cast<unsigned int>(n))),
88 limit(std::min(bs.size(),static_cast<unsigned int>(m)+1)) {
89 }
90
91 template<class BS>
92 forceinline void
94 cur=bs.next(cur+1);
95 }
96 template<class BS>
97 forceinline bool
99 return cur < limit;
100 }
101
102 template<class BS>
103 forceinline int
104 BitSet<BS>::val(void) const {
105 return static_cast<int>(cur);
106 }
107
108}}}
109
110// STATISTICS: iter-any
int n
Number of negative literals for node type.
Value iterator for values in a bitset.
unsigned int limit
Limit value.
void operator++(void)
Move iterator to next value (if possible)
BitSet(const BS &bs)
Initialize with bitset bs.
bool operator()(void) const
Test whether iterator is still at a value or done.
int val(void) const
Return current value.
unsigned int cur
Current value.
void move(void)
Move to next set bit.
Gecode toplevel namespace
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
#define forceinline
Definition config.hpp:187