Node:3.9 New CLPFD Features, Next:3.9 All-in-one Executables, Previous:3.9 PiLLoW Web Programming Library, Up:Changes Introduced in Version 3.9

New CLPFD Features

Generally, performance has been improved, in terms of CPU time as well as memory. Specific new features:

• labeling/2 takes a new option which supports limited discrepancy search. To support this, the apply_bound/1 API has been replaced by predicates called first_bound/2 and later_bound/2.
• The new constraint knapsack/3 is a domain consistent special case of scalar_product/4.
• The new constraint global_cardinality/2 constrains the number of occurrences of given integers in a list.
• Arbitrary N-ary relations can be defined with the new constraint case/4.
• disjoint/2 takes a new option which tells the constraint to perform stronger reasoning if some rectangles have the same origin and certain other conditions are fulfilled.
• serialized/3 and cumulative/5 take a new option which tells the constraint whether to only adjust domain bounds. This is now the default.
• The precedences/1 option of the same constraints has a more general format.
• The new constraint cumulatives/[2,3] generalizes cumulative/[4,5] by considering multiple resources, positive and negative resource consumption, and lower and upper bounds.