cardinality.cc

Go to the documentation of this file.

/*
 *  Main authors:
 *     Guido Tack <tack@gecode.org>
 *
 *  Copyright:
 *     Guido Tack, 2005
 *
 *  Last modified:
 *     $Date: 2008-02-06 18:48:22 +0100 (Wed, 06 Feb 2008) $ by $Author: schulte $
 *     $Revision: 6102 $
 *
 *  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.
 *
 */

#include "test/cpltset.hh"

using namespace Gecode;
using namespace Test::Set;

namespace Test { namespace CpltSet {

  namespace Cardinality {


    static const int d1r[4][2] = {
      {-4,-3},{-1,-1},{1,1},{3,5}
    };
    static IntSet d1(d1r,4);

    static IntSet ds_33(-3,3);
    static IntSet ds_4(4,4);
    static IntSet ds_13(1,3);

    class CpltSetCardMinMax : public CpltSetTest {
    public:
      CpltSetCardMinMax(const char* t) : CpltSetTest(t,1,d1,false) {}
      virtual bool solution(const SetAssignment& x) const {
        CountableSetRanges xr1(x.lub, x[0]);

        int c = 0;
        while (xr1()) {
          c += xr1.width();
          ++xr1;
        }
        return (0<= c && c <= 3);
      }

      virtual void post(Space* home, CpltSetVarArray& x, IntVarArray&) {
        Gecode::cardinality(home, x[0], 0, 3);
      }
    };
    CpltSetCardMinMax _cpltsetcardminmax("Card::MinMax");

    class CpltSetCardEq : public CpltSetTest {
    public:
      CpltSetCardEq(const char* t) : CpltSetTest(t,1,d1,false) {}
      virtual bool solution(const SetAssignment& x) const {
        CountableSetRanges xr1(x.lub, x[0]);
    
        int c = 0;
        while (xr1()) {
          c += xr1.width();
          ++xr1;
        }
        return (c == 3);
      }

      virtual void post(Space* home, CpltSetVarArray& x, IntVarArray&) {
        Gecode::cardinality(home, x[0], 3, 3);
      }
    };
    CpltSetCardEq _cpltsetcardeq("Card::Eq");

    class CpltSetCardMinInf : public CpltSetTest {
    public:
      CpltSetCardMinInf(const char* t) : CpltSetTest(t,1,d1,false) {}
      virtual bool solution(const SetAssignment& x) const {
        CountableSetRanges xr1(x.lub, x[0]);
    
        int c = 0;
        while (xr1()) {
          c += xr1.width();
          ++xr1;
        }
        return (c >= 1);
      }

      virtual void post(Space* home, CpltSetVarArray& x, IntVarArray&) {
        Gecode::cardinality(home, x[0], 1, Gecode::Set::Limits::max);
      }
    };
    CpltSetCardMinInf _cpltsetcardmininf("Card::MinInf");


}}}

// STATISTICS: test-cpltset