Generated on Thu Apr 11 13:59:21 2019 for Gecode by doxygen 1.6.3

golomb.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("golomb",
00046 "predicate all_different_int(array [int] of var int: x);\n\
00047 predicate all_equal_int(array [int] of var int: x);\n\
00048 predicate among(var int: n, array [int] of var int: x, set of int: v);\n\
00049 predicate array_bool_lq(array [int] of var bool: x, array [int] of var bool: y);\n\
00050 predicate array_bool_lt(array [int] of var bool: x, array [int] of var bool: y);\n\
00051 predicate array_int_lq(array [int] of var int: x, array [int] of var int: y);\n\
00052 predicate array_int_lt(array [int] of var int: x, array [int] of var int: y);\n\
00053 predicate array_set_partition(array [int] of var set of int: S, set of int: universe);\n\
00054 predicate at_least_int(int: n, array [int] of var int: x, int: v);\n\
00055 predicate at_most_int(int: n, array [int] of var int: x, int: v);\n\
00056 predicate bool_lin_ge(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
00057 predicate bool_lin_gt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
00058 predicate bool_lin_lt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
00059 predicate bool_lin_ne(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
00060 predicate count(array [int] of var int: x, var int: y, var int: c);\n\
00061 predicate count_reif(array [int] of var int: x, var int: y, var int: c, var bool: b);\n\
00062 predicate cumulatives(array [int] of var int: s, array [int] of var int: d, array [int] of var int: r, var int: b);\n\
00063 predicate decreasing_bool(array [int] of var bool: x);\n\
00064 predicate decreasing_int(array [int] of var int: x);\n\
00065 predicate disjoint(var set of int: s1, var set of int: s2);\n\
00066 predicate gecode_array_set_element_union(var set of int: x, array [int] of var set of int: y, var set of int: z);\n\
00067 predicate gecode_bin_packing_load(array [int] of var int: l, array [int] of var int: bin, array [int] of int: w, int: minIndex);\n\
00068 predicate gecode_circuit(int: offset, array [int] of var int: x);\n\
00069 predicate gecode_int_set_channel(array [int] of var int: x, int: xoff, array [int] of var set of int: y, int: yoff);\n\
00070 predicate gecode_inverse_set(array [int] of var set of int: f, array [int] of var set of int: invf, int: xoff, int: yoff);\n\
00071 predicate gecode_link_set_to_booleans(var set of int: s, array [int] of var bool: b, int: idx);\n\
00072 predicate gecode_member_bool_reif(array [int] of var bool: x, var bool: y, var bool: b);\n\
00073 predicate gecode_member_int_reif(array [int] of var int: x, var int: y, var bool: b);\n\
00074 predicate gecode_nooverlap(array [int] of var int: x, array [int] of var int: w, array [int] of var int: y, array [int] of var int: h);\n\
00075 predicate gecode_precede(array [int] of var int: x, int: s, int: t);\n\
00076 predicate gecode_precede_set(array [int] of var set of int: x, int: s, int: t);\n\
00077 predicate gecode_range(array [int] of var int: x, int: xoff, var set of int: s, var set of int: t);\n\
00078 predicate gecode_set_weights(array [int] of int: csi, array [int] of int: cs, var set of int: x, var int: y);\n\
00079 predicate global_cardinality(array [int] of var int: x, array [int] of int: cover, array [int] of var int: counts);\n\
00080 predicate global_cardinality_closed(array [int] of var int: x, array [int] of int: cover, array [int] of var int: counts);\n\
00081 predicate global_cardinality_low_up(array [int] of var int: x, array [int] of int: cover, array [int] of int: lbound, array [int] of int: ubound);\n\
00082 predicate global_cardinality_low_up_closed(array [int] of var int: x, array [int] of int: cover, array [int] of int: lbound, array [int] of int: ubound);\n\
00083 predicate increasing_bool(array [int] of var bool: x);\n\
00084 predicate increasing_int(array [int] of var int: x);\n\
00085 predicate inverse_offsets(array [int] of var int: f, int: foff, array [int] of var int: invf, int: invfoff);\n\
00086 predicate maximum_int(var int: m, array [int] of var int: x);\n\
00087 predicate member_bool(array [int] of var bool: x, var bool: y);\n\
00088 predicate member_int(array [int] of var int: x, var int: y);\n\
00089 predicate minimum_int(var int: m, array [int] of var int: x);\n\
00090 predicate nvalue(var int: n, array [int] of var int: x);\n\
00091 predicate regular(array [int] of var int: x, int: Q, int: S, array [int, int] of int: d, int: q0, set of int: F);\n\
00092 predicate sort(array [int] of var int: x, array [int] of var int: y);\n\
00093 predicate table_bool(array [int] of var bool: x, array [int, int] of bool: t);\n\
00094 predicate table_int(array [int] of var int: x, array [int, int] of int: t);\n\
00095 var 0..15: INT____00001 :: is_defined_var :: var_is_introduced;\n\
00096 var 0..16: INT____00002 :: is_defined_var :: var_is_introduced;\n\
00097 var 0..16: INT____00003 :: is_defined_var :: var_is_introduced;\n\
00098 var 0..16: INT____00004 :: is_defined_var :: var_is_introduced;\n\
00099 var 0..16: INT____00005 :: is_defined_var :: var_is_introduced;\n\
00100 var 1..16: INT____00006 :: is_defined_var :: var_is_introduced;\n\
00101 array [1..6] of var 0..16: differences = [INT____00001, INT____00002, INT____00003, INT____00004, INT____00005, INT____00006];\n\
00102 array [1..4] of var 0..16: mark :: output_array([1..4]);\n\
00103 constraint all_different_int(differences);\n\
00104 constraint int_eq(mark[1], 0);\n\
00105 constraint int_lin_eq([-1, -1, 1], [INT____00001, mark[1], mark[2]], 0) :: defines_var(INT____00001);\n\
00106 constraint int_lin_eq([-1, -1, 1], [INT____00002, mark[1], mark[3]], 0) :: defines_var(INT____00002);\n\
00107 constraint int_lin_eq([-1, -1, 1], [INT____00003, mark[1], mark[4]], 0) :: defines_var(INT____00003);\n\
00108 constraint int_lin_eq([-1, -1, 1], [INT____00004, mark[2], mark[3]], 0) :: defines_var(INT____00004);\n\
00109 constraint int_lin_eq([-1, -1, 1], [INT____00005, mark[2], mark[4]], 0) :: defines_var(INT____00005);\n\
00110 constraint int_lin_eq([-1, -1, 1], [INT____00006, mark[3], mark[4]], 0) :: defines_var(INT____00006);\n\
00111 constraint int_lt(INT____00001, INT____00006);\n\
00112 constraint int_lt(mark[1], mark[2]);\n\
00113 constraint int_lt(mark[2], mark[3]);\n\
00114 constraint int_lt(mark[3], mark[4]);\n\
00115 solve  :: int_search(mark, input_order, indomain, complete) minimize mark[4];\n\
00116 ", "mark = array1d(1..4, [0, 1, 4, 6]);\n\
00117 ----------\n\
00118 ==========\n\
00119 ");
00120       }
00121     };
00122 
00123     Create c;
00124   }
00125 
00126 }}
00127 
00128 // STATISTICS: test-flatzinc