this repo has no description
at develop 2.0 kB view raw
1% 2% Main authors: 3% Guido Tack <tack@gecode.org> 4% 5% Copyright: 6% Guido Tack, 2007 7% 8% This file is part of Gecode, the generic constraint 9% development environment: 10% http://www.gecode.org 11% 12% Permission is hereby granted, free of charge, to any person obtaining 13% a copy of this software and associated documentation files (the 14% "Software"), to deal in the Software without restriction, including 15% without limitation the rights to use, copy, modify, merge, publish, 16% distribute, sublicense, and/or sell copies of the Software, and to 17% permit persons to whom the Software is furnished to do so, subject to 18% the following conditions: 19% 20% The above copyright notice and this permission notice shall be 21% included in all copies or substantial portions of the Software. 22% 23% THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 24% EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 25% MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 26% NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 27% LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 28% OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 29% WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 30% 31% 32 33predicate gecode_int_set_channel(array[int] of var int: x, int: xoff, 34 array[int] of var set of int: y, int: yoff); 35 36predicate fzn_int_set_channel(array[int] of var int: x, 37 array[int] of var set of int: y) = 38 if (length(x)=0 \/ length(y)=0 \/ min(index_set(x)) < 0 \/ min(index_set(y)) < 0) then 39 forall(i in index_set(x)) (x[i] in index_set(y)) /\ 40 forall(j in index_set(y)) (y[j] subset index_set(x)) /\ 41 forall(i in index_set(x), j in index_set(y)) 42 (x[i]=j <-> i in y[j]) 43 else 44 gecode_int_set_channel(x,min(index_set(x)),y,min(index_set(y))) 45 endif;