Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
4.3 kB · 167 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168/* -*- 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 {
/* * Nodes * */
template<class View> forceinline Node<View>::Node(void) : min(0) { // Must be initialized such that the node is considered unvisited initially } template<class View> forceinline Edge<View>* Node<View>::edge_fst(void) const { return static_cast<Edge<View>*>(BiLink::next()); } template<class View> forceinline Edge<View>* Node<View>::edge_lst(void) const { return static_cast<Edge<View>*>(static_cast<BiLink*>(const_cast<Node<View>*>(this))); } template<class View> forceinline void Node<View>::operator delete(void*, size_t) {} template<class View> forceinline void Node<View>::operator delete(void*,Space&) {} template<class View> forceinline void* Node<View>::operator new(size_t s, Space& home) { return home.ralloc(s); }
/* * Value nodes * */
template<class View> forceinline ValNode<View>::ValNode(int v) : _val(v), _matching(nullptr) {} template<class View> forceinline ValNode<View>::ValNode(int v, ValNode<View>* n) : _val(v), _matching(nullptr), _next_val(n) {} template<class View> forceinline int ValNode<View>::val(void) const { return _val; } template<class View> forceinline void ValNode<View>::matching(Edge<View>* m) { _matching = m; } template<class View> forceinline Edge<View>* ValNode<View>::matching(void) const { return _matching; } template<class View> forceinline ValNode<View>** ValNode<View>::next_val_ref(void) { return &_next_val; } template<class View> forceinline ValNode<View>* ValNode<View>::next_val(void) const { return _next_val; } template<class View> forceinline void ValNode<View>::next_val(ValNode<View>* n) { _next_val = n; }
/* * View nodes * */
template<class View> forceinline ViewNode<View>::ViewNode(void) : _view(View(nullptr)) {} template<class View> forceinline ViewNode<View>::ViewNode(View x) : _size(x.size()), _view(x) {} template<class View> forceinline Edge<View>* ViewNode<View>::val_edges(void) const { return _val_edges; } template<class View> forceinline Edge<View>** ViewNode<View>::val_edges_ref(void) { return &_val_edges; } template<class View> forceinline bool ViewNode<View>::fake(void) const { return _view.varimp() == nullptr; } template<class View> forceinline View ViewNode<View>::view(void) const { return _view; } template<class View> forceinline bool ViewNode<View>::changed(void) const { return _size != _view.size(); } template<class View> forceinline void ViewNode<View>::update(void) { _size = _view.size(); } template<class View> forceinline bool ViewNode<View>::matched(void) const { return Node<View>::edge_fst() != Node<View>::edge_lst(); }
}}}
// STATISTICS: int-prop