gecoder-with-gecode 0.7.1 → 0.8.0

data/ext/gecode-1.3.1/contribs/graph/Makefile.in.in

@@ -1,169 +0,0 @@
-# Author Gr�goire Dooms
-# Copied from Gecode Makefile.in
-# The gecode configure script makes the Makefile.in from this Makefile.in.in
-# Then the cp(Graph) configure script makes the Makefile from the Makefile.in
-
-# get variables from top Makefile
-#
-gecode_top_srcdir = $(top_srcdir)
-cpgraph_top_srcdir = $(curdir)
-
-RMF = rm -f
-
-KERNELDLL := $(KERNELDLL:%=../../%)
-SETDLL := $(SETDLL:%=../../%)
-INTDLL := $(INTDLL:%=../../%)
-SUPPORTOBJ := $(SUPPORTOBJ:%=../../%)
-
-ifeq "$(LIBPREFIX)" "$(LINKPREFIX)"
-LINKSET:=../../$(LINKSET)
-LINKKERNEL:=../../$(LINKKERNEL)
-LINKINT:=../../$(LINKINT)
-LINKMM:=../../$(LINKMM)
-LINKSEARCH:=../../$(LINKSEARCH)
-LINKALL := $(LINKMM) $(LINKSET) $(LINKINT) $(LINKSEARCH) $(LINKKERNEL)
-else
-EXTRALINKFLAGS := -L../..
-endif
-
-#
-# GRAPH COMPONENTS
-#
-
-GRAPHSRC0 = view/arcnode.cc 
-GRAPHHDR0 = view/outadjsets.icc view/constant.icc view/arcnode.hh view/nodearcsets.icc graphutils.icc  var.icc view.icc graphutils.h view/boundsgraphs.icc view/prop.icc path/path.icc path/pathgraphs.icc path.hh path.icc
-#GRAPHHDR0 = @GRAPHHDR@
-
-
-GRAPHSRC		= $(GRAPHSRC0)
-GRAPHHDR		= graph.hh $(GRAPHHDR0)
-GRAPHOBJ		= $(GRAPHSRC:%.cc=%$(OBJSUFFIX))
-GRAPHFLAGS      = -I@BOOST_DIR@ -I../.. -I../../gecode $(EXTRALINKFLAGS)
-GRAPHDLL		= $(LIBPREFIX)@GRAPH@$(DLLSUFFIX)
-GRAPHSTATICLIB	= $(LIBPREFIX)@GRAPH@$(STATICLIBSUFFIX)
-GRAPHLIB		= $(LIBPREFIX)@GRAPH@$(LIBSUFFIX)
-LINKGRAPH      	= $(LINKPREFIX)@GRAPH@$(LINKSUFFIX)
-#GRAPHBUILDDIRS	= view
-
-ifeq "$(LIBPREFIX)" "$(LINKPREFIX)"
-LINKGRAPH := $(LINKGRAPH)
-else
-EXTRALINKFLAGS := -L../..
-endif
-
-LINKALL := $(LINKALL) $(LINKGRAPH)
-
-#
-# GRAPH EXAMPLES
-#
-
-GRAPHEXAMPLESRC0 = cpgraph-basic cpgraph-path cpgraph-complement cpgraph-path2 cpgraph-instUB cpgraph-pathcost
-GRAPHEXAMPLESRC  = $(GRAPHEXAMPLESRC0:%=examples/%.cc)
-GRAPHEXAMPLEOBJ  = $(GRAPHEXAMPLESRC:%.cc=%$(OBJSUFFIX))
-GRAPHEXAMPLESBJ  = $(GRAPHEXAMPLESRC:%.cc=%$(SBJSUFFIX))
-GRAPHEXAMPLEEXE  = $(GRAPHEXAMPLESRC:%.cc=%$(EXESUFFIX))
-GRAPHEXAMPLEBUILDDIRS = examples/
-
-GRAPHEXAMPLEHDR0 = $(gecode_top_srcdir)/support.hh $(gecode_top_srcdir)/support.icc $(gecode_top_srcdir)/timer.hh
-GRAPHEXAMPLEHDR  = $(GRAPHEXAMPLEHDR0:%=../../examples/%) $(GRAPHHDR)
-
-ALLLIB :=  $(ALLLIB) $(GRAPHLIB) 
-
-
-LIBTARGETS = $(GRAPHDLL) $(GRAPHLIB)
-
-all : $(LIBTARGETS) $(GRAPHEXAMPLEEXE)
-
-#
-# Object targets
-#
-
-
-examples/%$(OBJSUFFIX): examples/%.cc
-	$(CXX) $(CXXFLAGS) $(EXAMPLES_EXTRA_CXXFLAGS) $(GRAPHFLAGS) \
-	@COMPILEOBJ@$@ @COMPILERIN@ $<
-examples/%$(SBJSUFFIX): examples/%.cc
-	$(CXX) $(CXXFLAGS) $(EXAMPLES_EXTRA_CXXFLAGS) $(GRAPHFLAGS) \
-	@COMPILESBJ@$@ @COMPILERIN@ $<
-
-%$(OBJSUFFIX): %.cc
-	$(CXX) $(CXXFLAGS) -DGECODE_BUILD_GRAPH $(GRAPHFLAGS) \
-	@COMPILEOBJ@$@ @COMPILERIN@ $<
-%$(SBJSUFFIX): %.cc
-	$(CXX) $(CXXFLAGS) -DGECODE_BUILD_GRAPH  $(GRAPHFLAGS) \
-	@COMPILESBJ@$@ @COMPILERIN@ $<
-
-#
-# DLL Targets
-#
-
-ifeq "$(DLLSUFFIX)" "$(LIBSUFFIX)" 
-#linux 
-$(GRAPHDLL): $(GRAPHOBJ) $(KERNELDLL) $(INTDLL) $(SETDLL)
-	$(CXX) $(DLLFLAGS) $(GRAPHOBJ)  $(GRAPHFLAGS) \
-		@DLLPATH@ $(LINKKERNEL) $(LINKINT) \
-		@LINKOUTPUT@$(GRAPHDLL) &&\
-	$(CREATELINK) $@ $(@:%$(DLLSUFFIX)=%$(SOLINKSUFFIX)) && \
-	$(CREATELINK) $@ $(@:%$(DLLSUFFIX)=%$(SOSUFFIX))
-else
-#win
-$(GRAPHDLL) $(GRAPHLIB): $(GRAPHOBJ) $(KERNELDLL) $(INTDLL) $(SETDLL)
-	$(CXX) $(DLLFLAGS) $(GRAPHOBJ)  $(GRAPHFLAGS) \
-		@DLLPATH@ $(LINKKERNEL) $(LINKINT) $(LINKSET) \
-		@LINKOUTPUT@$(GRAPHDLL)
-endif
-
-# 
-# EXE targets
-#
-#
-
-
-.PRECIOUS: examples/%$(OBJSUFFIX)
-examples/%$(EXESUFFIX): examples/%$(OBJSUFFIX) $(SUPPORTOBJ) $(ALLIB)
-	$(CXX) -o $@ $< $(SUPPORTOBJ) $(DLLPATH) $(CXXFLAGS) $(GRAPHFLAGS) \
-	$(LDFLAGS) $(LINKALL)
-CXXFLAGS := $(CXXFLAGS) $(GRAPHFLAGS) 
-
-	
-.PHONY: doc
-doc: $(GRAPHHDR) $(GRAPHSRC) 
-	mkdir -p doc/html
-	doxygen doxygen.conf
-
-#
-# Autoconf
-#
-
-configure: configure.ac 
-	autoconf
-config.status: configure
-	../../config.status --recheck
-	./config.status --recheck
-Makefile: Makefile.in config.status
-	./config.status
-Makefile.in : Makefile.in.in ../../config.status
-	../../config.status --file $@:$<
-
-
-.PHONY: clean veryclean distclean
-localclean:
-	find  examples -perm +u+x -not -type d -exec rm '{}' ';'
-	rm libgecodegraph.so
-
-clean:
-	$(RMF) $(GRAPHOBJ) $(GRAPHSBJ)
-
-veryclean: clean
-	$(RMF) $(LIBTARGETS)
-	$(RMF) $(LIBTARGETS:%$(DLLSUFFIX)=%.exp) $(LIBTARGETS:%$(DLLSUFFIX)=%.lib)
-	$(RMF) $(LIBTARGETS:%$(DLLSUFFIX)=%.ilk) $(LIBTARGETS:%$(DLLSUFFIX)=%.pdb)
-	$(RMF) $(GRAPHEXAMPLEEXE:%$(EXESUFFIX)=%.pdb)
-	$(RMF) $(GRAPHEXAMPLEEXE:%$(EXESUFFIX)=%$(OBJSUFFIX))
-	$(RMF) $(GRAPHEXAMPLEEXE:%$(EXESUFFIX)=%$(SBJSUFFIX))
-	$(RMF) doc CPGraphReference.chm 
-	$(RMF) $(GRAPHEXAMPLEEXE)
-	$(RMF) $(GRAPHDLL)
-
-distclean: veryclean
-	$(RMF) config.log config.status Makefile.in

data/ext/gecode-1.3.1/contribs/graph/TODO

@@ -1,28 +0,0 @@
- TEsts TEsts and more tests 
-
-make depend 
-make install
-
-Web: cronjob pour g�n�rer la  doc et la page
-fix Makefile to be able to either link the doc  to local or remote doc
-
---
-
-Var: 2�
-    make a simple graph var
-
-
-Template nodearcGraphView with the arcnode parameter 
-    Design a simple Tail*MumNodes+Head ArcNode (must know numNodes)
-
-Path:
-    remove weakly connected checking
-    use smart pointer for the costs
-    condensation des morceaux de chemin/retrait des loops == partie des degr�s + Nocycle
-
-
-ArcSetView<GView>
-
-Gecode:
-automativcally enable tagfile=yes if contribs are done and doc is enabled
-int minimodel = q[0](intvar) = 3 should work

data/ext/gecode-1.3.1/contribs/graph/binarysimple.hh

@@ -1,82 +0,0 @@
-
-/*
- *  Main authors:
- *     Gr�goire Dooms <dooms@info.ucl.ac.be>
- *
- *  Copyright:
- *     Gr�goire Dooms (Universit� catholique de Louvain), 2005
- *
- *  Last modified:
- *     $Date: 2005-11-29 10:57:21 +0100 (Tue, 29 Nov 2005) $
- *     $Revision: 271 $
- *
- *  This file is part of CP(Graph)
- *
- *  See the file "contribs/graph/LICENSE" for information on usage and
- *  redistribution of this file, and for a
- *     DISCLAIMER OF ALL WARRANTIES.
- *
- */
-
-#ifndef BINARYSIMPLE_HH
-#define BINARYSIMPLE_HH
-#include "kernel.hh"
-//using namespace Gecode;
-namespace Gecode { namespace Graph {
-
-
-/** \brief Base class for binary propagators */
-template <class GDV1, PropCond p1, class GDV2, PropCond p2>
-class BinaryGraphPropagator: public Propagator {
-        protected:
-                GDV1 g1;
-                GDV2 g2;
-                /// Constructor for cloning
-                BinaryGraphPropagator(Space* home,  bool share, BinaryGraphPropagator& p);
-        public :
-                /// Destructor for cancelling 
-                virtual ~BinaryGraphPropagator(void);
-                /// Constructor for posting
-                BinaryGraphPropagator(Space* home, GDV1 &g1, GDV2 &g2);
-                /// Tells the estimated cost of propgation
-                virtual PropCost cost(void) const;
-                /// Post the binary propagator
-                static ExecStatus post(Space* home, GDV1 &g1, GDV2 &g2);
-};
-
-/** \brief Propagator for the complement graph binary constraint.
- *
- * A graph is the complement of an other if their adj matrices sum to all ones
- */
-template <class GDV1, class GDV2>
-struct ComplementPropag: public BinaryGraphPropagator<GDV1, Gecode::Graph::PC_GRAPH_ANY, GDV2, Gecode::Graph::PC_GRAPH_ANY> {
-        using BinaryGraphPropagator<GDV1, Gecode::Graph::PC_GRAPH_ANY, GDV2, Gecode::Graph::PC_GRAPH_ANY>::g1;
-        using BinaryGraphPropagator<GDV1, Gecode::Graph::PC_GRAPH_ANY, GDV2, Gecode::Graph::PC_GRAPH_ANY>::g2;
-        using BinaryGraphPropagator<GDV1, Gecode::Graph::PC_GRAPH_ANY, GDV2, Gecode::Graph::PC_GRAPH_ANY>::cost;
-        protected:
-                /// Constructor for cloning
-                ComplementPropag(Space*, bool share, ComplementPropag&);
-        public:
-                /// Destructor for cancelling 
-                virtual ~ComplementPropag(void);
-                /// Constructor for posting
-                ComplementPropag(Space*,GDV1&,GDV2&);
-                /// Perform the filtering steps of the constraint
-                virtual ExecStatus  propagate(Space*);
-                /// Post the constraint \a g1 = Complement(\a g2)
-                static  ExecStatus  post(Space*,GDV1& g1,GDV2& g2);
-                /// Copy propagator to new Space
-                virtual Actor*  copy(Space* home,bool share) ;
-};
-
-
-/** posts a constraint for g1 is the complement of g2 
- * \ingroup TaskModel
- */
-template <class GDV1, class GDV2>
-void complement(Space * home, GDV1 &g1, GDV2 &g2);
-
-
-} } 
-#include "binarysimple.icc"
-#endif

data/ext/gecode-1.3.1/contribs/graph/binarysimple.icc

@@ -1,186 +0,0 @@
-
-/*
- *  Main authors:
- *     Gr�goire Dooms <dooms@info.ucl.ac.be>
- *
- *  Copyright:
- *     Gr�goire Dooms (Universit� catholique de Louvain), 2005
- *
- *  Last modified:
- *     $Date: 2005-11-29 10:57:21 +0100 (Tue, 29 Nov 2005) $
- *     $Revision: 271 $
- *
- *  This file is part of CP(Graph)
- *
- *  See the file "contribs/graph/LICENSE" for information on usage and
- *  redistribution of this file, and for a
- *     DISCLAIMER OF ALL WARRANTIES.
- *
- */
-
-#include "graph.hh"
-#include "stlutility.icc"
-#include "set/rel.hh"
-#include "set.hh" 
-#include <list>
-#include <boost/utility.hpp>
-#undef TRACE 
-//#define TRACE(A) A
-#define TRACE(A)
-//using namespace boost;
-//using namespace std;
-namespace Gecode { namespace Graph {
-
-template <class GDV1, PropCond p1, class GDV2, PropCond p2>
-forceinline
-BinaryGraphPropagator<GDV1, p1, GDV2, p2>::~BinaryGraphPropagator(void) {
-        g1.cancel(this, p1); 
-        g2.cancel(this, p2); 
-}
-
-template <class GDV1, PropCond p1, class GDV2, PropCond p2>
-forceinline
-BinaryGraphPropagator<GDV1, p1, GDV2, p2>::BinaryGraphPropagator(Space* home, bool share, BinaryGraphPropagator<GDV1, p1, GDV2, p2> &p): 
-Propagator(home,share,p) {
-        g1.update(home, share, p.g1);
-        g2.update(home, share, p.g2);
-}
-
-template <class GDV1, PropCond p1, class GDV2, PropCond p2>
-forceinline
-BinaryGraphPropagator<GDV1, p1, GDV2, p2>::BinaryGraphPropagator(Space* home, GDV1 &g1, GDV2 &g2): Propagator(home), g1(g1), g2(g2) {
-        g1.subscribe(home, this, p1);
-        g2.subscribe(home, this, p2); 
-}
-
-template <class GDV1, PropCond p1, class GDV2, PropCond p2>
-PropCost    BinaryGraphPropagator<GDV1, p1, GDV2, p2>::cost(void) const {
-        return PC_QUADRATIC_LO;
-}
-
-
-
-/*
- *
- *  Complement Graph Propagator 
- *
- *
- */
-
-
-
-template <class GDV1, class GDV2>
-void complement (Space * home, GDV1 &g1, GDV2 &g2){
-        if (home->failed()) return;
-        GECODE_ES_FAIL(home,(Set::Rel::Eq<NodeSetView<GDV1>, NodeSetView<GDV2> >::post(home, g1,g2)));
-        GECODE_ES_FAIL(home, (ComplementPropag<GDV1,GDV2>::post(home, g1, g2)));
-}
-
-template <class GDV1, class GDV2>
-ExecStatus ComplementPropag<GDV1, GDV2>::post(Space* home, GDV1 &g1, GDV2 &g2) {
-        (void) new (home) ComplementPropag(home, g1, g2);
-        return ES_OK;
-}
-
-
-template <class GDV1, class GDV2>
-ComplementPropag<GDV1, GDV2>::~ComplementPropag(void) {}
-
-template <class GDV1, class GDV2>
-        forceinline
-ComplementPropag<GDV1, GDV2>::ComplementPropag(Space* home, bool share, ComplementPropag &p)
-        : BinaryGraphPropagator<GDV1, Gecode::Graph::PC_GRAPH_ANY, GDV2, Gecode::Graph::PC_GRAPH_ANY>(home,share, p) { 
-        }
-
-template <class GDV1, class GDV2>
-        forceinline
-ComplementPropag<GDV1, GDV2>::ComplementPropag(Space* home, GDV1 &g1, GDV2 &g2)
-        : BinaryGraphPropagator<GDV1, Gecode::Graph::PC_GRAPH_ANY, GDV2, Gecode::Graph::PC_GRAPH_ANY>(home,g1,g2) {
-        }
-
-template <class GDV1, class GDV2>
-Actor*      ComplementPropag<GDV1, GDV2>::copy(Space* home,bool share) {
-        return new (home) ComplementPropag(home,share,*this);
-}
-
-
-
-
-/** \brief Visitor used by the complement propagator with scanTwoGraphsCompleteNodeArcs*/
-struct ComplVisit{
-        bool fail; ///< tells if the constraint must fail
-        bool assigned; ///< tells if the variables are assigned
-        list<pair<int,int> > incG1;///< stores arcs which must be included in G1
-        list<pair<int,int> > remG1;///< stores arcs which must be removed from G1
-        list<pair<int,int> > incG2;///< stores arcs which must be included in G2
-        list<pair<int,int> > remG2;///< stores arcs which must be removed from G2
-        ComplVisit():fail(false),assigned(true){}
-
-        /// called for an arc absent from both domains
-        void NoneNone(int t,int h){fail = true;                      TRACE(cout << t << " " << h << " NoneNone" << endl); }
-        /// called for an arc absent from g1 but in lub(g2)
-        void NoneLub(int t,int h) {incG2.push_back(make_pair(t,h));  TRACE(cout << t << " " << h << " NoneLub " << endl); }
-        /// called for an arc absent from g1 but in glb(g2)
-        void NoneGlb(int t,int h) {                                  TRACE(cout << t << " " << h << " NoneGlb " << endl); }
-        /// called for an arc in lub(g1) but absent from g2
-        void LubNone(int t,int h) {incG1.push_back(make_pair(t,h));  TRACE(cout << t << " " << h << " LubNone " << endl); }
-        /// called for an arc in both lubs 
-        void LubLub(int t,int h)  {assigned=false;                   TRACE(cout << t << " " << h << " LubLub  " << endl); }
-        /// called for an arc in lub(g1) and glb(g2)
-        void LubGlb(int t,int h)  {remG1.push_back(make_pair(t,h));  TRACE(cout << t << " " << h << " LubGlb  " << endl); }
-        /// called for an arc in glb(g1) and not in g2
-        void GlbNone(int t,int h) {                                  TRACE(cout << t << " " << h << " GlbNone " << endl); }
-        /// called for an arc in glb(g1) and in lub(g2)
-        void GlbLub(int t,int h)  {remG2.push_back(make_pair(t,h));  TRACE(cout << t << " " << h << " GlbLub  " << endl); }
-        /// called for an arc in both glb
-        void GlbGlb(int t,int h)  {fail = true;                      TRACE(cout << t << " " << h << " GlbGlb  " << endl); }
-};
-
-
-
-//using namespace Gecode::Set;
-/// \brief performs the propagation
-template <class GDV1, class GDV2>
-ExecStatus ComplementPropag<GDV1, GDV2>::propagate(Space* home) {
-        /* Scan  the arcs  in the complete graph build over nodes in the glb of both nodes(g1)=nodes(g2)
-           if an arc is in one of the lower bounds, remove from others upperbound
-           if it is not in one of the upperbounds add it to others lower bound 
-
-           */
-        ComplVisit visit;
-        //TRACE(cout << static_cast<GDV1>(g1) << endl); // no longer compiles since namespace cleanup
-        //TRACE(cout << g2 << endl);  // no longer compiles since namespace cleanup
-        typename GDV1::GlbNodeRangesIterator nR1 = g1.iter_nodes_ranges_LB();
-        typename GDV1::GlbNodeRangesIterator nR2 = g2.iter_nodes_ranges_LB();
-        typedef Iter::Ranges::Union<typename GDV1::GlbNodeRangesIterator,typename GDV1::GlbNodeRangesIterator> NR;
-        typedef Iter::Ranges::ToValues<NR> NVals;
-        NR ranges(nR1,nR2);
-        NVals values(ranges);
-        scanTwoGraphsCompleteNodeArcs<GDV1,GDV2,NVals,ComplVisit>(g1,g2,values,visit);
-        
-        if (visit.fail) { TRACE(cout << "fail " << endl); return ES_FAILED; }
-
-
-        typedef StlToGecodeValIterator<list<pair<int,int> >::iterator> ItVal;
-        ItVal remG1(visit.remG1.begin(),visit.remG1.end());
-        TRACE(cout << visit.remG1 << endl);
-        GECODE_ME_CHECK(g1._arcsOut(home,remG1));
-        ItVal remG2(visit.remG2.begin(),visit.remG2.end());
-        TRACE(cout << visit.remG2 << endl);
-        GECODE_ME_CHECK(g2._arcsOut(home,remG2));
-        ItVal incG1(visit.incG1.begin(),visit.incG1.end());
-        TRACE(cout << visit.incG1 << endl);
-        GECODE_ME_CHECK(g1._arcsIn(home,incG1));
-        TRACE(cout << visit.incG2 << endl);
-        ItVal incG2(visit.incG2.begin(),visit.incG2.end());
-        GECODE_ME_CHECK(g2._arcsIn(home,incG2));
-        if (visit.assigned && g1.nodeAssigned() && g2.nodeAssigned()){
-               TRACE(cout << "assigned" <<endl); 
-               return ES_SUBSUMED;
-        }
-        return ES_FIX;
-}
-                
-         
-} } 
-