extensional.hh

Go to the documentation of this file.

/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
 *  Main authors:
 *     Mikael Lagerkvist <lagerkvist@gecode.org>
 *     Christian Schulte <schulte@gecode.org>
 *
 *  Copyright:
 *     Mikael Lagerkvist, 2007
 *     Christian Schulte, 2004
 *
 *  Last modified:
 *     $Date: 2009-02-04 13:52:42 +0100 (Wed, 04 Feb 2009) $ by $Author: schulte $
 *     $Revision: 8139 $
 *
 *  This file is part of Gecode, the generic constraint
 *  development environment:
 *     http://www.gecode.org
 *
 *  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_INT_EXTENSIONAL_HH__
#define __GECODE_INT_EXTENSIONAL_HH__

#include <gecode/int.hh>

#include <gecode/int/rel.hh>

namespace Gecode { namespace Int { namespace Extensional {

  template <class View, class Degree, class StateIdx>
  class LayeredGraph : public Propagator {
  protected:
    class State {
    public:
      Degree i_deg; 
      Degree o_deg; 
    };
    class Edge {
    public:
      StateIdx i_state; 
      StateIdx o_state; 
      Edge* next; 

      Edge(StateIdx i, StateIdx o, Edge* n);
      static void  operator delete(void* p, size_t s);
      static void  operator delete(void* p, Space& home);
      static void* operator new(size_t s, Space& home);
    };
    class Support {
    public:
      int val; 
      Edge* edges; 
    };
    class Layer {
    public:
      unsigned int size; 
      Support* support; 
    };
    class LayerValues {
    private:
      const Support* s1; 
      const Support* s2; 
    public:
      LayerValues(void);
      LayerValues(const Layer& l);
      void init(const Layer& l);
      bool operator ()(void) const;
      void operator ++(void);
      int val(void) const;
    };
    class Index : public Advisor {
    public:
      StateIdx i;
      Index(Space& home, Propagator& p, Council<Index>& c, StateIdx i);
      Index(Space& home, bool share, Index& a);
    };
    class IndexRange {
    private:
      int _fst; 
      int _lst; 
    public:
      IndexRange(void);
      void reset(void);
      void add(int i);
      int fst(void) const;
      int lst(void) const;
    };
    Council<Index> c;
    ViewArray<View> x;
    DFA dfa;
    StateIdx start;
    Layer* layers;
    State* states;
    IndexRange i_ch;
    IndexRange o_ch;

    bool constructed(void) const;
    void eliminate(void);
    ExecStatus construct(Space& home);
    ExecStatus prune(Space& home);

    LayeredGraph(Space& home, bool share,
                 LayeredGraph<View,Degree,StateIdx>& p);
  public:
    LayeredGraph(Space& home, ViewArray<View>& x, DFA& d);
    virtual Actor* copy(Space& home, bool share);
    virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
    virtual ExecStatus advise(Space& home, Advisor& a, const Delta& d);
    virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
    virtual size_t dispose(Space& home);
    static ExecStatus post(Space& home, ViewArray<View>& x, DFA& d);
  };

  template <class View>
  ExecStatus post_lgp(Space& home, ViewArray<View>& x, DFA dfa);

}}}

#include <gecode/int/extensional/layered-graph.hpp>


#include <gecode/int/extensional/bitset.hpp>

namespace Gecode { namespace Int { namespace Extensional {

  typedef TupleSet::Tuple Tuple;
  typedef BitSet* Domain;

  template <class View, bool subscribe = true>
  class Base : public Propagator {
  protected:
    ViewArray<View> x; 
    TupleSet tupleSet; 
    Tuple** last_data; 

    TupleSet::TupleSetI* ts(void);

    Base(Space& home, bool share, Base<View,subscribe>& p);
    Base(Space& home, ViewArray<View>& x, const TupleSet& t);
    void init_last(Space& home, Tuple** source);
    Tuple last(int i, int n);
    Tuple last_next(int i, int n);
    void init_dom(Space& home, Domain dom);
    bool valid(Tuple t, Domain dom);
    Tuple find_support(Domain dom, int i, int n);
  public:
    virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
    virtual size_t dispose(Space& home);
  };
}}}

#include <gecode/int/extensional/base.hpp>


namespace Gecode { namespace Int { namespace Extensional {

  template <class View, bool shared>
  class Basic : public Base<View> {
  protected:
    using Base<View>::x;
    using Base<View>::tupleSet;
    using Base<View>::ts;
    using Base<View>::last;
    using Base<View>::last_next;
    using Base<View>::init_last;
    using Base<View>::init_dom;
    using Base<View>::find_support;

    Basic(Space& home, bool share, Basic<View,shared>& p);
    Basic(Space& home, ViewArray<View>& x, const TupleSet& t);

  public:
    virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
    virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
    virtual Actor* copy(Space& home, bool share);
    static ExecStatus post(Space& home, ViewArray<View>& x, const TupleSet& t);
  };

}}}

#include <gecode/int/extensional/basic.hpp>


namespace Gecode { namespace Int { namespace Extensional {
  template <class View>
  class Incremental : public Base<View, false> {
  protected:
    using Base<View, false>::x;
    using Base<View, false>::tupleSet;
    using Base<View, false>::ts;
    using Base<View, false>::last;
    using Base<View, false>::last_next;
    using Base<View, false>::init_last;
    using Base<View, false>::init_dom;
    class SupportEntry : public FreeList {
    public:
      Tuple t;



      SupportEntry* next(void) const;
      SupportEntry** nextRef(void);



      SupportEntry(Tuple t);
      SupportEntry(Tuple t, SupportEntry* n);



      void dispose(Space& home, SupportEntry* l);
      void dispose(Space& home);

      static void* operator new(size_t s, Space& home);
      static void operator delete(void* p);
      static void operator delete(void* p, Space& home);
    };
    class WorkEntry : public FreeList {
    public:
      int i;
      int n;



      WorkEntry(int i, int n, WorkEntry* ne);



      WorkEntry* next(void) const;
      void next(WorkEntry* n);



      void dispose(Space& home);

      static void* operator new(size_t s, Space& home);
      static void operator delete(void* p);
      static void operator delete(void* p, Space& home);
    };
    class Work {
    private:
      WorkEntry* we;
    public:
      Work(void);
      bool empty(void) const;
      void push(Space& home, int i, int n);
      void pop(Space& home, int& i, int& n);
    };
    Work w_support;
    Work w_remove;

    SupportEntry** support_data;
    int unassigned;

    Incremental(Space& home, bool share, Incremental<View>& p);
    Incremental(Space& home, ViewArray<View>& x, const TupleSet& t);
    void init_support(Space& home);
    void find_support(Space& home, Domain dom, int i, int n);
    void add_support(Space& home, Tuple l);
    void remove_support(Space& home, Tuple l, int i, int n);
    SupportEntry* support(int i, int n);
  public:
    virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
    virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
    virtual Actor* copy(Space& home, bool share);
    static ExecStatus post(Space& home, ViewArray<View>& x, const TupleSet& t);
    size_t dispose(Space& home);
  private:
    class SupportAdvisor : public Advisor {
    public:
      int i;
      SupportAdvisor(Space& home, Propagator& p, Council<SupportAdvisor>& c,
                     int i);
      SupportAdvisor(Space& home, bool share, SupportAdvisor& a);
      void dispose(Space& home, Council<SupportAdvisor>& c);
    };
    Council<SupportAdvisor> ac;
  public:
    virtual ExecStatus advise(Space& home, Advisor& a, const Delta& d);
  };

}}}

#include <gecode/int/extensional/incremental.hpp>


#endif

// STATISTICS: int-prop