/*
 *  Main authors:
 *     Guido Tack <tack@gecode.org>
 *
 *  Copyright:
 *     Guido Tack, 2005
 *
 *  Last modified:
 *     $Date: 2006-08-04 16:07:12 +0200 (Fri, 04 Aug 2006) $ by $Author: schulte $
 *     $Revision: 3518 $
 *
 *  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 "test/set.hh"

static IntSet ds_33(-4,4);

class Convex : public SetTest {
public:
  Convex(const char* t)
    : SetTest(t,1,ds_33,false) {}
  virtual bool solution(const SetAssignment& x) const {
    CountableSetRanges xr0(x.lub, x[0]);
    if (!xr0())
      return true;
    ++xr0;
    if (!xr0())
      return true;
    return false;
  }
  virtual void post(Space* home, SetVarArray& x, IntVarArray&) {
    Gecode::convex(home, x[0]);
  }
};
Convex _convex("Convex::Convex");

class ConvexHull : public SetTest {
public:
  ConvexHull(const char* t)
    : SetTest(t,2,ds_33,false) {}
  virtual bool solution(const SetAssignment& x) const {
    CountableSetRanges xr0(x.lub, x[0]);
    CountableSetRanges xr1(x.lub, x[1]);

    if (!xr0())
      return !xr1();

    int x0min = xr0.min();
    int x0max = xr0.max();
    ++xr0;
    if (!xr0()) {
      if (!xr1()) return false;
      if (x0min != xr1.min()) return false;
      int x1max = Limits::Set::int_min;
      while (xr1()) { x1max = xr1.max(); ++xr1;}
      if (x0max != x1max) return false;
      return true;
    }
    return false;
  }
  virtual void post(Space* home, SetVarArray& x, IntVarArray&) {
    Gecode::convexHull(home, x[1], x[0]);
  }
};
ConvexHull _convexhull("Convex::ConvexHull");

class ConvexHullS : public SetTest {
public:
  ConvexHullS(const char* t)
    : SetTest(t,1,ds_33,false) {}
  virtual bool solution(const SetAssignment& x) const {
    CountableSetRanges xr0(x.lub, x[0]);
    if (!xr0())
      return true;
    ++xr0;
    if (!xr0())
      return true;
    return false;
  }
  virtual void post(Space* home, SetVarArray& x, IntVarArray&) {
    Gecode::convexHull(home, x[0], x[0]);
  }
};
ConvexHullS _convexhulls("Convex::Sharing::ConvexHullS");

// STATISTICS: test-set