Package org.chocosolver.solver.constraints.nary.nValue

Class Summary

Class	Description
PropAMNV	Propagator for the atMostNValues constraint The number of distinct values in the set of variables vars is at most equal to nValues
PropAtLeastNValues	Propagator for the atMostNValues constraint The number of distinct values in the set of variables vars is at most equal to nValues No level of consistency but better than BC in general (for enumerated domains with holes)
PropAtLeastNValues_AC	AtLeastNValues Propagator (similar to SoftAllDiff) The number of distinct values in vars is at least nValues Performs Generalized Arc Consistency based on Maximum Bipartite Matching The worst case time complexity is O(nm) but this is very pessimistic In practice it is more like O(m) where m is the number of variable-value pairs BEWARE UNSAFE : BUG DETECTED THROUGH DOBBLE(3,4,6) !redundant propagator!
PropAtMostNValues	Propagator for the atMostNValues constraint The number of distinct values in the set of variables vars is at most equal to nValues No level of consistency but better than BC in general (for enumerated domains with holes)
PropAtMostNValues_BC	Propagator for the atMostNValues constraint The number of distinct values in the set of variables vars is at most equal to nValues Performs Bound Consistency in O(n+d) with n = |vars| d = maxValue - minValue (from initial domains) => very appropriate when d <= n It is indeed much better than the usual time complexity of O(n.log(n)) => not appropriate when d >> n (you should encode another data structure and a quick sort algorithm) !redundant propagator!