-
Notifications
You must be signed in to change notification settings - Fork 27
A faster more extensible radix sort #53
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
Conversation
Codecov Report
@@ Coverage Diff @@
## master #53 +/- ##
==========================================
- Coverage 97.84% 89.58% -8.26%
==========================================
Files 1 4 +3
Lines 325 461 +136
==========================================
+ Hits 318 413 +95
- Misses 7 48 +41
Continue to review full report at Codecov.
|
…Floats (esp Float16) still not tested.
…TODO support QuickSort)
6c960fd to
02099b6
Compare
|
High power testing via SortMark is incompatible with Julia 1.0. No intention to fix this rn. |
|
Closed in favor of JuliaLang/julia#44230 |
Roadmap
byandwith(benchmark to see if these are worth including)ref: https://discourse.julialang.org/t/request-for-comments-a-roadmap-to-faster-sort-for-primitive-types-using-radixsort/70269?