-
Notifications
You must be signed in to change notification settings - Fork 146
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Improving PropDiffN performance #663
Conversation
Codecov Report
@@ Coverage Diff @@
## master #663 +/- ##
============================================
+ Coverage 62.28% 62.29% +<.01%
- Complexity 9886 9896 +10
============================================
Files 634 634
Lines 40183 40199 +16
Branches 7686 7690 +4
============================================
+ Hits 25027 25040 +13
- Misses 12879 12882 +3
Partials 2277 2277
Continue to review full report at Codecov.
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Could you remind me the gain observed ?
solver/src/main/java/org/chocosolver/solver/constraints/nary/PropDiffN.java
Outdated
Show resolved
Hide resolved
solver/src/main/java/org/chocosolver/solver/constraints/nary/PropDiffN.java
Show resolved
Hide resolved
The gain on pure random instances was about 20% faster execution for the same number of nodes for the same search strategy (inputOrder). |
Fixes # .
Changes proposed in this PR:
@chocoteam/core-developer