main page modules namespaces classes files
Gecode home

search for 

ranges-scale.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:50 +0200 (Fri, 04 Aug 2006) $ by $Author: schulte $
 *     $Revision: 3515 $
 *
 *  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.
 *
 */

#include <cmath>

namespace Gecode { namespace Iter { namespace Ranges {

  template <class Val, class UnsVal, class I>
  class ScaleUp {
  protected:
    I i;
    int a;
    Val cur;
    Val end;
  public:


    ScaleUp(void);
    ScaleUp(I& i, int a);
    void init(I& i, int a);



    bool operator()(void) const;
    void operator++(void);



    Val min(void) const;
    Val max(void) const;
    UnsVal width(void) const;
  };

  template <class I>
  class ScaleDown : public MinMax {
  protected:
    I i;
    int a;
  public:


    ScaleDown(void);
    ScaleDown(I& i, int a);
    void init(I& i, int a);



    void operator++(void);
  };



  template <class Val, class UnsVal, class I>
  forceinline
  ScaleUp<Val,UnsVal,I>::ScaleUp(void) {}

  template <class Val, class UnsVal, class I>
  inline void
  ScaleUp<Val,UnsVal,I>::init(I& i0, int a0) {
    i = i0; a = a0;
    if (i()) {
      cur = a * i.min();
      end = a * i.max();
    } else {
      cur = 1;
      end = 0;
    }
  }

  template <class Val, class UnsVal, class I>
  inline
  ScaleUp<Val,UnsVal,I>::ScaleUp(I& i0, int a0) : i(i0), a(a0) {
    if (i()) {
      cur = a * i.min();
      end = a * i.max();
    } else {
      cur = 1;
      end = 0;
    }
  }

  template <class Val, class UnsVal, class I>
  forceinline void
  ScaleUp<Val,UnsVal,I>::operator++(void) {
    if (a == 1) {
      ++i;
    } else {
      cur += a;
      if (cur > end) {
        ++i;
        if (i()) {
          cur = a * i.min();
          end = a * i.max();
        }
      }
    }
  }
  template <class Val, class UnsVal, class I>
  forceinline bool
  ScaleUp<Val,UnsVal,I>::operator()(void) const {
    return (a == 1) ? i() : (cur <= end);
  }

  template <class Val, class UnsVal, class I>
  forceinline Val
  ScaleUp<Val,UnsVal,I>::min(void) const {
    return (a == 1) ? static_cast<Val>(i.min()) : cur;
  }
  template <class Val, class UnsVal, class I>
  forceinline Val
  ScaleUp<Val,UnsVal,I>::max(void) const {
    return (a == 1) ? static_cast<Val>(i.max()) : cur;
  }
  template <class Val, class UnsVal, class I>
  forceinline UnsVal
  ScaleUp<Val,UnsVal,I>::width(void) const {
    return (a == 1) ?
      static_cast<UnsVal>(i.width()) :
      static_cast<UnsVal>(max - min + 1);
  }



  template <class I>
  forceinline void
  ScaleDown<I>::operator++(void) {
    finish();
    while ((mi > ma) && i()) {
      mi = static_cast<int>(ceil(static_cast<double>(i.min())/a));
      ma = static_cast<int>(floor(static_cast<double>(i.max())/a));
      ++i;
    }
    while (i()) {
      int n_mi = static_cast<int>(ceil(static_cast<double>(i.min())/a));
      if (n_mi-ma > 1)
        break;
      int n_ma = static_cast<int>(floor(static_cast<double>(i.max())/a));
      if (n_mi <= n_ma) {
        ma = n_ma;
      }
      ++i;
    }
  }

  template <class I>
  forceinline
  ScaleDown<I>::ScaleDown(void) {}

  template <class I>
  inline void
  ScaleDown<I>::init(I& i0, int a0) {
    i = i0; a = a0;
    operator++();
  }

  template <class I>
  inline
  ScaleDown<I>::ScaleDown(I& i0, int a0) : i(i0), a(a0) {
    i = i0; a = a0;
    operator++();
  }

}}}

// STATISTICS: iter-any