edge.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, 2003
*
* 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
Edge<View>::Edge(ValNode<View>* s, ViewNode<View>* d)
: sd(s,d) {
s->add(this);
}
template<class View>
forceinline
Edge<View>::Edge(ValNode<View>* s, ViewNode<View>* d, Edge<View>* n)
: _next_edge(n), sd(s,d) {
s->add(this);
}
template<class View>
forceinline Node<View>*
Edge<View>::dst(Node<View>* s) const {
return sd.ptr(s);
}
template<class View>
forceinline void
Edge<View>::revert(Node<View>* d) {
unlink();
d->add(this);
}
template<class View>
forceinline ViewNode<View>*
Edge<View>::view(ValNode<View>* n) const {
return static_cast<ViewNode<View>*>(sd.ptr(n));
}
template<class View>
forceinline ValNode<View>*
Edge<View>::val(ViewNode<View>* x) const {
return static_cast<ValNode<View>*>(sd.ptr(x));
}
template<class View>
forceinline bool
Edge<View>::used(Node<View>* v) const {
return sd.is_set() || (v->comp == sd.ptr(v)->comp);
}
template<class View>
forceinline void
Edge<View>::use(void) {
sd.set();
}
template<class View>
forceinline void
Edge<View>::free(void) {
sd.unset();
}
template<class View>
forceinline Edge<View>*
Edge<View>::next_edge(void) const {
return _next_edge;
}
template<class View>
forceinline Edge<View>**
Edge<View>::next_edge_ref(void) {
return &_next_edge;
}
template<class View>
forceinline Edge<View>*
Edge<View>::next(void) const {
return static_cast<Edge<View>*>(BiLink::next());
}
template<class View>
forceinline void
Edge<View>::operator delete(void*, size_t) {}
template<class View>
forceinline void
Edge<View>::operator delete(void*,Space&) {}
template<class View>
forceinline void*
Edge<View>::operator new(size_t s, Space& home) {
return home.ralloc(s);
}
}}}
// STATISTICS: int-prop
Gecode::Int::ViewValGraph::BiLink::add
void add(BiLink *l)
Add l after this element.
Definition bi-link.hpp:59
Gecode::Int::ViewValGraph::BiLink::unlink
void unlink(void)
Unlink this element.
Definition bi-link.hpp:64
Gecode::Int::ViewValGraph::BiLink::next
BiLink * next(void) const
Return next element.
Definition bi-link.hpp:46
Gecode::Int::ViewValGraph::Edge
Edges in view-value graph.
Definition view-val-graph.hh:208
Gecode::Int::ViewValGraph::Edge::Edge
Edge(ValNode< View > *v, ViewNode< View > *x)
Construct new edge between x and v.
Definition edge.hpp:38
Gecode::Int::ViewValGraph::Edge::val
ValNode< View > * val(ViewNode< View > *x) const
Return value node when view node x is given.
Definition edge.hpp:69
Gecode::Int::ViewValGraph::Edge::sd
CombPtrFlag< Node< View > > sd
Combine source and destination node and flag.
Definition view-val-graph.hh:213
Gecode::Int::ViewValGraph::Edge::next_edge
Edge< View > * next_edge(void) const
Return next edge in list of value edges.
Definition edge.hpp:91
Gecode::Int::ViewValGraph::Edge::view
ViewNode< View > * view(ValNode< View > *v) const
Return view node when value node v is given.
Definition edge.hpp:64
Gecode::Int::ViewValGraph::Edge::next_edge_ref
Edge< View > ** next_edge_ref(void)
Return reference to next edge in list of value edges.
Definition edge.hpp:96
Gecode::Int::ViewValGraph::Edge::dst
Node< View > * dst(Node< View > *s) const
Return destination of edge when source s is given.
Definition edge.hpp:51
Gecode::Int::ViewValGraph::Edge::free
void free(void)
Unmark node as used.
Definition edge.hpp:85
Gecode::Int::ViewValGraph::Edge::_next_edge
Edge< View > * _next_edge
Next edge in chain of value edges.
Definition view-val-graph.hh:211
Gecode::Int::ViewValGraph::Edge::use
void use(void)
Mark node as used.
Definition edge.hpp:80
Gecode::Int::ViewValGraph::Edge::next
Edge< View > * next(void) const
Return next edge in list of edges per node.
Definition edge.hpp:101
Gecode::Int::ViewValGraph::Edge::revert
void revert(Node< View > *d)
Revert edge to node d for matching.
Definition edge.hpp:57
Gecode::Int::ViewValGraph::Edge::used
bool used(Node< View > *v) const
Whether edge is used (marked or between nodes from the same scc).
Definition edge.hpp:75
Gecode::Int::ViewValGraph::Node
Base-class for nodes (both view and value nodes).
Definition view-val-graph.hh:116
Gecode::Int::ViewValGraph::ValNode
Value nodes in view-value graph.
Definition view-val-graph.hh:142
Gecode::Int::ViewValGraph::ViewNode
View nodes in view-value graph.
Definition view-val-graph.hh:174
Gecode::Space
Computation spaces.
Definition core.hpp:1742
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