iter-prune-val.hpp
Go to the documentation of this file.
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2011
*
* This file is part of Gecode, the generic constraint
* development environment:
* http://www.gecode.org
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*/
namespace Gecode { namespace Int { namespace ViewValGraph {
template<class View>
forceinline
IterPruneVal<View>::IterPruneVal(ViewNode<View>* y)
: x(y), e(y->val_edges()) {
while ((e != NULL) && e->used(x))
e = e->next_edge();
}
template<class View>
forceinline bool
IterPruneVal<View>::operator ()(void) const {
return e != NULL;
}
template<class View>
forceinline void
IterPruneVal<View>::operator ++(void) {
assert(!e->used(x));
do {
e = e->next_edge();
} while ((e != NULL) && e->used(x));
}
template<class View>
forceinline int
IterPruneVal<View>::val(void) const {
assert(!e->used(x));
return e->val(x)->val();
}
}}}
// STATISTICS: int-prop
Gecode::Int::ViewValGraph::IterPruneVal::x
ViewNode< View > * x
View node.
Definition view-val-graph.hh:257
Gecode::Int::ViewValGraph::IterPruneVal::val
int val(void) const
Return current value.
Definition iter-prune-val.hpp:58
Gecode::Int::ViewValGraph::IterPruneVal::IterPruneVal
IterPruneVal(ViewNode< View > *x)
Initialize with edges for view node x.
Definition iter-prune-val.hpp:38
Gecode::Int::ViewValGraph::IterPruneVal::operator++
void operator++(void)
Move iterator to next value (if possible).
Definition iter-prune-val.hpp:50
Gecode::Int::ViewValGraph::IterPruneVal::operator()
bool operator()(void) const
Test whether iterator is still at a value or done.
Definition iter-prune-val.hpp:45
Gecode::Int::ViewValGraph::IterPruneVal::e
Edge< View > * e
Current value edge.
Definition view-val-graph.hh:259
Gecode::Int::ViewValGraph::ViewNode
View nodes in view-value graph.
Definition view-val-graph.hh:174
Gecode::Int::ViewValGraph
Support classes for propagators using a view-value graph.
Gecode::Int
Finite domain integers.
Gecode
Gecode toplevel namespace
forceinline
#define forceinline
Definition config.hpp:187