Skip to content
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

Improve bitonic sort perfomance #92

Merged
merged 2 commits into from
Apr 4, 2024
Merged

Improve bitonic sort perfomance #92

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
ecc3d45
Reworked bitonic sort
kirillgarbar Mar 24, 2024
627707b
Comment
kirillgarbar Mar 24, 2024
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
4 changes: 2 additions & 2 deletions src/GraphBLAS-sharp.Backend/Common/Common.fs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,6 +11,7 @@ module Common =
/// Sorts in-place input array of values by their 2d indices,
/// which are stored in two given arrays of keys: rows and columns.
/// When comparing, it first looks at rows, then columns.
/// Note that maximum possible workGroupSize is used internally for better perfomance.
/// </summary>
/// <example>
/// <code>
Expand All @@ -24,8 +25,7 @@ module Common =
/// > val values = [| 1.9; 2.8; 6.4; 5.5; 4.6; 3.7; 7.3 |]
/// </code>
/// </example>
let sortKeyValuesInplace<'n, 'a when 'n: comparison> =
Sort.Bitonic.sortKeyValuesInplace<'n, 'a>
let sortKeyValuesInplace<'a> = Sort.Bitonic.sortKeyValuesInplace<'a>

module Radix =
/// <summary>
Expand Down
Loading
Loading