/Users/jamian/qecode-1.1/qecode/qecore.hh

Go to the documentation of this file.

/*****************************************************************[qecore.hh]
Copyright (c) 2007, Universite d'Orleans - Jeremie Vautard, Marco Benedetti,
Arnaud Lallouet.

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.
*****************************************************************************/
#ifndef qecore
#define qecore



#include <cstdlib>
#include <vector>
#include <list>
#include <stack>
#include "extensivecomparator.hh"
#include "heap.cc"
#include "gecode/minimodel.hh"

using namespace Gecode;
using namespace std;
using namespace Gecode::Int;


class BranchingHeuristic;


class QSpace {
protected:
  unsigned int n; 
  unsigned long int ps;
public:

  QSpace(unsigned int nv);


  QSpace(QSpace& qs);

  virtual ~QSpace() {}


  int nv() {return n;}


  IntVarArgs v;


  virtual bool quantification(int v)=0;



  virtual int status(int var, unsigned long int& propsteps)=0;

  virtual int finalStatus(unsigned long int& propsteps)=0;

  virtual bool subsumed(int var)=0;


  virtual QSpace* clone()=0; 


  virtual void assign(int var,int** vals,int nbVals)=0; // assigne la valeur val a la variable d'indice var
  virtual void remove(int var,int** vals,int nbVals)=0; // poste var != val  

  virtual void backtrack()=0;       


  virtual void indicateBranchingHeuristic(BranchingHeuristic* bh)=0;
  
  virtual void print()=0;
};



class ScoreAttribuer {
public:

  virtual int score(QSpace* qs,int var)=0;
};


typedef Heap<ExtensiveComparator> cheap;
typedef stack<int> stackint;



class BranchingHeuristic {
private : 
  int size;
  int blocks;
  int* bloc; 
  stackint treated;
  cheap* heaps;
  stackint touched;
  int* score;
  int curHeap;
  ScoreAttribuer* eval;

public : 
      void updateVar(int pos, QSpace* qs);

  BranchingHeuristic(QSpace* qs, ScoreAttribuer* ev);

  int nextVar(QSpace* qs);


  void backtrack(QSpace* qs);



  void vartouched(int pos,QSpace* qs);
};




#endif

---