this repo has no description
dekker.one
1%-----------------------------------------------------------------------------%
2% Requires that for all 'i', the value 'cover[i]' appears at least 'lbound[i]'
3% and at most 'ubound[i]' times in the array 'x'.
4%-----------------------------------------------------------------------------%
5
6predicate global_cardinality_low_up(array[int] of var int: x,
7 array[int] of int: cover,
8 array[int] of int: lbound,
9 array[int] of int: ubound) =
10 g12fd_global_cardinality_open(x, cover, lbound, ubound);
11
12%-----------------------------------------------------------------------------%
13
14% The implementation in the G12/FD solver. This should not be called directly;
15% instead the definition above should be used.
16
17predicate g12fd_global_cardinality_open(array[int] of var int: x,
18 array[int] of int: cover,
19 array[int] of int: lbound,
20 array[int] of int: ubound);
21
22%-----------------------------------------------------------------------------%
23%-----------------------------------------------------------------------------%