text: /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
  /*
   *  Main authors:
   *     Christian Schulte <schulte@gecode.org>
   *     Guido Tack <tack@gecode.org>
   *
   *  Copyright:
   *     Christian Schulte, 2009
   *     Guido Tack, 2010
   *
   *  Last modified:
   *     $Date: 2011-05-25 16:56:41 +0200 (on, 25 maj 2011) $ by $Author: schulte $
   *     $Revision: 12022 $
   *
   *  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 Unary {
  
    /*
     * Mandatory fixed task
     */
  
    forceinline
    ManFixPTask::ManFixPTask(void) {}
    forceinline
    ManFixPTask::ManFixPTask(IntVar s, int p) : _s(s), _p(p) {}
    forceinline void
    ManFixPTask::init(IntVar s, int p) {
      _s=s; _p=p;
    }
    forceinline void
    ManFixPTask::init(const ManFixPTask& t) {
      _s=t._s; _p=t._p;
    }
  
    forceinline int 
    ManFixPTask::est(void) const {
      return _s.min();
    }
    forceinline int
    ManFixPTask::ect(void) const {
      return _s.min()+_p;
    }
    forceinline int
    ManFixPTask::lst(void) const {
      return _s.max();
    }
    forceinline int
    ManFixPTask::lct(void) const {
      return _s.max()+_p;
    }
    forceinline int
    ManFixPTask::pmin(void) const {
      return _p;
    }
    forceinline int
    ManFixPTask::pmax(void) const {
      return _p;
    }
    forceinline IntVar
    ManFixPTask::st(void) const {
      return _s;
    }
  
    forceinline bool
    ManFixPTask::mandatory(void) const {
      return true;
    }
    forceinline bool
    ManFixPTask::excluded(void) const {
      return false;
    }
    forceinline bool
    ManFixPTask::optional(void) const {
      return false;
    }
  
    forceinline bool
    ManFixPTask::assigned(void) const {
      return _s.assigned();
    }
  
    forceinline ModEvent 
    ManFixPTask::est(Space& home, int n) {
      return _s.gq(home,n);
    }
    forceinline ModEvent
    ManFixPTask::ect(Space& home, int n) {
      return _s.gq(home,n-_p);
    }
    forceinline ModEvent
    ManFixPTask::lst(Space& home, int n) {
      return _s.lq(home,n);
    }
    forceinline ModEvent
    ManFixPTask::lct(Space& home, int n) {
      return _s.lq(home,n-_p);
    }
    forceinline ModEvent
    ManFixPTask::norun(Space& home, int e, int l) {
      if (e <= l) {
        Iter::Ranges::Singleton r(e-_p+1,l);
        return _s.minus_r(home,r,false);
      } else {
        return Int::ME_INT_NONE;
      }
    }
  
  
    forceinline ModEvent
    ManFixPTask::mandatory(Space&) {
      return Int::ME_INT_NONE;
    }
    forceinline ModEvent
    ManFixPTask::excluded(Space&) {
      return Int::ME_INT_FAILED;
    }
  
    forceinline void
    ManFixPTask::update(Space& home, bool share, ManFixPTask& t) {
      _s.update(home,share,t._s); _p=t._p;
    }
  
    forceinline void
    ManFixPTask::subscribe(Space& home, Propagator& p, PropCond pc) {
      _s.subscribe(home, p, pc);
    }
    forceinline void
    ManFixPTask::cancel(Space& home, Propagator& p, PropCond pc) {
      _s.cancel(home, p, pc);
    }
  
    template<class Char, class Traits>
    std::basic_ostream<Char,Traits>&
    operator <<(std::basic_ostream<Char,Traits>& os, const ManFixPTask& t) {
      std::basic_ostringstream<Char,Traits> s;
      s.copyfmt(os); s.width(0);
      s << t.est() << ':' << t.pmin() << ':' << t.lct();
      return os << s.str();
    }
  
    /*
     * Mandatory fixed task with fixed processing, start or end time
     */
  
    forceinline
    ManFixPSETask::ManFixPSETask(void) {}
    forceinline
    ManFixPSETask::ManFixPSETask(TaskType t, IntVar s, int p) 
      : ManFixPTask(s,p), _t(t) {}
    forceinline void
    ManFixPSETask::init(TaskType t, IntVar s, int p) {
      ManFixPTask::init(s,p); _t=t;
    }
    forceinline void
    ManFixPSETask::init(const ManFixPSETask& t0) {
      ManFixPTask::init(t0); _t = t0._t;
    }
  
    forceinline int 
    ManFixPSETask::est(void) const {
      return (_t == TT_FIXS) ? _p : _s.min();
    }
    forceinline int
    ManFixPSETask::ect(void) const {
      switch (_t) {
      case TT_FIXP: return _s.min()+_p;
      case TT_FIXS: return _s.min();
      case TT_FIXE: return _p;
      default: GECODE_NEVER;
      }
      return 0;
    }
    forceinline int
    ManFixPSETask::lst(void) const {
      return (_t == TT_FIXS) ? _p : _s.max();
    }
    forceinline int
    ManFixPSETask::lct(void) const {
      switch (_t) {
      case TT_FIXP: return _s.max()+_p;
      case TT_FIXS: return _s.max();
      case TT_FIXE: return _p;
      default: GECODE_NEVER;
      }
      return 0;
    }
    forceinline int
    ManFixPSETask::pmin(void) const {
      switch (_t) {
      case TT_FIXP: return _p;
      case TT_FIXS: return _s.min()-_p;
      case TT_FIXE: return _p-_s.max();
      default: GECODE_NEVER;
      }
      return 0;
    }
    forceinline int
    ManFixPSETask::pmax(void) const {
      switch (_t) {
      case TT_FIXP: return _p;
      case TT_FIXS: return _s.max()-_p;
      case TT_FIXE: return _p-_s.min();
      default: GECODE_NEVER;
      }
      return 0;
    }
  
    forceinline ModEvent 
    ManFixPSETask::est(Space& home, int n) {
      switch (_t) {
      case TT_FIXE: // fall through
      case TT_FIXP: return _s.gq(home,n);
      case TT_FIXS: return (n <= _p) ? Int::ME_INT_NONE : Int::ME_INT_FAILED;
      default: GECODE_NEVER;
      }
      return Int::ME_INT_NONE;
    }
    forceinline ModEvent
    ManFixPSETask::ect(Space& home, int n) {
      switch (_t) {
      case TT_FIXE: return (n <= _p) ? Int::ME_INT_NONE : Int::ME_INT_FAILED;
      case TT_FIXP: return _s.gq(home,n-_p);
      case TT_FIXS: return _s.gq(home,n);
      default: GECODE_NEVER;
      }
      return Int::ME_INT_NONE;
    }
    forceinline ModEvent
    ManFixPSETask::lst(Space& home, int n) {
      switch (_t) {
      case TT_FIXE: // fall through
      case TT_FIXP: return _s.lq(home,n);
      case TT_FIXS: return (n >= _p) ? Int::ME_INT_NONE : Int::ME_INT_FAILED;
      default: GECODE_NEVER;
      }
      return Int::ME_INT_NONE;
    }
    forceinline ModEvent
    ManFixPSETask::lct(Space& home, int n) {
      switch (_t) {
      case TT_FIXE: return (n >= _p) ? Int::ME_INT_NONE : Int::ME_INT_FAILED;
      case TT_FIXP: return _s.lq(home,n-_p);
      case TT_FIXS: return _s.lq(home,n);
      default: GECODE_NEVER;
      }
      return Int::ME_INT_NONE;
    }
    forceinline ModEvent
    ManFixPSETask::norun(Space& home, int e, int l) {
      if (e <= l) {
        switch (_t) {
        case TT_FIXP:
          {
            Iter::Ranges::Singleton r(e-_p+1,l);
            return _s.minus_r(home,r,false);
          }
        case TT_FIXE:
          if (e <= _p)
            return _s.gr(home,l);
          break;
        case TT_FIXS:
          if (l >= _p)
            return _s.lq(home,e);
          break;
        default:
          GECODE_NEVER;
        }
        return Int::ME_INT_NONE;
      } else {
        return Int::ME_INT_NONE;
      }
    }
  
    forceinline void
    ManFixPSETask::update(Space& home, bool share, ManFixPSETask& t) {
      ManFixPTask::update(home,share,t); _t=t._t;
    }
  
    template<class Char, class Traits>
    std::basic_ostream<Char,Traits>&
    operator <<(std::basic_ostream<Char,Traits>& os, const ManFixPSETask& t) {
      std::basic_ostringstream<Char,Traits> s;
      s.copyfmt(os); s.width(0);
      s << t.est() << ':' << t.pmin() << ':' << t.lct();
      return os << s.str();
    }
  
    /*
     * Mandatory flexible task
     */
  
    forceinline
    ManFlexTask::ManFlexTask(void) {}
    forceinline
    ManFlexTask::ManFlexTask(IntVar s, IntVar p, IntVar e)
      : _s(s), _p(p), _e(e) {}
    forceinline void
    ManFlexTask::init(IntVar s, IntVar p, IntVar e) {
      _s=s; _p=p; _e=e;
    }
    forceinline void
    ManFlexTask::init(const ManFlexTask& t) {
      _s=t._s; _p=t._p; _e=t._e;
    }
  
    forceinline int 
    ManFlexTask::est(void) const {
      return _s.min();
    }
    forceinline int
    ManFlexTask::ect(void) const {
      return _e.min();
    }
    forceinline int
    ManFlexTask::lst(void) const {
      return _s.max();
    }
    forceinline int
    ManFlexTask::lct(void) const {
      return _e.max();
    }
    forceinline int
    ManFlexTask::pmin(void) const {
      return _p.min();
    }
    forceinline int
    ManFlexTask::pmax(void) const {
      return _p.max();
    }
    forceinline IntVar
    ManFlexTask::st(void) const {
      return _s;
    }
    forceinline IntVar
    ManFlexTask::p(void) const {
      return _p;
    }
    forceinline IntVar
    ManFlexTask::e(void) const {
      return _e;
    }
  
    forceinline bool
    ManFlexTask::mandatory(void) const {
      return true;
    }
    forceinline bool
    ManFlexTask::excluded(void) const {
      return false;
    }
    forceinline bool
    ManFlexTask::optional(void) const {
      return false;
    }
  
    forceinline bool
    ManFlexTask::assigned(void) const {
      return _s.assigned() && _p.assigned() && _e.assigned();
    }
  
    forceinline ModEvent 
    ManFlexTask::est(Space& home, int n) {
      return _s.gq(home,n);
    }
    forceinline ModEvent
    ManFlexTask::ect(Space& home, int n) {
      return _e.gq(home,n);
    }
    forceinline ModEvent
    ManFlexTask::lst(Space& home, int n) {
      return _s.lq(home,n);
    }
    forceinline ModEvent
    ManFlexTask::lct(Space& home, int n) {
      return _e.lq(home,n);
    }
    forceinline ModEvent
    ManFlexTask::norun(Space& home, int e, int l) {
      if (e <= l) {
        Iter::Ranges::Singleton sr(e-_p.min()+1,l);
        if (me_failed(_s.minus_r(home,sr,false)))
          return Int::ME_INT_FAILED;
        Iter::Ranges::Singleton er(e+1,_p.min()+l);
        return _e.minus_r(home,er,false);
      } else {
        return Int::ME_INT_NONE;
      }
    }
  
  
    forceinline ModEvent
    ManFlexTask::mandatory(Space&) {
      return Int::ME_INT_NONE;
    }
    forceinline ModEvent
    ManFlexTask::excluded(Space&) {
      return Int::ME_INT_FAILED;
    }
  
    forceinline void
    ManFlexTask::update(Space& home, bool share, ManFlexTask& t) {
      _s.update(home,share,t._s);
      _p.update(home,share,t._p);
      _e.update(home,share,t._e);
    }
  
    forceinline void
    ManFlexTask::subscribe(Space& home, Propagator& p, PropCond pc) {
      _s.subscribe(home, p, pc);
      _p.subscribe(home, p, pc);
      _e.subscribe(home, p, pc);
    }
    forceinline void
    ManFlexTask::cancel(Space& home, Propagator& p, PropCond pc) {
      _s.cancel(home, p, pc);
      _p.cancel(home, p, pc);
      _e.cancel(home, p, pc);
    }
  
    template<class Char, class Traits>
    std::basic_ostream<Char,Traits>&
    operator <<(std::basic_ostream<Char,Traits>& os, const ManFlexTask& t) {
      std::basic_ostringstream<Char,Traits> s;
      s.copyfmt(os); s.width(0);
      s << t.est() << ':' << t.lst() << ':' << t.pmin() << ':'
        << t.pmax() << ':' << t.ect() << ':' << t.lct();
      return os << s.str();
    }
  
    /*
     * Optional fixed task
     */
  
    forceinline
    OptFixPTask::OptFixPTask(void) {}
    forceinline
    OptFixPTask::OptFixPTask(IntVar s, int p, BoolVar m) {
      ManFixPTask::init(s,p); _m=m;
    }
    forceinline void
    OptFixPTask::init(IntVar s, int p, BoolVar m) {
      ManFixPTask::init(s,p); _m=m;
    }
  
    template<class Char, class Traits>
    std::basic_ostream<Char,Traits>&
    operator <<(std::basic_ostream<Char,Traits>& os, const OptFixPTask& t) {
      std::basic_ostringstream<Char,Traits> s;
      s.copyfmt(os); s.width(0);
      s << t.est() << ':' << t.pmin() << ':' << t.lct() << ':'
        << (t.mandatory() ? '1' : (t.optional() ? '?' : '0'));
      return os << s.str();
    }
  
    /*
     * Optional fixed task
     */
  
    forceinline
    OptFixPSETask::OptFixPSETask(void) {}
    forceinline
    OptFixPSETask::OptFixPSETask(TaskType t,IntVar s,int p,BoolVar m) {
      ManFixPSETask::init(t,s,p); _m=m;
    }
    forceinline void
    OptFixPSETask::init(TaskType t, IntVar s, int p, BoolVar m) {
      ManFixPSETask::init(t,s,p); _m=m;
    }
  
    template<class Char, class Traits>
    std::basic_ostream<Char,Traits>&
    operator <<(std::basic_ostream<Char,Traits>& os, const OptFixPSETask& t) {
      std::basic_ostringstream<Char,Traits> s;
      s.copyfmt(os); s.width(0);
      s << t.est() << ':' << t.pmin() << ':' << t.lct() << ':'
        << (t.mandatory() ? '1' : (t.optional() ? '?' : '0'));
      return os << s.str();
    }
  
    /*
     * Optional flexible task
     */
  
    forceinline
    OptFlexTask::OptFlexTask(void) {}
    forceinline
    OptFlexTask::OptFlexTask(IntVar s, IntVar p, IntVar e, BoolVar m) {
      ManFlexTask::init(s,p,e); _m=m;
    }
    forceinline void
    OptFlexTask::init(IntVar s, IntVar p, IntVar e, BoolVar m) {
      ManFlexTask::init(s,p,e); _m=m;
    }
  
    template<class Char, class Traits>
    std::basic_ostream<Char,Traits>&
    operator <<(std::basic_ostream<Char,Traits>& os, const OptFlexTask& t) {
      std::basic_ostringstream<Char,Traits> s;
      s.copyfmt(os); s.width(0);
      s << t.est() << ':' << t.lst() << ':' << t.pmin() << ':'
        << t.pmax() << ':' << t.ect() << ':' << t.lct() << ':'
        << (t.mandatory() ? '1' : (t.optional() ? '?' : '0'));
      return os << s.str();
    }
      
  }}}
  
  // STATISTICS: int-var
  