libgecode-dev 4.2.1-1 / usr / include / gecode / int / linear / int-bin.hpp

/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
 *  Main authors:
 *     Christian Schulte <schulte@gecode.org>
 *
 *  Copyright:
 *     Christian Schulte, 2003
 *
 *  Last modified:
 *     $Date: 2012-10-18 16:02:42 +0200 (Thu, 18 Oct 2012) $ by $Author: schulte $
 *     $Revision: 13154 $
 *
 *  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.
 *
 */

namespace Gecode { namespace Int { namespace Linear {

  /*
   * Binary linear propagators
   *
   */
  template<class Val, class A, class B, PropCond pc>
  forceinline
  LinBin<Val,A,B,pc>::LinBin(Home home, A y0, B y1, Val c0)
    : Propagator(home), x0(y0), x1(y1), c(c0) {
    x0.subscribe(home,*this,pc);
    x1.subscribe(home,*this,pc);
  }

  template<class Val, class A, class B, PropCond pc>
  forceinline
  LinBin<Val,A,B,pc>::LinBin(Space& home, bool share, LinBin<Val,A,B,pc>& p)
    : Propagator(home,share,p), c(p.c) {
    x0.update(home,share,p.x0);
    x1.update(home,share,p.x1);
  }

  template<class Val, class A, class B, PropCond pc>
  forceinline
  LinBin<Val,A,B,pc>::LinBin(Space& home, bool share, Propagator& p,
                             A y0, B y1, Val c0)
    : Propagator(home,share,p), c(c0) {
    x0.update(home,share,y0);
    x1.update(home,share,y1);
  }

  template<class Val, class A, class B, PropCond pc>
  PropCost
  LinBin<Val,A,B,pc>::cost(const Space&, const ModEventDelta&) const {
    return PropCost::binary(PropCost::LO);
  }

  template<class Val, class A, class B, PropCond pc>
  forceinline size_t
  LinBin<Val,A,B,pc>::dispose(Space& home) {
    x0.cancel(home,*this,pc);
    x1.cancel(home,*this,pc);
    (void) Propagator::dispose(home);
    return sizeof(*this);
  }


  /*
   * Binary reified linear propagators
   *
   */
  template<class Val, class A, class B, PropCond pc, class Ctrl>
  forceinline
  ReLinBin<Val,A,B,pc,Ctrl>::ReLinBin(Home home, A y0, B y1, Val c0, Ctrl b0)
    : Propagator(home), x0(y0), x1(y1), c(c0), b(b0) {
    x0.subscribe(home,*this,pc);
    x1.subscribe(home,*this,pc);
    b.subscribe(home,*this,PC_INT_VAL);
  }

  template<class Val, class A, class B, PropCond pc, class Ctrl>
  forceinline
  ReLinBin<Val,A,B,pc,Ctrl>::ReLinBin(Space& home, bool share,
                                      ReLinBin<Val,A,B,pc,Ctrl>& p)
    : Propagator(home,share,p), c(p.c) {
    x0.update(home,share,p.x0);
    x1.update(home,share,p.x1);
    b.update(home,share,p.b);
  }

  template<class Val, class A, class B, PropCond pc, class Ctrl>
  PropCost
  ReLinBin<Val,A,B,pc,Ctrl>::cost(const Space&, const ModEventDelta&) const {
    return PropCost::binary(PropCost::LO);
  }

  template<class Val, class A, class B, PropCond pc, class Ctrl>
  forceinline size_t
  ReLinBin<Val,A,B,pc,Ctrl>::dispose(Space& home) {
    x0.cancel(home,*this,pc);
    x1.cancel(home,*this,pc);
    b.cancel(home,*this,PC_BOOL_VAL);
    (void) Propagator::dispose(home);
    return sizeof(*this);
  }

  /*
   * Binary bounds consistent linear equality
   *
   */

  template<class Val, class A, class B>
  forceinline
  EqBin<Val,A,B>::EqBin(Home home, A x0, B x1, Val c)
    : LinBin<Val,A,B,PC_INT_BND>(home,x0,x1,c) {}

  template<class Val, class A, class B>
  ExecStatus
  EqBin<Val,A,B>::post(Home home, A x0, B x1, Val c) {
    (void) new (home) EqBin<Val,A,B>(home,x0,x1,c);
    return ES_OK;
  }


  template<class Val, class A, class B>
  forceinline
  EqBin<Val,A,B>::EqBin(Space& home, bool share, EqBin<Val,A,B>& p)
    : LinBin<Val,A,B,PC_INT_BND>(home,share,p) {}

  template<class Val, class A, class B>
  forceinline
  EqBin<Val,A,B>::EqBin(Space& home, bool share, Propagator& p,
                        A x0, B x1, Val c)
    : LinBin<Val,A,B,PC_INT_BND>(home,share,p,x0,x1,c) {}

  template<class Val, class A, class B>
  Actor*
  EqBin<Val,A,B>::copy(Space& home, bool share) {
    return new (home) EqBin<Val,A,B>(home,share,*this);
  }

  /// Describe which view has been modified how
  enum BinMod {
    BM_X0_MIN = 1<<0,
    BM_X0_MAX = 1<<1,
    BM_X1_MIN = 1<<2,
    BM_X1_MAX = 1<<3,
    BM_ALL    = BM_X0_MIN|BM_X0_MAX|BM_X1_MIN|BM_X1_MAX
  };

#define GECODE_INT_PV(CASE,TELL,UPDATE)         \
  if (bm & (CASE)) {                            \
    bm -= (CASE); ModEvent me = (TELL);         \
    if (me_failed(me))   return ES_FAILED;      \
    if (me_modified(me)) bm |= (UPDATE);        \
  }

  template<class Val, class A, class B>
  ExecStatus
  EqBin<Val,A,B>::propagate(Space& home, const ModEventDelta&) {
    int bm = BM_ALL;
    do {
      GECODE_INT_PV(BM_X0_MIN, x0.gq(home,c-x1.max()), BM_X1_MAX);
      GECODE_INT_PV(BM_X1_MIN, x1.gq(home,c-x0.max()), BM_X0_MAX);
      GECODE_INT_PV(BM_X0_MAX, x0.lq(home,c-x1.min()), BM_X1_MIN);
      GECODE_INT_PV(BM_X1_MAX, x1.lq(home,c-x0.min()), BM_X0_MIN);
    } while (bm);
    return x0.assigned() ? home.ES_SUBSUMED(*this) : ES_FIX;
  }

#undef GECODE_INT_PV





  /*
   * Reified binary bounds consistent linear equality
   *
   */

  template<class Val, class A, class B, class Ctrl, ReifyMode rm>
  forceinline
  ReEqBin<Val,A,B,Ctrl,rm>::ReEqBin(Home home, A x0, B x1, Val c, Ctrl b)
    : ReLinBin<Val,A,B,PC_INT_BND,Ctrl>(home,x0,x1,c,b) {}

  template<class Val, class A, class B, class Ctrl, ReifyMode rm>
  ExecStatus
  ReEqBin<Val,A,B,Ctrl,rm>::post(Home home, A x0, B x1, Val c, Ctrl b) {
    (void) new (home) ReEqBin<Val,A,B,Ctrl,rm>(home,x0,x1,c,b);
    return ES_OK;
  }


  template<class Val, class A, class B, class Ctrl, ReifyMode rm>
  forceinline
  ReEqBin<Val,A,B,Ctrl,rm>::ReEqBin(Space& home, bool share,
                                    ReEqBin<Val,A,B,Ctrl,rm>& p)
    : ReLinBin<Val,A,B,PC_INT_BND,Ctrl>(home,share,p) {}

  template<class Val, class A, class B, class Ctrl, ReifyMode rm>
  Actor*
  ReEqBin<Val,A,B,Ctrl,rm>::copy(Space& home, bool share) {
    return new (home) ReEqBin<Val,A,B,Ctrl,rm>(home,share,*this);
  }

  template<class Val, class A, class B, class Ctrl, ReifyMode rm>
  ExecStatus
  ReEqBin<Val,A,B,Ctrl,rm>::propagate(Space& home, const ModEventDelta&) {
    if (b.zero()) {
      if (rm == RM_IMP)
        return home.ES_SUBSUMED(*this);        
      GECODE_REWRITE(*this,(NqBin<Val,A,B>::post(home(*this),x0,x1,c)));
    }
    if (b.one()) {
      if (rm == RM_PMI)
        return home.ES_SUBSUMED(*this);        
      GECODE_REWRITE(*this,(EqBin<Val,A,B>::post(home(*this),x0,x1,c)));
    }
    if ((x0.min() + x1.min() > c) || (x0.max() + x1.max() < c)) {
      if (rm != RM_PMI)
        GECODE_ME_CHECK(b.zero_none(home)); 
      return home.ES_SUBSUMED(*this);
    }
    if (x0.assigned() && x1.assigned()) {
      assert(x0.val() + x1.val() == c);
      if (rm != RM_IMP)
        GECODE_ME_CHECK(b.one_none(home)); 
      return home.ES_SUBSUMED(*this);
    }
    return ES_FIX;
  }




  /*
   * Binary domain consistent linear disequality
   *
   */
  template<class Val, class A, class B>
  forceinline
  NqBin<Val,A,B>::NqBin(Home home, A x0, B x1, Val c)
    : LinBin<Val,A,B,PC_INT_VAL>(home,x0,x1,c) {}

  template<class Val, class A, class B>
  ExecStatus
  NqBin<Val,A,B>::post(Home home, A x0, B x1, Val c) {
    (void) new (home) NqBin<Val,A,B>(home,x0,x1,c);
    return ES_OK;
  }


  template<class Val, class A, class B>
  forceinline
  NqBin<Val,A,B>::NqBin(Space& home, bool share, NqBin<Val,A,B>& p)
    : LinBin<Val,A,B,PC_INT_VAL>(home,share,p) {}

  template<class Val, class A, class B>
  Actor*
  NqBin<Val,A,B>::copy(Space& home, bool share) {
    return new (home) NqBin<Val,A,B>(home,share,*this);
  }

  template<class Val, class A, class B>
  forceinline
  NqBin<Val,A,B>::NqBin(Space& home, bool share, Propagator& p,
                        A x0, B x1, Val c)
    : LinBin<Val,A,B,PC_INT_VAL>(home,share,p,x0,x1,c) {}



  template<class Val, class A, class B>
  PropCost
  NqBin<Val,A,B>::cost(const Space&, const ModEventDelta&) const {
    return PropCost::unary(PropCost::LO);
  }

  template<class Val, class A, class B>
  ExecStatus
  NqBin<Val,A,B>::propagate(Space& home, const ModEventDelta&) {
    if (x0.assigned()) {
      GECODE_ME_CHECK(x1.nq(home,c-x0.val()));
    } else {
      assert(x1.assigned());
      GECODE_ME_CHECK(x0.nq(home,c-x1.val()));
    }
    return home.ES_SUBSUMED(*this);
  }


  /*
   * Binary domain consistent less equal
   *
   */

  template<class Val, class A, class B>
  forceinline
  LqBin<Val,A,B>::LqBin(Home home, A x0, B x1, Val c)
    : LinBin<Val,A,B,PC_INT_BND>(home,x0,x1,c) {}

  template<class Val, class A, class B>
  ExecStatus
  LqBin<Val,A,B>::post(Home home, A x0, B x1, Val c) {
    (void) new (home) LqBin<Val,A,B>(home,x0,x1,c);
    return ES_OK;
  }


  template<class Val, class A, class B>
  forceinline
  LqBin<Val,A,B>::LqBin(Space& home, bool share, LqBin<Val,A,B>& p)
    : LinBin<Val,A,B,PC_INT_BND>(home,share,p) {}

  template<class Val, class A, class B>
  Actor*
  LqBin<Val,A,B>::copy(Space& home, bool share) {
    return new (home) LqBin<Val,A,B>(home,share,*this);
  }

  template<class Val, class A, class B>
  forceinline
  LqBin<Val,A,B>::LqBin(Space& home, bool share, Propagator& p,
                        A x0, B x1, Val c)
    : LinBin<Val,A,B,PC_INT_BND>(home,share,p,x0,x1,c) {}

  template<class Val, class A, class B>
  ExecStatus
  LqBin<Val,A,B>::propagate(Space& home, const ModEventDelta&) {
    GECODE_ME_CHECK(x0.lq(home,c-x1.min()));
    GECODE_ME_CHECK(x1.lq(home,c-x0.min()));
    return (x0.max()+x1.max() <= c) ? home.ES_SUBSUMED(*this) : ES_FIX;
  }




  /*
   * Binary domain consistent greater equal
   *
   */

  template<class Val, class A, class B>
  forceinline
  GqBin<Val,A,B>::GqBin(Home home, A x0, B x1, Val c)
    : LinBin<Val,A,B,PC_INT_BND>(home,x0,x1,c) {}

  template<class Val, class A, class B>
  ExecStatus
  GqBin<Val,A,B>::post(Home home, A x0, B x1, Val c) {
    (void) new (home) GqBin<Val,A,B>(home,x0,x1,c);
    return ES_OK;
  }


  template<class Val, class A, class B>
  forceinline
  GqBin<Val,A,B>::GqBin(Space& home, bool share, GqBin<Val,A,B>& p)
    : LinBin<Val,A,B,PC_INT_BND>(home,share,p) {}

  template<class Val, class A, class B>
  Actor*
  GqBin<Val,A,B>::copy(Space& home, bool share) {
    return new (home) GqBin<Val,A,B>(home,share,*this);
  }

  template<class Val, class A, class B>
  forceinline
  GqBin<Val,A,B>::GqBin(Space& home, bool share, Propagator& p,
                        A x0, B x1, Val c)
    : LinBin<Val,A,B,PC_INT_BND>(home,share,p,x0,x1,c) {}

  template<class Val, class A, class B>
  ExecStatus
  GqBin<Val,A,B>::propagate(Space& home, const ModEventDelta&) {
    GECODE_ME_CHECK(x0.gq(home,c-x1.max()));
    GECODE_ME_CHECK(x1.gq(home,c-x0.max()));
    return (x0.min()+x1.min() >= c) ? home.ES_SUBSUMED(*this) : ES_FIX;
  }




  /*
   * Reified binary domain consistent less equal
   *
   */

  template<class Val, class A, class B, ReifyMode rm>
  forceinline
  ReLqBin<Val,A,B,rm>::ReLqBin(Home home, A x0, B x1, Val c, BoolView b)
    : ReLinBin<Val,A,B,PC_INT_BND,BoolView>(home,x0,x1,c,b) {}

  template<class Val, class A, class B, ReifyMode rm>
  ExecStatus
  ReLqBin<Val,A,B,rm>::post(Home home, A x0, B x1, Val c, BoolView b) {
    (void) new (home) ReLqBin<Val,A,B,rm>(home,x0,x1,c,b);
    return ES_OK;
  }


  template<class Val, class A, class B, ReifyMode rm>
  forceinline
  ReLqBin<Val,A,B,rm>::ReLqBin(Space& home, bool share, ReLqBin<Val,A,B,rm>& p)
    : ReLinBin<Val,A,B,PC_INT_BND,BoolView>(home,share,p) {}

  template<class Val, class A, class B, ReifyMode rm>
  Actor*
  ReLqBin<Val,A,B,rm>::copy(Space& home, bool share) {
    return new (home) ReLqBin<Val,A,B,rm>(home,share,*this);
  }

  template<class Val, class A, class B, ReifyMode rm>
  ExecStatus
  ReLqBin<Val,A,B,rm>::propagate(Space& home, const ModEventDelta&) {
    if (b.one()) {
      if (rm == RM_PMI)
        return home.ES_SUBSUMED(*this);        
      GECODE_REWRITE(*this,(LqBin<Val,A,B>::post(home(*this),x0,x1,c)));
    }
    if (b.zero()) {
      if (rm == RM_IMP)
        return home.ES_SUBSUMED(*this);        
      GECODE_REWRITE(*this,(GqBin<Val,A,B>::post(home(*this),x0,x1,c+1)));
    }
    if (x0.max() + x1.max() <= c) {
      if (rm != RM_IMP)
        GECODE_ME_CHECK(b.one_none(home)); 
      return home.ES_SUBSUMED(*this);
    }
    if (x0.min() + x1.min() > c) {
      if (rm != RM_PMI)
        GECODE_ME_CHECK(b.zero_none(home)); 
      return home.ES_SUBSUMED(*this);
    }
    return ES_FIX;
  }

}}}

// STATISTICS: int-prop