Draft
Conversation
Codecov ReportAttention: Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## main #3141 +/- ##
===========================================
Coverage 37.85% 37.86%
+ Complexity 17042 16953 -89
===========================================
Files 2082 2063 -19
Lines 127290 126069 -1221
Branches 21441 21321 -120
===========================================
- Hits 48183 47730 -453
+ Misses 73194 72484 -710
+ Partials 5913 5855 -58 ☔ View full report in Codecov by Sentry. |
52c42c2 to
0f182da
Compare
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Experiment to logically group steps in proof.
Two main features:
TODOs
The order of proof steps is determined as follows:
sign_case_distinction)To order the steps based on the dependency graph a queue of "available" graph nodes is managed. This queue is repeatedly iterated through to check for edges (steps) that are applicable. If they aren't the node is added to the end of the queue again. (More details will follow soon™)