Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/xiaodaigh/sortinglab.jl
Faster sorting algorithms (sort and sortperm) for Julia
https://github.com/xiaodaigh/sortinglab.jl
julia julia-package julialang radix-sort radixsort sort sorting-algorithms
Last synced: 3 days ago
JSON representation
Faster sorting algorithms (sort and sortperm) for Julia
- Host: GitHub
- URL: https://github.com/xiaodaigh/sortinglab.jl
- Owner: xiaodaigh
- License: other
- Created: 2018-01-15T10:22:08.000Z (over 6 years ago)
- Default Branch: master
- Last Pushed: 2024-09-21T11:21:55.000Z (6 days ago)
- Last Synced: 2024-09-24T22:09:59.979Z (3 days ago)
- Topics: julia, julia-package, julialang, radix-sort, radixsort, sort, sorting-algorithms
- Language: Julia
- Homepage:
- Size: 486 KB
- Stars: 23
- Watchers: 3
- Forks: 4
- Open Issues: 5
-
Metadata Files:
- Readme: README.jmd
- License: LICENSE.md
Awesome Lists containing this project
README
---
title : SortingLab README
author : Dai ZJ
date: 2024--09-21
weave_options:
out_path : README.MD
doctype : github
---
# SortingLab
An alternative implementation of sorting algorithms and APIs. The ultimate aim is to contribute back to Julia base or SortingAlgorithms.jl. However, there is commitment to keep this package's API stable and supported, so other developers can rely on the implementation and API here.
# Faster Sort and Sortperm
The main function exported by SortingLab is `fsort` and `fsortperm` which generally implements faster algorithms than `sort` and `sortperm` for `CategoricalArrays.CategoricalVector`, `Vector{T}`, `Vector{Union{String, Missing}}` where `T` is
**Update Sep'2024**: SortingLab.jl used to be faster than base on integer sorting which is no longer the case! Well done base!
**Note**: The reason why we restrict the type to `Vector` is that SortingLab.jl assumes something about memory layout and hence `Vector` provides that guarantee in the types supported.
## Usage
```julia
using SortingLab;
using Test
N = 1_000_000;
K = 100;
svec = rand("id".*string.(1:N÷K, pad=10), N);
svec_sorted = fsort(svec);
@test issorted(svec_sorted)
@test issorted(svec) == false
```
```julia
# faster string sortperm
sorted_idx = fsortperm(svec)
issorted(svec[sorted_idx]) #true
# in place string sort
fsort!(svec);
issorted(svec) # true
```
```julia
# CategoricalArray sort
using CategoricalArrays
pools = "id".*string.(1:100,3);
byvec = CategoricalArray{String, 1}(rand(UInt32(1):UInt32(length(pools)), N), CategoricalPool(pools, false));
byvec = compress(byvec);
byvec_sorted = fsort(byvec);
@test issorted(byvec_sorted)
```
### Sorting `Vector{Union{T, Missing}}`
For vectors that contain `missing`, the `sort` and `sortperm` performance is often sub-optimal in `Base` and is not supported in `SortingAlgorithms.jl`'s radixsort implementation. This is solved by `SortingLab.jl` `fsort`, see Benchmarks Section
```julia
using Test
using Missings: allowmissing
x = allowmissing(rand(1:10_000, 1_000_000))
x[rand(1:length(x), 100_000)] .= missing
using SortingLab
@test isequal(fsort(x), sort(x))
```
## Benchmarks
#
## Benchmarking code
```julia
using SortingLab;
using BenchmarkTools;
import Random: randstring
using Test
using Missings: allowmissing
using Plots, StatsPlots
N = 1_000_000;
K = 100;
# String Sort
svec = rand("id".*string.(1:N÷K, pad=10), N);
sort_id_1m = @belapsed sort($svec);
radixsort_id_1m = @belapsed radixsort($svec);
sortperm_id_1m = @belapsed sortperm($svec);
fsortperm_id_1m = @belapsed fsortperm($svec);
rsvec = rand([randstring(rand(1:32)) for i = 1:N÷K], N);
sort_r_1m = @belapsed sort($rsvec);
radixsort_r_1m = @belapsed radixsort($rsvec);
sortperm_r_1m = @belapsed sortperm($rsvec);
fsortperm_r_1m = @belapsed fsortperm($rsvec);
groupedbar(
repeat(["IDs", "Random len 32"], inner=2),
[sort_id_1m, radixsort_id_1m, sort_r_1m, radixsort_r_1m],
group = repeat(["Base.sort","SortingLab.radixsort"], outer = 2),
title = "Strings sort (1m rows): Base vs SortingLab")
savefig("benchmarks/sort_vs_radixsort.png")
groupedbar(
repeat(["IDs", "Random len 32"], inner=2),
[sortperm_id_1m, fsortperm_id_1m, sortperm_r_1m, fsortperm_r_1m],
group = repeat(["Base.sortperm","SortingLab.fsortperm"], outer = 2),
title = "Strings sortperm (1m rows): Base vs SortingLab")
savefig("benchmarks/sortperm_vs_fsortperm.png")
```
# Similar package
https://github.com/JuliaCollections/SortingAlgorithms.jl
# Build status
[](https://travis-ci.org/xiaodaigh/SortingLab.jl)
[](https://coveralls.io/github/xiaodaigh/SortingLab.jl?branch=master)
[](http://codecov.io/github/xiaodaigh/SortingLab.jl?branch=master)