int.hh

Go to the documentation of this file.

/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
 *  Main authors:
 *     Christian Schulte <schulte@gecode.dev>
 *     Mikael Zayenz Lagerkvist <lagerkvist@gecode.dev>
 *
 *  Copyright:
 *     Christian Schulte, 2005
 *     Mikael Zayenz Lagerkvist, 2006
 *
 *  This file is part of Gecode, the generic constraint
 *  development environment:
 *     http://www.gecode.dev
 *
 *  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 GECODE_TEST_INT_HH
#define GECODE_TEST_INT_HH
 
#include "test/test.hh"
 
#include <gecode/int.hh>
 
namespace Test {

  namespace Int {



    class Assignment {
    protected:
      int n;            
      Gecode::IntSet d; 
    public:
      Assignment(int n0, const Gecode::IntSet& d0);
      virtual bool has_more(void) const = 0;
      virtual void next(Gecode::Support::RandomGenerator& rand) = 0;
      virtual int operator[](int i) const = 0;
      int size(void) const;
      virtual ~Assignment(void);
    };

    class CpltAssignment : public Assignment {
    protected:
      Gecode::IntSetValues* dsv; 
    public:
      CpltAssignment(int n, const Gecode::IntSet& d);
      virtual bool has_more(void) const;
      virtual void next(Gecode::Support::RandomGenerator& rand);
      virtual int operator[](int i) const;
      virtual ~CpltAssignment(void);
    };

    class RandomAssignment : public Assignment {
    protected:
      int* vals; 
      int  a;    
      int randval(Gecode::Support::RandomGenerator& rand);
    public:
      RandomAssignment(int n, const Gecode::IntSet& d, int a0, Gecode::Support::RandomGenerator& rand);
      virtual bool has_more(void) const;
      virtual void next(Gecode::Support::RandomGenerator& rand);
      virtual int operator[](int i) const;
      virtual ~RandomAssignment(void);
    };

    class RandomMixAssignment : public Assignment {
    protected:
      int* vals; 
      int  a;    
      int _n1;   
      Gecode::IntSet _d1; 
      int randval(const Gecode::IntSet& d, Gecode::Support::RandomGenerator& rand);
    public:
      RandomMixAssignment(int n0, const Gecode::IntSet& d0, int n1, const Gecode::IntSet& d1, int a0,
                          Gecode::Support::RandomGenerator& rand);
      virtual bool has_more(void) const;
      virtual void next(Gecode::Support::RandomGenerator& rand);
      virtual int operator[](int i) const;
      virtual ~RandomMixAssignment(void);
    };

    enum ConTestLevel {
      CTL_NONE,     
      CTL_DOMAIN,   
      CTL_BOUNDS_D, 
      CTL_BOUNDS_Z, 
    };
 
    class Test;

    class TestSpace : public Gecode::Space {
    public:
      Gecode::IntSet d;
      Gecode::IntVarArray x;
      Gecode::Reify r;
      Test* test;
      bool reified;

      TestSpace(int n, Gecode::IntSet& d, Test* t);
      TestSpace(int n, Gecode::IntSet& d, Test* t, Gecode::ReifyMode rm);
      TestSpace(TestSpace& s);
      virtual Gecode::Space* copy(void);
      bool assigned(void) const;
      void post(void);
      bool failed(void);
      int rndvar(Gecode::Support::RandomGenerator& rand);
      void rndrel(const Assignment& a, int i, Gecode::IntRelType& irt, int& v, Gecode::Support::RandomGenerator& rand);
      void rel(int i, Gecode::IntRelType irt, int n);
      void rel(bool sol);
      void assign(const Assignment& a, bool skip, Gecode::Support::RandomGenerator& rand);
      void bound(Gecode::Support::RandomGenerator& rand);
      void prune(int i, bool bounds_only, Gecode::Support::RandomGenerator& rand);
      void prune(Gecode::Support::RandomGenerator& rand);
      bool prune(const Assignment& a, bool testfix, Gecode::Support::RandomGenerator& rand);
      void disable(void);
      void enable(void);
      bool disabled(const Assignment& a, TestSpace& c, bool testfix, Gecode::Support::RandomGenerator& rand);
      unsigned int propagators(void);
    };

    class Test : public Base {
    protected:
      int arity;
      Gecode::IntSet dom;
      bool reified;
      int rms;
      Gecode::IntPropLevel ipl;
      ConTestLevel contest;
      bool testsearch;
      bool testfix;


      bool eqv(void) const;
      bool imp(void) const;
      bool pmi(void) const;
    public:
      Test(const std::string& p, const std::string& s,
           int a, const Gecode::IntSet& d, bool r=false,
           Gecode::IntPropLevel i=Gecode::IPL_DEF);
      Test(const std::string& s,
           int a, const Gecode::IntSet& d, bool r=false,
           Gecode::IntPropLevel i=Gecode::IPL_DEF);
      Test(const std::string& p, const std::string& s,
           int a, int min, int max, bool r=false,
           Gecode::IntPropLevel i=Gecode::IPL_DEF);
      Test(const std::string& s,
           int a, int min, int max, bool r=false,
           Gecode::IntPropLevel i=Gecode::IPL_DEF);
      virtual Assignment* assignment(void) const;
      virtual bool solution(const Assignment&) const = 0;
      virtual bool ignore(const Assignment&) const;
      virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) = 0;
      virtual void post(Gecode::Space& home, Gecode::IntVarArray& x,
                        Gecode::Reify r);
      virtual bool run(void);


      static std::string str(bool b);
      static std::string str(int i);
      static std::string str(const Gecode::IntArgs& i);
      static std::string str(Gecode::IntPropLevel ipl);
      static std::string str(Gecode::IntRelType irl);
      static std::string str(Gecode::BoolOpType bot);


      template<class T> static bool cmp(T x, Gecode::IntRelType r, T y);
    };


    class IntPropLevels {
    private:
      static const Gecode::IntPropLevel ipls[3];
      int i;
    public:
      IntPropLevels(void);
      bool operator()(void) const;
      void operator++(void);
      Gecode::IntPropLevel ipl(void) const;
    };

    class IntPropBasicAdvanced {
    private:
      static const Gecode::IntPropLevel ipls[3];
      int i;
    public:
      IntPropBasicAdvanced(void);
      bool operator()(void) const;
      void operator++(void);
      Gecode::IntPropLevel ipl(void) const;
    };

    class IntRelTypes {
    private:
      static const Gecode::IntRelType irts[6];
      int i;
    public:
      IntRelTypes(void);
      void reset(void);
      bool operator()(void) const;
      void operator++(void);
      Gecode::IntRelType irt(void) const;
    };

    class BoolOpTypes {
    private:
      static const Gecode::BoolOpType bots[5];
      int i;
    public:
      BoolOpTypes(void);
      bool operator()(void) const;
      void operator++(void);
      Gecode::BoolOpType bot(void) const;
    };
 
  }
}

std::ostream& operator<<(std::ostream& os, const Test::Int::Assignment& a);
 
#include "test/int.hpp"
 
#endif
 
// STATISTICS: test-int