Generated on Tue May 22 09:40:18 2018 for Gecode by doxygen 1.6.3

product_fd.cpp

Go to the documentation of this file.
00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
00002 /*
00003  *  Main authors:
00004  *     Guido Tack <tack@gecode.org>
00005  *
00006  *  Copyright:
00007  *     Guido Tack, 2014
00008  *
00009  *  This file is part of Gecode, the generic constraint
00010  *  development environment:
00011  *     http://www.gecode.org
00012  *
00013  *  Permission is hereby granted, free of charge, to any person obtaining
00014  *  a copy of this software and associated documentation files (the
00015  *  "Software"), to deal in the Software without restriction, including
00016  *  without limitation the rights to use, copy, modify, merge, publish,
00017  *  distribute, sublicense, and/or sell copies of the Software, and to
00018  *  permit persons to whom the Software is furnished to do so, subject to
00019  *  the following conditions:
00020  *
00021  *  The above copyright notice and this permission notice shall be
00022  *  included in all copies or substantial portions of the Software.
00023  *
00024  *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
00025  *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
00026  *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
00027  *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
00028  *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
00029  *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
00030  *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
00031  *
00032  */
00033 
00034 #include "test/flatzinc.hh"
00035 
00036 namespace Test { namespace FlatZinc {
00037 
00038   namespace {
00040     class Create {
00041     public:
00042 
00044       Create(void) {
00045         (void) new FlatZincTest("product::fd",
00046 "predicate bool_lin_ge(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
00047 predicate bool_lin_gt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
00048 predicate bool_lin_lt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
00049 predicate bool_lin_ne(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
00050 array [1..2] of int: capacity = [200, 400];\n\
00051 array [1..6] of int: consumption = [5, 2, 4, 4, 3, 6];\n\
00052 array [1..3] of int: demand = [100, 200, 300];\n\
00053 array [1..3] of int: insideCost = [60, 80, 30];\n\
00054 array [1..3] of int: outsideCost = [80, 90, 40];\n\
00055 var 0..131000: INT____00001 :: is_defined_var :: var_is_introduced;\n\
00056 array [1..3] of var 0..400: inside :: output_array([1..3]);\n\
00057 array [1..3] of var 0..300: outside :: output_array([1..3]);\n\
00058 constraint int_lin_eq([-1, 60, 80, 30, 80, 90, 40], [INT____00001, inside[1], inside[2], inside[3], outside[1], outside[2], outside[3]], 0) :: defines_var(INT____00001);\n\
00059 constraint int_lin_le([-1, -1], [inside[1], outside[1]], -100);\n\
00060 constraint int_lin_le([-1, -1], [inside[2], outside[2]], -200);\n\
00061 constraint int_lin_le([-1, -1], [inside[3], outside[3]], -300);\n\
00062 constraint int_lin_le([2, 4, 6], [inside[1], inside[2], inside[3]], 400);\n\
00063 constraint int_lin_le([5, 4, 3], [inside[1], inside[2], inside[3]], 200);\n\
00064 solve minimize INT____00001;\n\
00065 ", "inside = array1d(1..3, [40, 0, 0]);\n\
00066 outside = array1d(1..3, [60, 200, 300]);\n\
00067 ----------\n\
00068 ==========\n\
00069 ");
00070       }
00071     };
00072 
00073     Create c;
00074   }
00075 
00076 }}
00077 
00078 // STATISTICS: test-flatzinc