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
In #455 (comment)@matthedude noticed that the type MaxSize[N] = Size[LessEqual[N]] predicate should include a lower bound like this type MaxSize[N] = Size[NonNegative And LessEqual[N]]. In case of the Arbitrary instance for collections with any Size[P], this would give as a correct Arbitrary[Int Refined P] for the size of such collection that does not generate negative values when Size[P] is MaxSize[N].
I agree that we should do this.
The text was updated successfully, but these errors were encountered:
In #455 (comment) @matthedude noticed that the
type MaxSize[N] = Size[LessEqual[N]]
predicate should include a lower bound like thistype MaxSize[N] = Size[NonNegative And LessEqual[N]]
. In case of theArbitrary
instance for collections with anySize[P]
, this would give as a correctArbitrary[Int Refined P]
for the size of such collection that does not generate negative values whenSize[P]
isMaxSize[N]
.I agree that we should do this.
The text was updated successfully, but these errors were encountered: