Maintains {i in indices of (varss Inter cond) | varss[i] == max(varss(i in indices of (varss Inter cond))}
Maintains {i in indices of (varss Inter cond) | varss[i] == miax(varss(i in indices of (varss Inter cond))} Extact ordering is specified by implementiing abstract methods of the class.
Maintains {i in indices of (varss Inter cond) | varss[i] == min(varss(i in indices of (varss Inter cond))}
maintains output = Max(vars) where * output is an IntVar * on is a set of IntVar update is O(log(n))
maintains output = Max(a,b) where output, a, and b are an IntVar use this if you only have two variables to max, otherwise, refer to log iplementations
Maintains Max(Var(i) | i in cond)
maintains output = Max(vars) where * output is an IntVar * on is a set of IntVar update is O(n)
maintains output = Max(v) where * output is an IntVar * v is an IntSetVar
Maintains Miax(Var(i) | i in cond) Exact ordering is specified by implementing abstract methods of the class.
maintains output = Min(vars) where * output is an IntVar * on is a set of IntVar update is O(log(n))
maintains output = Min(a,b) where output, a, and b are an IntVar use this if you only have two variables to max, otherwise, refer to log iplementations
Maintains Min(Var(i) | i in cond)
maintains output = Min(vars) where * output is an IntVar * on is a set of IntVar update is O(n)
maintains output = Min(v) where * output is an IntVar * v is an IntSetVar
This package includes a set of invariants that compute min max, argmin and argmax over a wealth of differents structures.