edge.icc
Go to the documentation of this file.00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ 00002 /* 00003 * Main authors: 00004 * Christian Schulte <schulte@gecode.org> 00005 * 00006 * Copyright: 00007 * Christian Schulte, 2003 00008 * 00009 * Last modified: 00010 * $Date: 2007-08-09 15:30:21 +0200 (Thu, 09 Aug 2007) $ by $Author: tack $ 00011 * $Revision: 4790 $ 00012 * 00013 * This file is part of Gecode, the generic constraint 00014 * development environment: 00015 * http://www.gecode.org 00016 * 00017 * Permission is hereby granted, free of charge, to any person obtaining 00018 * a copy of this software and associated documentation files (the 00019 * "Software"), to deal in the Software without restriction, including 00020 * without limitation the rights to use, copy, modify, merge, publish, 00021 * distribute, sublicense, and/or sell copies of the Software, and to 00022 * permit persons to whom the Software is furnished to do so, subject to 00023 * the following conditions: 00024 * 00025 * The above copyright notice and this permission notice shall be 00026 * included in all copies or substantial portions of the Software. 00027 * 00028 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 00029 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 00030 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 00031 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 00032 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 00033 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 00034 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 00035 * 00036 */ 00037 00038 namespace Gecode { namespace Int { namespace Distinct { 00039 00040 template <class View> 00041 forceinline 00042 Edge<View>::Edge(ValNode<View>* s, ViewNode<View>* d) 00043 : sd(s,d) { 00044 s->add(this); 00045 } 00046 00047 template <class View> 00048 forceinline Node<View>* 00049 Edge<View>::dst(Node<View>* s) const { 00050 return sd.ptr(s); 00051 } 00052 00053 template <class View> 00054 forceinline void 00055 Edge<View>::revert(Node<View>* d) { 00056 unlink(); 00057 d->add(this); 00058 } 00059 00060 template <class View> 00061 forceinline ViewNode<View>* 00062 Edge<View>::view(ValNode<View>* n) const { 00063 return static_cast<ViewNode<View>*>(sd.ptr(n)); 00064 } 00065 template <class View> 00066 forceinline ValNode<View>* 00067 Edge<View>::val(ViewNode<View>* x) const { 00068 return static_cast<ValNode<View>*>(sd.ptr(x)); 00069 } 00070 00071 template <class View> 00072 forceinline bool 00073 Edge<View>::used(Node<View>* v) const { 00074 return sd.is_set() || (v->comp == sd.ptr(v)->comp); 00075 } 00076 template <class View> 00077 forceinline void 00078 Edge<View>::use(void) { 00079 sd.set(); 00080 } 00081 template <class View> 00082 forceinline void 00083 Edge<View>::free(void) { 00084 sd.unset(); 00085 } 00086 00087 template <class View> 00088 forceinline Edge<View>* 00089 Edge<View>::next_edge(void) const { 00090 return _next_edge; 00091 } 00092 template <class View> 00093 forceinline Edge<View>** 00094 Edge<View>::next_edge_ref(void) { 00095 return &_next_edge; 00096 } 00097 template <class View> 00098 forceinline Edge<View>* 00099 Edge<View>::next(void) const { 00100 return static_cast<Edge<View>*>(BiLink::next()); 00101 } 00102 00103 template <class View> 00104 forceinline void 00105 Edge<View>::operator delete(void*, size_t) {} 00106 template <class View> 00107 forceinline void 00108 Edge<View>::operator delete(void*,Space*) {} 00109 template <class View> 00110 forceinline void* 00111 Edge<View>::operator new(size_t s, Space* home) { 00112 return home->alloc(s); 00113 } 00114 00115 }}} 00116 00117 // STATISTICS: int-prop 00118