libgecode-dev 4.2.1-2 / usr / include / gecode / int / branch / val-sel.hpp

/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
 *  Main authors:
 *     Christian Schulte <schulte@gecode.org>
 *
 *  Copyright:
 *     Christian Schulte, 2012
 *
 *  Last modified:
 *     $Date: 2013-03-05 20:51:24 +0100 (Tue, 05 Mar 2013) $ by $Author: schulte $
 *     $Revision: 13438 $
 *
 *  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 Branch {

  template<class View>
  forceinline
  ValSelMin<View>::ValSelMin(Space& home, const ValBranch& vb) 
    : ValSel<View,int>(home,vb) {}
  template<class View>
  forceinline
  ValSelMin<View>::ValSelMin(Space& home, bool shared, ValSelMin& vs)
    : ValSel<View,int>(home,shared,vs) {}
  template<class View>
  forceinline int 
  ValSelMin<View>::val(const Space&, View x, int) {
    return x.min();
  }

  template<class View>
  forceinline
  ValSelMax<View>::ValSelMax(Space& home, const ValBranch& vb) 
    : ValSel<View,int>(home,vb) {}
  template<class View>
  forceinline
  ValSelMax<View>::ValSelMax(Space& home, bool shared, ValSelMax& vs)
    : ValSel<View,int>(home,shared,vs) {}
  template<class View>
  forceinline int 
  ValSelMax<View>::val(const Space&, View x, int) {
    return x.max();
  }

  template<class View>
  forceinline
  ValSelMed<View>::ValSelMed(Space& home, const ValBranch& vb) 
    : ValSel<View,int>(home,vb) {}
  template<class View>
  forceinline
  ValSelMed<View>::ValSelMed(Space& home, bool shared, ValSelMed& vs)
    : ValSel<View,int>(home,shared,vs) {}
  template<class View>
  forceinline int 
  ValSelMed<View>::val(const Space&, View x, int) {
    return x.med();
  }

  template<class View>
  forceinline
  ValSelAvg<View>::ValSelAvg(Space& home, const ValBranch& vb) 
    : ValSel<View,int>(home,vb) {}
  template<class View>
  forceinline
  ValSelAvg<View>::ValSelAvg(Space& home, bool shared, ValSelAvg& vs)
    : ValSel<View,int>(home,shared,vs) {}
  template<class View>
  forceinline int 
  ValSelAvg<View>::val(const Space&, View x, int) {
    return (x.width() == 2U) ? x.min() : ((x.min()+x.max()) / 2);
  }

  template<class View>
  forceinline
  ValSelRnd<View>::ValSelRnd(Space& home, const ValBranch& vb) 
    : ValSel<View,int>(home,vb), r(vb.rnd()) {}
  template<class View>
  forceinline
  ValSelRnd<View>::ValSelRnd(Space& home, bool shared, ValSelRnd& vs)
    : ValSel<View,int>(home,shared,vs) {
    r.update(home,shared,vs.r);
  }
  template<class View>
  forceinline int
  ValSelRnd<View>::val(const Space&, View x, int) {
    unsigned int p = r(x.size());
    for (ViewRanges<View> i(x); i(); ++i) {
      if (i.width() > p)
        return i.min() + static_cast<int>(p);
      p -= i.width();
    }
    GECODE_NEVER;
    return 0;
  }
  template<class View>
  forceinline bool
  ValSelRnd<View>::notice(void) const {
    return true;
  }
  template<class View>
  forceinline void
  ValSelRnd<View>::dispose(Space&) {
    r.~Rnd();
  }

  forceinline
  ValSelRangeMin::ValSelRangeMin(Space& home, const ValBranch& vb)
    : ValSel<IntView,int>(home,vb) {}
  forceinline
  ValSelRangeMin::ValSelRangeMin(Space& home, bool shared, ValSelRangeMin& vs)
    : ValSel<IntView,int>(home,shared,vs) {}
  forceinline int
  ValSelRangeMin::val(const Space&, IntView x, int) {
    if (x.range()) {
      return (x.width() == 2) ? x.min() : (x.min() + (x.max()-x.min())/2);
    } else {
      ViewRanges<View> r(x);
      return r.max();
    }
  }

  forceinline
  ValSelRangeMax::ValSelRangeMax(Space& home, const ValBranch& vb)
    : ValSel<IntView,int>(home,vb) {}
  forceinline
  ValSelRangeMax::ValSelRangeMax(Space& home, bool shared, ValSelRangeMax& vs)
    : ValSel<IntView,int>(home,shared,vs) {}
  forceinline int
  ValSelRangeMax::val(const Space&, IntView x, int) {
    if (x.range()) {
      return (x.width() == 2) ? x.max() : (x.max() - (x.max()-x.min())/2);
    } else {
      int min;
      ViewRanges<IntView> r(x);
      do {
        min = r.min(); ++r;
      } while (r());
      return min;
    }
  }

  template<class View, bool min>
  forceinline
  ValSelNearMinMax<View,min>::ValSelNearMinMax(Space& home, 
                                               const ValBranch& vb) 
    : ValSel<View,int>(home,vb), 
      c(static_cast<const IntValBranch&>(vb).values()) {}
  template<class View, bool min>
  forceinline
  ValSelNearMinMax<View,min>::ValSelNearMinMax(Space& home, bool shared, 
                                               ValSelNearMinMax& vs)
    : ValSel<View,int>(home,shared,vs) {
    c.update(home,shared,vs.c);
  }
  template<class View, bool min>
  forceinline int
  ValSelNearMinMax<View,min>::val(const Space&, View x, int i) {
    int n = c[i];
    if (x.max() <= n) return x.max();
    if (x.min() >= n) return x.min();
    if (x.range()) return n;
    ViewRanges<View> r(x);
    int pmax;
    do {
      pmax=r.max(); ++r;
    } while (r.max() < n);
    assert(r());
    if ((pmax >= n) || (r.min() <= n))
      return n;
    assert((pmax < n) && (n < r.min()));
    unsigned int dmin = static_cast<unsigned int>(n - pmax);
    unsigned int dmax = static_cast<unsigned int>(r.min() - n);
    if (dmin == dmax)
      return min ? pmax : r.min();
    else if (dmin < dmax)
      return pmax;
    else
      return r.min();
  }
  template<class View, bool min>
  forceinline bool
  ValSelNearMinMax<View,min>::notice(void) const {
    return true;
  }
  template<class View, bool min>
  forceinline void
  ValSelNearMinMax<View,min>::dispose(Space&) {
    c.~IntSharedArray();
  }

  template<class View, bool inc>
  forceinline
  ValSelNearIncDec<View,inc>::ValSelNearIncDec(Space& home, 
                                               const ValBranch& vb) 
    : ValSel<View,int>(home,vb), 
      c(static_cast<const IntValBranch&>(vb).values()) {}
  template<class View, bool inc>
  forceinline
  ValSelNearIncDec<View,inc>::ValSelNearIncDec(Space& home, bool shared, 
                                               ValSelNearIncDec& vs)
    : ValSel<View,int>(home,shared,vs) {
    c.update(home,shared,vs.c);
  }
  template<class View, bool inc>
  forceinline int
  ValSelNearIncDec<View,inc>::val(const Space&, View x, int i) {
    int n = c[i];
    if (x.max() <= n) return x.max();
    if (x.min() >= n) return x.min();
    if (x.range()) return n;
    if (inc) {
      ViewRanges<View> r(x);
      while (r.max() < n)
        ++r;
      assert(r());
      return (r.min() <= n) ? n : r.min();
    } else {
      ViewRanges<View> r(x);
      int pmax;
      do {
        pmax=r.max(); ++r;
      } while (r.max() < n);
      assert(r());
      return (r.min() <= n) ? n : pmax;
    }
  }
  template<class View, bool inc>
  forceinline bool
  ValSelNearIncDec<View,inc>::notice(void) const {
    return true;
  }
  template<class View, bool inc>
  forceinline void
  ValSelNearIncDec<View,inc>::dispose(Space&) {
    c.~IntSharedArray();
  }

}}}

// STATISTICS: int-branch