Generated on Sat Feb 7 2015 02:01:26 for Gecode by doxygen 1.8.9.1
iter-prune-val.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, 2011
8  *
9  * Last modified:
10  * $Date: 2011-09-08 14:34:40 +0200 (Thu, 08 Sep 2011) $ by $Author: schulte $
11  * $Revision: 12395 $
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 Int { namespace ViewValGraph {
39 
40  template<class View>
43  : x(y), e(y->val_edges()) {
44  while ((e != NULL) && e->used(x))
45  e = e->next_edge();
46  }
47  template<class View>
48  forceinline bool
50  return e != NULL;
51  }
52  template<class View>
53  forceinline void
55  assert(!e->used(x));
56  do {
57  e = e->next_edge();
58  } while ((e != NULL) && e->used(x));
59  }
60  template<class View>
61  forceinline int
63  assert(!e->used(x));
64  return e->val(x)->val();
65  }
66 
67 }}}
68 
69 // STATISTICS: int-prop
70 
IterPruneVal(ViewNode< View > *x)
Initialize with edges for view node x.
View nodes in view-value graph.
Edge< View > * e
Current value edge.
void operator++(void)
Move iterator to next value (if possible)
Node * x
Pointer to corresponding Boolean expression node.
Definition: bool-expr.cpp:253
#define forceinline
Definition: config.hpp:132
int val(void) const
Return current value.
bool operator()(void) const
Test whether iterator is still at a value or done.
Gecode toplevel namespace
ViewNode< View > * x
View node.