dep-selector-libgecode 1.0.0.alpha.0

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/flatzinc/mznlib/count.mzn

@@ -0,0 +1,37 @@
+%
+%  Main authors:
+%     Guido Tack <tack@gecode.org>
+%
+%  Copyright:
+%     Guido Tack, 2007
+%
+%  Last modified:
+%     $Date: 2009-09-09 01:42:03 +1000 (Wed, 09 Sep 2009) $ by $Author: schulte $
+%     $Revision: 9689 $
+%
+%  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.
+%
+%
+
+predicate count(array[int] of var int: x, var int: y, var int: c);

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/flatzinc/mznlib/cumulative.mzn

@@ -0,0 +1,53 @@
+%
+%  Main authors:
+%     Guido Tack <tack@gecode.org>
+%     Mikael lagerkvist <lagerkvist@gecode.org>
+%
+%  Copyright:
+%     Guido Tack, 2007
+%     Mikael Lagerkvist, 2009
+%
+%  Last modified:
+%     $Date: 2011-03-08 19:54:48 +1100 (Tue, 08 Mar 2011) $ by $Author: tack $
+%     $Revision: 11787 $
+%
+%  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.
+%
+%
+
+predicate cumulative(array[int] of var int: s,
+                     array[int] of var int: d,
+                     array[int] of var int: r, var int: b) =              
+    assert(index_set(s) == index_set(d) /\ index_set(s) == index_set(r),
+        "cumulative: the 3 array arguments must have identical index sets",
+        assert(lb_array(d) >= 0 /\ lb_array(r) >= 0,
+            "cumulative: durations and resource usages must be non-negative",
+             cumulatives(s, d, r, b)
+        )
+    );
+
+% Specialized cumulatives propagator is only for fixed bounds
+predicate cumulatives(array[int] of var int: s,
+                      array[int] of var int: d,
+                      array[int] of var int: r, var int: b);

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/flatzinc/mznlib/decreasing_bool.mzn

@@ -0,0 +1,37 @@
+%
+%  Main authors:
+%     Guido Tack <tack@gecode.org>
+%
+%  Copyright:
+%     Guido Tack, 2007
+%
+%  Last modified:
+%     $Date: 2011-05-19 04:08:39 +1000 (Thu, 19 May 2011) $ by $Author: tack $
+%     $Revision: 12007 $
+%
+%  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.
+%
+%
+
+predicate decreasing_bool(array[int] of var bool: x);

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/flatzinc/mznlib/decreasing_int.mzn

@@ -0,0 +1,37 @@
+%
+%  Main authors:
+%     Guido Tack <tack@gecode.org>
+%
+%  Copyright:
+%     Guido Tack, 2007
+%
+%  Last modified:
+%     $Date: 2010-03-31 19:18:34 +1100 (Wed, 31 Mar 2010) $ by $Author: tack $
+%     $Revision: 10618 $
+%
+%  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.
+%
+%
+
+predicate decreasing_int(array[int] of var int: x);

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/flatzinc/mznlib/diffn.mzn

@@ -0,0 +1,44 @@
+%
+%  Main authors:
+%     Guido Tack <tack@gecode.org>
+%
+%  Copyright:
+%     Guido Tack, 2007
+%
+%  Last modified:
+%     $Date: 2011-06-04 01:27:50 +1000 (Sat, 04 Jun 2011) $ by $Author: tack $
+%     $Revision: 12041 $
+%
+%  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.
+%
+%
+
+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);
+
+predicate diffn(array[int] of var int: x,
+                array[int] of var int: y,
+                array[int] of var int: dx,
+                array[int] of var int: dy) =
+    gecode_nooverlap(x,dx,y,dy);

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/flatzinc/mznlib/disjoint.mzn

@@ -0,0 +1,37 @@
+%
+%  Main authors:
+%     Guido Tack <tack@gecode.org>
+%
+%  Copyright:
+%     Guido Tack, 2007
+%
+%  Last modified:
+%     $Date: 2009-09-09 01:42:03 +1000 (Wed, 09 Sep 2009) $ by $Author: schulte $
+%     $Revision: 9689 $
+%
+%  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.
+%
+%
+
+predicate disjoint(var set of int: s1, var set of int: s2);

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/flatzinc/mznlib/distribute.mzn

@@ -0,0 +1,46 @@
+%
+%  Main authors:
+%     Guido Tack <tack@gecode.org>
+%
+%  Copyright:
+%     Guido Tack, 2007
+%
+%  Last modified:
+%     $Date: 2011-05-19 04:08:39 +1000 (Thu, 19 May 2011) $ by $Author: tack $
+%     $Revision: 12007 $
+%
+%  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.
+%
+%
+
+predicate distribute(array[int] of var int: card,
+                     array[int] of var int: value,
+                     array[int] of var int: base) =
+    assert(index_set(card) == index_set(value),
+        "distribute: card and value arrays must have identical index sets",
+        forall (i in index_set(card)) (
+            bool_sum_eq([value[i] == base[j] | j in index_set(base)],
+                        card[i])
+        )
+    );

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/flatzinc/mznlib/exactly_int.mzn

@@ -0,0 +1,40 @@
+%
+%  Main authors:
+%     Guido Tack <tack@gecode.org>
+%
+%  Copyright:
+%     Guido Tack, 2007
+%
+%  Last modified:
+%     $Date: 2009-09-09 01:42:03 +1000 (Wed, 09 Sep 2009) $ by $Author: schulte $
+%     $Revision: 9689 $
+%
+%  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 "count.mzn";
+
+predicate exactly_int(int: n, array[int] of var int: x, int: v) =
+    count(x, v, n);

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/flatzinc/mznlib/exactly_set.mzn

@@ -0,0 +1,38 @@
+%
+%  Main authors:
+%     Guido Tack <tack@gecode.org>
+%
+%  Copyright:
+%     Guido Tack, 2007
+%
+%  Last modified:
+%     $Date: 2009-09-09 01:42:03 +1000 (Wed, 09 Sep 2009) $ by $Author: schulte $
+%     $Revision: 9689 $
+%
+%  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.
+%
+%
+
+predicate exactly_set(int: n, array[int] of var set of int: x, set of int: v) =
+    bool_sum_eq([x[i] == v | i in index_set(x)], n);

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/flatzinc/mznlib/gecode.mzn

@@ -0,0 +1,98 @@
+%
+%  Main authors:
+%     Guido Tack <tack@gecode.org>
+%
+%  Copyright:
+%     Guido Tack, 2007
+%
+%  Last modified:
+%     $Date: 2012-03-21 16:25:08 +1100 (Wed, 21 Mar 2012) $ by $Author: tack $
+%     $Revision: 12605 $
+%
+%  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.
+%
+%
+
+% This file contains predicate definitions for additional constraints available
+% in the Gecode FlatZinc interpreter.
+
+% Additional search annotations
+annotation afc_min;
+annotation size_afc_min;
+annotation afc_max;
+annotation size_afc_max;
+annotation int_assign(array[int] of var int: x, ann:a);
+
+
+% i in z <-> forall (j in x) (i in y[j])
+predicate gecode_array_set_element_intersect(var set of int: x,
+    array[int] of var set of int: y, var set of int: z);
+
+% (i in z <-> exists (j in x) (i in y[j])) /\ (i in x /\ j in x /\ i!=j -> disjoint(y[i],y[j]))
+predicate gecode_array_set_element_partition(var set of int: x,
+    array[int] of var set of int: y, var set of int: z);
+
+% z subset u /\ ( i in z <-> forall (j in x) (i in y[j]) )
+predicate gecode_array_set_element_intersect_in(var set of int: x,
+    array[int] of var set of int: y,
+    var set of int: z, set of int: u);
+
+% y = sum of the weights of the elements of x
+predicate gecode_set_weights(array[int] of int: elements,
+    array[int] of int: weights, var set of int: x, var int: y);
+
+% Every subsequence of x of length l has at least m and at most occurrences
+% of the values in S
+predicate gecode_among_seq_int(array[int] of var int: x, set of int: S,
+    int: l, int: m, int: n);
+
+% Every subsequence of x of length l has at least m and at most occurrences
+% of the value b
+predicate gecode_among_seq_bool(array[int] of var bool: x, bool: b,
+    int: l, int: m, int: n);
+
+% Overloading for among_seq
+predicate among_seq(array[int] of var int: x, set of int: S,
+    int: l, int: m, int: n) = among_seq_int(x,S,l,m,n);
+predicate among_seq(array[int] of var bool: x, bool: b,
+    int: l, int: m, int: n) = among_seq_bool(x,b,l,m,n);
+
+% Circuit constraints
+predicate gecode_circuit_cost_array(array[int] of int: c,
+    array[int] of var int: x, array[int] of var int: y, var int: z);
+predicate gecode_circuit_cost(array[int] of int: c, array[int] of var int: x,
+    var int: z);
+
+predicate circuit_cost_array(array[int] of int: c,
+    array[int] of var int: x, array[int] of var int: y, var int: z) =
+  gecode_circuit_cost_array(c,[x[i]-min(index_set(x)) | i in index_set(x)],
+                            y,z);
+predicate circuit_cost(array[int] of int: c, array[int] of var int: x,
+    var int: z) =
+  gecode_circuit_cost(c, [x[i]-min(index_set(x)) | i in index_set(x)], z);
+
+% Scheduling constraints
+predicate gecode_schedule_unary(array[int] of var int: x, array[int] of int: p);
+predicate gecode_schedule_unary_optional(array[int] of var int: x,
+    array[int] of int: p, array[int] of var bool: m);