edge.hpp /usr/include/gecode/int/view-val-graph.hh /usr/include/gecode/int/nvalues/int-base.hpp /usr/include/gecode/int/gcc/post.hpp /usr/include/gecode/int/distinct.hh /usr/include/gecode/int/nvalues/int-gq.hpp /usr/include/gecode/int/nvalues/int-lq.hpp /usr/include/gecode/int/channel.hh /usr/include/gecode/int/nvalues.hh /usr/include/gecode/int/view-val-graph.hh /usr/include/gecode/int/sorted/propagate.hpp /usr/include/gecode/int/view-val-graph/edge.hpp /usr/include/gecode/int/gcc.hh /usr/include/gecode/int/sorted.hh /usr/include/gecode/int/nvalues/int-eq.hpp /usr/include/gecode/int/circuit.hh Gecode Gecode::Int Gecode::Int::ViewValGraph /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2003 * *Lastmodified: *$Date:2011-08-1720:37:38+0200(Wed,17Aug2011)$by$Author:schulte$ *$Revision:12299$ * *ThisfileispartofGecode,thegenericconstraint *developmentenvironment: *http://www.gecode.org * *Permissionisherebygranted,freeofcharge,toanypersonobtaining *acopyofthissoftwareandassociateddocumentationfiles(the *"Software"),todealintheSoftwarewithoutrestriction,including *withoutlimitationtherightstouse,copy,modify,merge,publish, *distribute,sublicense,and/orsellcopiesoftheSoftware,andto *permitpersonstowhomtheSoftwareisfurnishedtodoso,subjectto *thefollowingconditions: * *Theabovecopyrightnoticeandthispermissionnoticeshallbe *includedinallcopiesorsubstantialportionsoftheSoftware. * *THESOFTWAREISPROVIDED"ASIS",WITHOUTWARRANTYOFANYKIND, *EXPRESSORIMPLIED,INCLUDINGBUTNOTLIMITEDTOTHEWARRANTIESOF *MERCHANTABILITY,FITNESSFORAPARTICULARPURPOSEAND *NONINFRINGEMENT.INNOEVENTSHALLTHEAUTHORSORCOPYRIGHTHOLDERSBE *LIABLEFORANYCLAIM,DAMAGESOROTHERLIABILITY,WHETHERINANACTION *OFCONTRACT,TORTOROTHERWISE,ARISINGFROM,OUTOFORINCONNECTION *WITHTHESOFTWAREORTHEUSEOROTHERDEALINGSINTHESOFTWARE. * */ namespaceGecode{namespaceInt{namespaceViewValGraph{ template<classView> forceinline Edge<View>::Edge(ValNode<View>*s,ViewNode<View>*d) :sd(s,d){ s->add(this); } template<classView> forceinline Edge<View>::Edge(ValNode<View>*s,ViewNode<View>*d,Edge<View>*n) :_next_edge(n),sd(s,d){ s->add(this); } template<classView> forceinlineNode<View>* Edge<View>::dst(Node<View>*s)const{ returnsd.ptr(s); } template<classView> forceinlinevoid Edge<View>::revert(Node<View>*d){ unlink(); d->add(this); } template<classView> forceinlineViewNode<View>* Edge<View>::view(ValNode<View>*n)const{ returnstatic_cast<ViewNode<View>*>(sd.ptr(n)); } template<classView> forceinlineValNode<View>* Edge<View>::val(ViewNode<View>*x)const{ returnstatic_cast<ValNode<View>*>(sd.ptr(x)); } template<classView> forceinlinebool Edge<View>::used(Node<View>*v)const{ returnsd.is_set()||(v->comp==sd.ptr(v)->comp); } template<classView> forceinlinevoid Edge<View>::use(void){ sd.set(); } template<classView> forceinlinevoid Edge<View>::free(void){ sd.unset(); } template<classView> forceinlineEdge<View>* Edge<View>::next_edge(void)const{ return_next_edge; } template<classView> forceinlineEdge<View>** Edge<View>::next_edge_ref(void){ return&_next_edge; } template<classView> forceinlineEdge<View>* Edge<View>::next(void)const{ returnstatic_cast<Edge<View>*>(BiLink::next()); } template<classView> forceinlinevoid Edge<View>::operatordelete(void*,size_t){} template<classView> forceinlinevoid Edge<View>::operatordelete(void*,Space&){} template<classView> forceinlinevoid* Edge<View>::operatornew(size_ts,Space&home){ returnhome.ralloc(s); } }}} //STATISTICS:int-prop