iter-prune-val.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/iter-prune-val.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,2011 * *Lastmodified: *$Date:2011-09-0814:34:40+0200(Thu,08Sep2011)$by$Author:schulte$ *$Revision:12395$ * *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 IterPruneVal<View>::IterPruneVal(ViewNode<View>*y) :x(y),e(y->val_edges()){ while((e!=NULL)&&e->used(x)) e=e->next_edge(); } template<classView> forceinlinebool IterPruneVal<View>::operator ()(void)const{ returne!=NULL; } template<classView> forceinlinevoid IterPruneVal<View>::operator ++(void){ assert(!e->used(x)); do{ e=e->next_edge(); }while((e!=NULL)&&e->used(x)); } template<classView> forceinlineint IterPruneVal<View>::val(void)const{ assert(!e->used(x)); returne->val(x)->val(); } }}} //STATISTICS:int-prop