Skip to content

Reduce handoff threshold #45

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.

Sign up for GitHub

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

Merged
brenhinkeller merged 2 commits into from
Aug 19, 2025
Merged

Reduce handoff threshold #45

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
1ca0d89
Reduce the threshold for handoff to base partialsort
brenhinkeller Aug 19, 2025
4847da2
Bump version to v0.5.11
brenhinkeller Aug 19, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion Project.toml
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
name = "VectorizedStatistics"
uuid = "3b853605-1c98-4422-8364-4bd93ee0529e"
authors = ["C. Brenhin Keller", "Chris Elrod"]
version = "0.5.10"
version = "0.5.11"

[deps]
LoopVectorization = "bdcacae8-1622-11e9-2a5c-532679323890"
Expand Down
4 changes: 2 additions & 2 deletions src/quicksort.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -73,8 +73,8 @@ sortnans!(A::AbstractArray{<:Integer}, iₗ::Int=firstindex(A), iᵤ::Int=lastin

# Partially sort `A` around the `k`th sorted element and return that element
function quickselect!(A::AbstractArray, iₗ::Int=firstindex(A), iᵤ::Int=lastindex(A), k=(iₗ+iᵤ)÷2)
# Fall back to Base implementation for very large arrays
if iᵤ-iₗ > 20000
# Fall back to Base implementation for large arrays
if iᵤ-iₗ > 9999
return Base.Sort.partialsort!(view(A, iₗ:iᵤ), k-(iₗ-1))
end

Expand Down
Loading