Lines Matching defs:of
4 % The contents of this file are subject to the Cisco-style Mozilla Public
6 % in compliance with the License. You may obtain a copy of the License
15 % The Initial Developer of the Original Code is Cisco Systems, Inc.
37 of finite sets of integers.
40 collection of item where no specific distinction is made and thus
45 \section{Finite Sets of Integers}
48 In the context of the {\em ic_sets} library, (ground) integer sets are
49 simply sorted, duplicate-free lists of integers e.g.
55 are not sets in the sense of this library.
66 of elements that are definitely in the set) and an upper bound (the
67 set of elements that may be in the set). A set variable can be
76 If the lower bound is the empty set and the upper bound is a set of
89 Sets is a list of N sets containing numbers between Min and Max
99 The curly brackets contain the description of the current domain
100 of the set variable in the form of
102 \item the lower bound of the set (values which definitely are in the set)
104 \item the set of optional values (which may or may not be in the set)
124 \index{in/2@\texttt{in/2}!ic_sets} The integer X is member of the integer set Set
126 \index{notin/2@\texttt{notin/2}!ic_sets} The integer X is not a member of the integer set Set
128 % BoolArr is an array of booleans describing Set
130 \index{\#/2@\texttt{\#/2}!ic_sets} Card is the cardinality of the integer set Set
171 \index{includes/2@\texttt{includes/2}!ic_sets} Set1 includes (is a superset) of the integer set Set2
173 \index{subset/2@\texttt{subset/2}!ic_sets} Set1 is a (non-strict) subset of the integer set Set2
175 \index{intersection/3@\texttt{intersection/3}!ic_sets} Set3 is the intersection of the integer sets Set1 and Set2
177 \index{union/3@\texttt{union/3}!ic_sets} Set3 is the union of the integer sets Set1 and Set2
179 Set3 is the difference of the integer sets Set1 and Set2
181 \index{symdiff/3@\texttt{symdiff/3}!ic_sets} Set3 is the symmetric difference of the integer sets Set1 and Set2
198 the {\em ic_sets} module prefix because of a name conflict with a predicate from
199 the {\em lists} library of the same name.}
200 \Note{Note the lack of a complement constraint: this is because the complement
201 of a finite set is infinite and cannot be represented. Complements can be
209 List is the list of elements of whose membership in Set is currently uncertain
215 Finally, there are a number of n-ary constraints that apply to lists of sets:
220 Sets is a list of integers sets which are all disjoint
222 SetUnion is the union of all the sets in the list Sets
224 SetIntersection is the intersection of all the sets in the list Sets
262 predicate can be used to enumerate all ground instantiations of a set
266 Here is an example of the default enumeration strategy:
294 The problem is to compute triplets of numbers between 1 and N,
301 NB is N * (N-1) // 6, % compute number of triplets
309 C #=< 1 % of pairwise intersections
338 It allows the association of weights to set elements, and can help when
339 solving problems of the knapsack or bin packing type.
340 The constraint takes a set and an array of element weights and
341 constrains the weight of the whole set:
368 (in terms of greatest weight) straight away:
384 According to the array of element weights, the weight of set Set1 is Weight
402 Write a predicate which, given a list of sizes of items and a list of
403 capacities of buckets, returns a list of (ground) sets indicating which
407 Try it out with 5 items of sizes 20, 34, 9, 12 and 19, into 3 buckets of