extensional.hh

Go to the documentation of this file.

/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
 *  Main authors:
 *     Linnea Ingmar <linnea.ingmar@hotmail.com>
 *     Mikael Lagerkvist <lagerkvist@gecode.org>
 *     Christian Schulte <schulte@gecode.org>
 *
 *  Copyright:
 *     Linnea Ingmar, 2017
 *     Mikael Lagerkvist, 2007
 *     Christian Schulte, 2004
 *
 *  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 Val, class Degree, class StateIdx>
  class LayeredGraph : public Propagator {
  protected:
    class State {
    public:
      Degree i_deg; 
      Degree o_deg; 

      void init(void);
    };
    class Edge {
    public:
      StateIdx i_state; 
      StateIdx o_state; 
    };
    class Support {
    public:
      Val val; 
      Degree n_edges; 
      Edge* edges; 
    };
    typedef typename Gecode::Support::IntTypeTraits<Val>::utype ValSize;
    class Layer {
    public:
      View x; 
      StateIdx n_states; 
      ValSize size; 
      State* states; 
      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:
      int i;
      Index(Space& home, Propagator& p, Council<Index>& c, int i);
      Index(Space& home, Index& a);
    };
    class IndexRange {
    private:
      int _fst; 
      int _lst; 
    public:
      IndexRange(void);
      void reset(void);
      void add(int i);
      void add(const IndexRange& ir);
      void lshift(int n);
      bool empty(void) const;
      int fst(void) const;
      int lst(void) const;
    };
    Council<Index> c;
    int n;
    Layer* layers;
    StateIdx max_states;
    unsigned int n_states;
    unsigned int n_edges;
    IndexRange i_ch;
    IndexRange o_ch;
    IndexRange a_ch;
    State& i_state(int i, StateIdx is);
    State& i_state(int i, const Edge& e);
    bool i_dec(int i, const Edge& e);
    State& o_state(int i, StateIdx os);
    State& o_state(int i, const Edge& e);
    bool o_dec(int i, const Edge& e);
    void audit(void);
    template<class Var>
    ExecStatus initialize(Space& home,
                          const VarArgArray<Var>& x, const DFA& dfa);
    LayeredGraph(Space& home, LayeredGraph<View,Val,Degree,StateIdx>& p);
  public:
    template<class Var>
    LayeredGraph(Home home,
                 const VarArgArray<Var>& x, const DFA& dfa);
    virtual Actor* copy(Space& home);
    virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
    virtual void reschedule(Space& home);
    virtual ExecStatus advise(Space& home, Advisor& a, const Delta& d);
    virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
    virtual size_t dispose(Space& home);
    template<class Var>
    static ExecStatus post(Home home,
                           const VarArgArray<Var>& x, const DFA& dfa);
  };

  template<class Var>
  ExecStatus post_lgp(Home home,
                      const VarArgArray<Var>& x, const DFA& dfa);

}}}

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


namespace Gecode { namespace Int { namespace Extensional {

  typedef Gecode::Support::BitSetData BitSetData;

  /*
   * Forward declarations
   */
  template<unsigned int size> class TinyBitSet;

  template<class IndexType>
  class BitSet {
    template<class> friend class BitSet;
    template<unsigned int> friend class TinyBitSet;
  protected:
    IndexType _limit;
    IndexType* index;
    BitSetData* bits;
    void replace_and_decrease(IndexType i, BitSetData w);
  public:
    BitSet(Space& home, unsigned int n);
    template<class OldIndexType>
    BitSet(Space& home, const BitSet<OldIndexType>& bs);
    BitSet(Space& home, const TinyBitSet<1U>& tbs);
    BitSet(Space& home, const TinyBitSet<2U>& tbs);
    BitSet(Space& home, const TinyBitSet<3U>& tbs);
    BitSet(Space& home, const TinyBitSet<4U>& tbs);
    unsigned int limit(void) const;
    bool empty(void) const;
    unsigned int width(void) const;
    void clear_mask(BitSetData* mask) const;
    void add_to_mask(const BitSetData* b, BitSetData* mask) const;
    template<bool sparse>
    void intersect_with_mask(const BitSetData* mask);
    void intersect_with_masks(const BitSetData* a, const BitSetData* b);
    bool intersects(const BitSetData* b) const;
    void nand_with_mask(const BitSetData* b);
    unsigned int words(void) const;
    unsigned int size(void) const;
  };

}}}

#include <gecode/int/extensional/bit-set.hpp>

namespace Gecode { namespace Int { namespace Extensional {

  template<unsigned int _size>
  class TinyBitSet {
    template<unsigned int> friend class TinyBitSet;
  protected:
    BitSetData bits[_size];
  public:
    TinyBitSet(Space& home, unsigned int n);
    template<unsigned int largersize>
    TinyBitSet(Space& home, const TinyBitSet<largersize>& tbs);
    template<class IndexType>
    TinyBitSet(Space& home, const BitSet<IndexType>& bs);
    int limit(void) const;
    bool empty(void) const;
    unsigned int width(void) const;
    void clear_mask(BitSetData* mask);
    void add_to_mask(const BitSetData* b, BitSetData* mask) const;
    template<bool sparse>
    void intersect_with_mask(const BitSetData* mask);
    void intersect_with_masks(const BitSetData* a, const BitSetData* b);
    bool intersects(const BitSetData* b);
    void nand_with_mask(const BitSetData* b);
    void nand_with_masks(const BitSetData* a, const BitSetData* b);
    unsigned int words(void) const;
    unsigned int size(void) const;
  };
      
}}}

#include <gecode/int/extensional/tiny-bit-set.hpp>

namespace Gecode { namespace Int { namespace Extensional {

  typedef TupleSet::Tuple Tuple;

  template<class View>
  class Compact : public Propagator {
  protected:
    typedef TupleSet::Range Range;
    class CTAdvisor : public ViewAdvisor<View> {
    public:
      using ViewAdvisor<View>::view;
    protected:
      const Range* _fst;
      const Range* _lst;
    public:


      CTAdvisor(Space& home, Propagator& p, Council<CTAdvisor>& c,
                const TupleSet& ts, View x0, int i);
      CTAdvisor(Space& home, CTAdvisor& a);

      void adjust(void);
      const Range* fst(void) const;
      const Range* lst(void) const;
      void dispose(Space& home, Council<CTAdvisor>& c);
    };


    enum StatusType {
      SINGLE      = 0, 
      MULTIPLE    = 1, 
      NONE        = 2, 
      PROPAGATING = 3  
    };
    class Status {
    protected:
      ptrdiff_t s;
    public:
      Status(StatusType t);
      Status(const Status& s);
      StatusType type(void) const;
      bool single(CTAdvisor& a) const;
      void touched(CTAdvisor& a);
      void none(void);
      void propagating(void);
    };



    class ValidSupports {
    protected:
      const unsigned int n_words;
      int max;
      ViewRanges<View> xr;
      const Range* sr;
      int n;
      const BitSetData* s;
    public:
      ValidSupports(const Compact<View>& p, CTAdvisor& a);
      ValidSupports(const TupleSet& ts, int i, View x);
      void operator ++(void);
      bool operator ()(void) const;
      const BitSetData* supports(void) const;
      int val(void) const;
    };
    class LostSupports {
    protected:
      const unsigned int n_words;
      const Range* r;
      int l;
      int h;
      const BitSetData* s;
    public:
      LostSupports(const Compact<View>& p, CTAdvisor& a,
                   int l, int h);
      void operator ++(void);
      bool operator ()(void) const;
      const BitSetData* supports(void) const;
    };
  protected:
    int unassigned;
    const unsigned int n_words;
    Status status;
    TupleSet ts;
    Council<CTAdvisor> c;
    Compact(Space& home, Compact& p);
    Compact(Home home, ViewArray<View>& x, const TupleSet& ts);
    const Range* range(CTAdvisor& a, int n);
    const BitSetData* supports(CTAdvisor& a, int n);
  public:
    size_t dispose(Space& home);
  };

  template<class View, class Table>
  class CompactTable : public Compact<View> {    
  public:
    typedef typename Compact<View>::ValidSupports ValidSupports;
    typedef typename Compact<View>::Range Range;
    typedef typename Compact<View>::CTAdvisor CTAdvisor;
    typedef typename Compact<View>::StatusType StatusType;
    typedef typename Compact<View>::Status Status;
    typedef typename Compact<View>::LostSupports LostSupports;

    using Compact<View>::supports;
    using Compact<View>::unassigned;
    using Compact<View>::status;
    using Compact<View>::c;
    using Compact<View>::ts;

    Table table;
    template<class TableProp>
    CompactTable(Space& home, TableProp& p);
    CompactTable(Home home, ViewArray<View>& x, const TupleSet& ts);
  public:
    virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
    virtual void reschedule(Space& home);
    virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
    virtual Actor* copy(Space& home);
    static ExecStatus post(Home home, ViewArray<View>& x, const TupleSet& ts);
    size_t dispose(Space& home);
    virtual ExecStatus advise(Space& home, Advisor& a, const Delta& d);
  };

  template<class View>
  ExecStatus postcompact(Home home, ViewArray<View>& x, const TupleSet& ts);

}}}

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

#endif

// STATISTICS: int-prop