main page modules namespaces classes files
Gecode home

search for 

lin-rel.icc

Go to the documentation of this file.

/*
 *  Main authors:
 *     Christian Schulte <schulte@gecode.org>
 *
 *  Copyright:
 *     Christian Schulte, 2005
 *
 *  Last modified:
 *     $Date: 2006-08-04 16:05:26 +0200 (Fri, 04 Aug 2006) $ by $Author: schulte $
 *     $Revision: 3513 $
 *
 *  This file is part of Gecode, the generic constraint
 *  development environment:
 *     http://www.gecode.org
 *
 *  See the file "LICENSE" for information on usage and
 *  redistribution of this file, and for a
 *     DISCLAIMER OF ALL WARRANTIES.
 *
 */

namespace Gecode {

  namespace MiniModel {

    /*
     * Operations for linear expressions
     *
     */
    forceinline
    LinRel::LinRel(void) {}

    forceinline
    LinRel::LinRel(const LinExpr& l, IntRelType irt0, const LinExpr& r)
      : e(l,r,-1), irt(irt0) {}

    forceinline
    LinRel::LinRel(const LinExpr& l, IntRelType irt0, int r)
      : e(l,-r,1), irt(irt0) {}

    forceinline
    LinRel::LinRel(int l, IntRelType irt0, const LinExpr& r)
      : e(r,-l,-1), irt(irt0) {}

    forceinline IntRelType
    LinRel::neg(IntRelType irt) {
      switch (irt) {
      case IRT_EQ: return IRT_NQ;
      case IRT_NQ: return IRT_EQ;
      case IRT_LQ: return IRT_GR;
      case IRT_LE: return IRT_GQ;
      case IRT_GQ: return IRT_LE;
      case IRT_GR:
      default:
        assert(irt == IRT_GR);
      }
      return IRT_LQ;
    }

    inline void
    LinRel::post(Space* home, bool t, IntConLevel icl) const {
      if (t) {
        e.post(home,irt,icl);
      } else {
        e.post(home,neg(irt),icl);
      }
    }

    forceinline void
    LinRel::post(Space* home, const BoolVar& b) const {
      e.post(home,irt,b);
    }

  }

}

/*
 * Construction of linear relations
 *
 */
inline Gecode::MiniModel::LinRel
operator==(int l,
           const Gecode::MiniModel::LinExpr& r) {
  return Gecode::MiniModel::LinRel(l,Gecode::IRT_EQ,r);
}
inline Gecode::MiniModel::LinRel
operator==(const Gecode::MiniModel::LinExpr& l,
           int r) {
  return Gecode::MiniModel::LinRel(l,Gecode::IRT_EQ,r);
}
inline Gecode::MiniModel::LinRel
operator==(const Gecode::MiniModel::LinExpr& l,
           const Gecode::MiniModel::LinExpr& r) {
  return Gecode::MiniModel::LinRel(l,Gecode::IRT_EQ,r);
}

inline Gecode::MiniModel::LinRel
operator!=(int l,
           const Gecode::MiniModel::LinExpr& r) {
  return Gecode::MiniModel::LinRel(l,Gecode::IRT_NQ,r);
}
inline Gecode::MiniModel::LinRel
operator!=(const Gecode::MiniModel::LinExpr& l,
           int r) {
  return Gecode::MiniModel::LinRel(l,Gecode::IRT_NQ,r);
}
inline Gecode::MiniModel::LinRel
operator!=(const Gecode::MiniModel::LinExpr& l,
           const Gecode::MiniModel::LinExpr& r) {
  return Gecode::MiniModel::LinRel(l,Gecode::IRT_NQ,r);
}

inline Gecode::MiniModel::LinRel
operator<(int l,
          const Gecode::MiniModel::LinExpr& r) {
  return Gecode::MiniModel::LinRel(l,Gecode::IRT_LE,r);
}
inline Gecode::MiniModel::LinRel
operator<(const Gecode::MiniModel::LinExpr& l,
          int r) {
  return Gecode::MiniModel::LinRel(l,Gecode::IRT_LE,r);
}
inline Gecode::MiniModel::LinRel
operator<(const Gecode::MiniModel::LinExpr& l,
          const Gecode::MiniModel::LinExpr& r) {
  return Gecode::MiniModel::LinRel(l,Gecode::IRT_LE,r);
}

inline Gecode::MiniModel::LinRel
operator<=(int l,
           const Gecode::MiniModel::LinExpr& r) {
  return Gecode::MiniModel::LinRel(l,Gecode::IRT_LQ,r);
}
inline Gecode::MiniModel::LinRel
operator<=(const Gecode::MiniModel::LinExpr& l,
           int r) {
  return Gecode::MiniModel::LinRel(l,Gecode::IRT_LQ,r);
}
inline Gecode::MiniModel::LinRel
operator<=(const Gecode::MiniModel::LinExpr& l,
           const Gecode::MiniModel::LinExpr& r) {
  return Gecode::MiniModel::LinRel(l,Gecode::IRT_LQ,r);
}

inline Gecode::MiniModel::LinRel
operator>(int l,
          const Gecode::MiniModel::LinExpr& r) {
  return Gecode::MiniModel::LinRel(l,Gecode::IRT_GR,r);
}
inline Gecode::MiniModel::LinRel
operator>(const Gecode::MiniModel::LinExpr& l,
          int r) {
  return Gecode::MiniModel::LinRel(l,Gecode::IRT_GR,r);
}
inline Gecode::MiniModel::LinRel
operator>(const Gecode::MiniModel::LinExpr& l,
          const Gecode::MiniModel::LinExpr& r) {
  return Gecode::MiniModel::LinRel(l,Gecode::IRT_GR,r);
}

inline Gecode::MiniModel::LinRel
operator>=(int l,
           const Gecode::MiniModel::LinExpr& r) {
  return Gecode::MiniModel::LinRel(l,Gecode::IRT_GQ,r);
}
inline Gecode::MiniModel::LinRel
operator>=(const Gecode::MiniModel::LinExpr& l,
           int r) {
  return Gecode::MiniModel::LinRel(l,Gecode::IRT_GQ,r);
}
inline Gecode::MiniModel::LinRel
operator>=(const Gecode::MiniModel::LinExpr& l,
           const Gecode::MiniModel::LinExpr& r) {
  return Gecode::MiniModel::LinRel(l,Gecode::IRT_GQ,r);
}


namespace Gecode {

  /*
   * Posting
   *
   */

  forceinline void
  post(Space* home, const MiniModel::LinRel& r, IntConLevel icl) {
    if (home->failed()) return;
    r.post(home,true,icl);
  }
  forceinline void
  post(Space* home, bool r, IntConLevel) {
    if (home->failed()) return;
    if (!r)
      home->fail();
  }

}

// STATISTICS: minimodel-any