rel.cc

Go to the documentation of this file.

/*
 *  Main authors:
 *     Guido Tack <tack@gecode.org>
 *
 *  Copyright:
 *     Guido Tack, 2005
 *
 *  Last modified:
 *     $Date: 2007-09-13 21:30:38 +0200 (Thu, 13 Sep 2007) $ by $Author: tack $
 *     $Revision: 5029 $
 *
 *  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 Rel {


    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 CpltSetRelLe : public CpltSetTest {
    public:
      CpltSetRelLe(const char* t) : CpltSetTest(t,2,ds_13,false) {}

      virtual bool solution(const SetAssignment& x) const {
        CountableSetValues xr1(x.lub, x[0]);
        CountableSetValues xr2(x.lub, x[1]);
        // in lex-bit order empty is the smallest
        int a = (iter2int(xr1, 3));
        int b = (iter2int(xr2, 3));
        return a < b;
      }
      virtual void post(Space* home, CpltSetVarArray& x, IntVarArray&) {
        // Test lex-bit order
        Gecode::rel(home, x[0], SRT_LE, x[1]);
      }
    };
    CpltSetRelLe _cpltsetrelle("Rel::Le");

    class CpltSetRelLq : public CpltSetTest {
    public:
      CpltSetRelLq(const char* t) : CpltSetTest(t,2,ds_13,false) {}

      virtual bool solution(const SetAssignment& x) const {
        CountableSetValues xr1(x.lub, x[0]);
        CountableSetValues xr2(x.lub, x[1]);
        // in lex-bit order empty is the smallest
        int a = (iter2int(xr1, 3));
        int b = (iter2int(xr2, 3));
        return a <= b;
      }
      virtual void post(Space* home, CpltSetVarArray& x, IntVarArray&) {
        // Test lex-bit order
        Gecode::rel(home, x[0], SRT_LQ, x[1]);
      }
    };
    CpltSetRelLq _cpltsetrellq("Rel::Lq");

    class CpltSetRelLeDiff : public CpltSetTest {
    public:
      CpltSetRelLeDiff(const char* t) : CpltSetTest(t,2,ds_33,false) {}
      virtual bool solution(const SetAssignment& x) const {
        CountableSetValues xr1(x.lub, x[0]);
        CountableSetValues xr2(x.lub, x[1]);
        // in lex-bit order empty is the smallest
        int a = (iter2int(xr1,3));
        int b = (iter2int(xr2,3));
        return a < b;
      }
      virtual void post(Space* home, CpltSetVarArray& x, IntVarArray&) {
        // Test lex-bit order
        Gecode::dom(home, x[0], SRT_DISJ, ds_13);
        Gecode::dom(home, x[1], SRT_SUB, ds_13);
        Gecode::rel(home, x[0], SRT_LE, x[1]);
      }
    };
    CpltSetRelLe _cpltsetrellediff("Rel::Le::Diff");

    class CpltSetRelDisj : public CpltSetTest {
    public:
      CpltSetRelDisj(const char* t) : CpltSetTest(t,2,ds_13,false) {}

      virtual bool solution(const SetAssignment& x) const {
        CountableSetRanges xr1(x.lub, x[0]);
        CountableSetRanges xr2(x.lub, x[1]);
        Gecode::Iter::Ranges::Inter<CountableSetRanges, CountableSetRanges> 
          inter(xr1, xr2);
        return !inter();
      }
      virtual void post(Space* home, CpltSetVarArray& x, IntVarArray&) {
        // Test lex-bit order
        Gecode::rel(home, x[0], SRT_DISJ, x[1]);
      }
    };
    CpltSetRelDisj _cpltsetreldisj("Rel::Disj");


}}}

// STATISTICS: test-cpltset