You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
findSubproblems() drops at least some empty or infeasible subproblems. When it's invoked in fullmatch.matrix(), in a situation where the user has provided a vector min.controls argument:
we need to trim the min.controls vector to match the length of the subproblem list. (And similarly for mean.controls, max.controls, omit.fraction.)
We also need to ensure alignment of these arguments with subproblems. (I think; perhaps it's already being done in some cases. But I couldn't see where.)
We need unit tests of this input-checking, for future proofing.
The text was updated successfully, but these errors were encountered:
findSubproblems()
drops at least some empty or infeasible subproblems. When it's invoked infullmatch.matrix()
, in a situation where the user has provided a vectormin.controls
argument:we need to trim the
min.controls
vector to match the length of the subproblem list. (And similarly formean.controls
,max.controls
,omit.fraction
.)We also need to ensure alignment of these arguments with subproblems. (I think; perhaps it's already being done in some cases. But I couldn't see where.)
We need unit tests of this input-checking, for future proofing.
The text was updated successfully, but these errors were encountered: