Use a stable algorithm in sorting marks #3064
Merged
Conversation
This file contains 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
Codecov Report
Additional details and impacted files@@ Coverage Diff @@
## master #3064 +/- ##
=======================================
Coverage 98.38% 98.38%
=======================================
Files 72 72
Lines 23537 23537
=======================================
Hits 23156 23156
Misses 381 381
|
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.
Closes #3059. With the example from that issue:
( so.Plot(x=falseposrate_logistic, y=trueposrate_logistic) .add(so.Line(marker="o", pointsize=2)) )I wasn't able to cook up a toy example to demonstrate the problem so I haven't added a separate test for it. Would be a great addition if anyone can come up with one (i.e. not involving scikit learn, etc.).