unp1
unp1
Hi, thanks a lot! In the sibling class "DefaultProofControl" there is a similar busy wait, is it possible to apply your solution there as well? Best regards, Richard
Yes and yes :-) The problem is that the "assignable_free" clause cannot be specified in the dialoh and therefore "null" was returned as its instantiation, which then lead to an...
> With the changes in this branch, something is very strange now: I can not even close an easy proof with a loop that writes only a single field. The...
> > > With the changes in this branch, something is very strange now: I can not even close an easy proof with a loop that writes only a single...
Rebased on current main. Loop invariant dialog works again w/o NPE. @WolframPfeifer: Ready for review, thanks!
I think the Qodana and Checkerframework fails are unrelated to this PR.
Wondering. When saving a proof, we could also store that last selected node (if available) and after loading select this node? So that should be done carefully to not introduce...
I submitted PR #3324 for discussion. It adds the mentioned feature.
> The printing is broken. However, at the moment I do not know how to fix this. It seems that everything inside the by choice/taclet option switch is ignored by...
Concerning the nonRigid modifier. I want to submit a PR soon that reenables that modifier at least for predicates (also I think here the modifier is allowed but not passed...