select.cc

Go to the documentation of this file.

/*
 *  Main authors:
 *     Guido Tack <tack@gecode.org>
 *
 *  Copyright:
 *     Guido Tack, 2005
 *
 *  Last modified:
 *     $Date: 2007-11-09 10:29:51 +0100 (Fri, 09 Nov 2007) $ by $Author: tack $
 *     $Revision: 5228 $
 *
 *  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 Selection {


    static IntSet ds_012(0,2);
    static IntSet ds_1012(-1,2);

    // BE CAREFUL with number of variables and domain size
    // current instance ( |ds_012 = {-1#2}| = 4 and |x| = 2 + 2 = 4 ) => 2^16
    // takes at least 5 min to test

    class CpltSetSelectUnion : public CpltSetTest {
    private:
      int selector_pos;
      int union_pos;
      int xsize;
    public:
      // using cache size of 10000 gives fastest time of 0m48s per iteration
      CpltSetSelectUnion(const char* t)
      : CpltSetTest(t, 4, ds_012, false, 0, 100, 10000), xsize(4) {
        union_pos = xsize - 1;
        selector_pos = xsize - 2;
      }
      virtual bool solution(const SetAssignment& x) const {
        int selected = 0;
        // count the number of selected sets
        CountableSetValues count_sel(x.lub, x[selector_pos]);
        for ( ; count_sel(); ++count_sel, selected++);
  
        CountableSetValues xunion(x.lub, x[union_pos]);
        if (selected==0) {
          bool valid = !xunion();
          return valid;
        }

        GECODE_AUTOARRAY(CountableSetRanges, sel, selected);
        CountableSetValues selector(x.lub, x[selector_pos]);
        for (int i=selected; i--;++selector) {
          if (selector.val()>=selector_pos || selector.val()<0) {
            return false;
          }
          sel[i].init(x.lub, x[selector.val()]);
        }
        Iter::Ranges::NaryUnion<CountableSetRanges> u(sel, selected);

        CountableSetRanges z(x.lub, x[union_pos]);
        bool valid = Iter::Ranges::equal(u,z);
        return valid;
      }
      virtual void post(Space* home, CpltSetVarArray& x, IntVarArray&) {
        int vars = selector_pos;
        CpltSetVarArgs xs(vars);
        for (int i=vars; i--;)
          xs[i]=x[i];
        Gecode::selectUnion(home, xs, x[selector_pos], x[union_pos]);
      }
    };
    CpltSetSelectUnion _cpltsetselectUnion("Select::SelectUnion");

    class CpltSetSelectNonEmptySub : public CpltSetTest {
    private:
      int selector_pos;
      int union_pos;
      int xsize;
    public:
      CpltSetSelectNonEmptySub(const char* t)
      : CpltSetTest(t, 4, ds_1012,false, 0, 8000, 15000), xsize(4) {
        union_pos = xsize - 1;
        selector_pos = xsize - 2;   
      }
      virtual bool solution(const SetAssignment& x) const {
        int selected = 0;
        // count the number of selected sets
        CountableSetValues count_sel(x.lub, x[selector_pos]);
        for ( ; count_sel(); ++count_sel, selected++);
 
        CountableSetRanges xunion(x.lub, x[union_pos]);
        if (selected==0) {
          GECODE_AUTOARRAY(CountableSetRanges, sel, selector_pos);
    
          bool valid = true;
          for (int i = selector_pos; i--; ) {
            sel[i].init(x.lub, x[i]);
            CountableSetRanges t(x.lub, x[union_pos]);
            bool non_empty_union = t();
            bool non_empty = sel[i]();
            bool subset = Iter::Ranges::subset(sel[i], t);

            if (!non_empty_union) {
              return true;
            } else {
              valid &= (!non_empty || !subset);
            }
          }
          return valid;
        }
  
        if (!xunion()) {
          return false;
        }
        // some sets have been selected
        GECODE_AUTOARRAY(CountableSetRanges, sel, selected);
  
        CountableSetValues selector(x.lub, x[selector_pos]);
        for (int i=selected; i--;++selector) {
          if (selector.val()>=selector_pos || selector.val()<0) {
            return false;
          }
          sel[i].init(x.lub, x[selector.val()]);
        }

        Iter::Ranges::NaryUnion<CountableSetRanges> u(sel, selected);

        bool select_valid = true;
          CountableSetValues select_val(x.lub, x[selector_pos]);
          for (int i = 0; i < selector_pos; i++) {
            CountableSetRanges cur_sel(x.lub, x[i]);
            bool subset = false;
            bool non_empty = false;
            CountableSetRanges tunion(x.lub, x[union_pos]);
            non_empty = cur_sel();
            subset = Iter::Ranges::subset(cur_sel, tunion);

            if (select_val()) {
              if (i == select_val.val()) {
                select_valid &= (subset && non_empty);
                ++select_val;
              } else {
                select_valid &= (!non_empty || !subset);
              }
            } else {
              select_valid &= (!non_empty || !subset);
            }
          }

        bool valid = select_valid && Iter::Ranges::subset(u, xunion);
        return valid;
      }

      virtual void post(Space* home, CpltSetVarArray& x, IntVarArray&) {
        int vars = selector_pos;
        CpltSetVarArgs xs(vars);
        for (int i=vars; i--;)
          xs[i]=x[i];

        Gecode::selectNonEmptySub(home, xs, x[selector_pos], x[union_pos]);
      }
    };

    // Disabled due to time restrictions
    // We need randomized tests to test large set domains
    // CpltSetSelectNonEmptySub 
    //   _cpltsetselectNonEmptySub("Select::SelectNonEmptySub");


}}}

// STATISTICS: test-cpltset