main page modules namespaces classes files
Gecode home

search for 

ranges-array.icc

Go to the documentation of this file.

/*
 *  Main authors:
 *     Christian Schulte <schulte@gecode.org>
 *
 *  Copyright:
 *     Christian Schulte, 2006
 *
 *  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.
 *
 */

namespace Gecode { namespace Iter { namespace Ranges {

  class Array  {
  public:
    class Range {
    public:
      int min; int max;
    };
  protected:
    Range* r;
    int c;
    int n;
  public:


    Array(void);
    Array(Range* r, int n);
    void init(Range* r, int n);



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



    int min(void) const;
    int max(void) const;
    unsigned int width(void) const;
  };


  forceinline
  Array::Array(void) {}

  forceinline
  Array::Array(Range* r0, int n0)
    : r(r0), c(0), n(n0) {}

  forceinline void
  Array::init(Range* r0, int n0) {
    r=r0; c=0; n=n0;
  }

  forceinline void
  Array::operator++(void) {
    c++;
  }
  forceinline bool
  Array::operator()(void) const {
    return c < n;
  }

  forceinline void
  Array::reset(void) {
    c=0;
  }

  forceinline int
  Array::min(void) const {
    return r[c].min;
  }
  forceinline int
  Array::max(void) const {
    return r[c].max;
  }
  forceinline unsigned int
  Array::width(void) const {
    return r[c].max-r[c].min+1;
  }

}}}

// STATISTICS: iter-any