juliaformatter

Author: xaellison

src/bitonic_sort/gpu.jl

@@ -50,7 +50,7 @@ end
     xor(x, x >> 1i32)
 end
 
-@inline function bisect_range(index::I, lo::I, n::I) where I
+@inline function bisect_range(index::I, lo::I, n::I) where {I}
     if n <= one(I)
         return -one(I), -one(I)
     end
@@ -64,15 +64,15 @@ end
     return lo, n
 end
 
-@inline function rev_lt(a :: T, b :: T, lt, rev :: Val{R}) where {T,R}
+@inline function rev_lt(a::T, b::T, lt, rev::Val{R}) where {T,R}
     if R
         return lt(b, a)
     else
         return lt(a, b)
     end
 end
 
-@inline function rev_lt(a :: Tuple{T, J}, b :: Tuple{T, J}, lt, rev :: Val{R}) where {T, J, R}
+@inline function rev_lt(a::Tuple{T,J}, b::Tuple{T,J}, lt, rev::Val{R}) where {T,J,R}
     if R
         if a[1] == b[1]
             return a[2] < b[2]
@@ -94,7 +94,7 @@ end
     end
 end
 
-@inline function compare!(vals_inds::Tuple, i1::I, i2::I, dir::Bool, by, lt, rev) where I
+@inline function compare!(vals_inds::Tuple, i1::I, i2::I, dir::Bool, by, lt, rev) where {I}
     i1′, i2′ = i1 + one(I), i2 + one(I)
     vals, inds = vals_inds
     # comparing tuples of (value, index) guarantees stability of sort
@@ -104,7 +104,7 @@ end
 end
 
 
-@inline function get_range_part1(n::I, index::I, k::I)::Tuple{I,I,Bool} where I
+@inline function get_range_part1(n::I, index::I, k::I)::Tuple{I,I,Bool} where {I}
     lo = zero(I)
     dir = true
     for iter = one(I):k-one(I)
@@ -123,7 +123,7 @@ end
     return lo, n, dir
 end
 
-@inline function get_range_part2(lo::I, n::I, index::I, j::I)::Tuple{I,I} where I
+@inline function get_range_part2(lo::I, n::I, index::I, j::I)::Tuple{I,I} where {I}
     for iter = one(I):j-one(I)
         lo, n = bisect_range(index, lo, n)
     end
@@ -175,7 +175,7 @@ end
     end
 end
 
-@inline function compare_small!(vals_inds::Tuple, i1::I, i2::I, dir::Bool, by, lt, rev) where I
+@inline function compare_small!(vals_inds::Tuple, i1::I, i2::I, dir::Bool, by, lt, rev) where {I}
     i1′, i2′ = i1 + one(I), i2 + one(I)
     vals, inds = vals_inds
     # comparing tuples of (value, index) guarantees stability of sort
@@ -192,7 +192,7 @@ all threads perform swaps accessible using shmem.
 
 Various negative exit values just for debugging.
 """
-@inline function block_range(n::I, block_index::I, k::I, j::I)::Tuple{I,I,Bool} where I
+@inline function block_range(n::I, block_index::I, k::I, j::I)::Tuple{I,I,Bool} where {I}
     lo = zero(I)
     dir = true
     tmp = block_index * two(I)
@@ -252,11 +252,7 @@ end
 For sortperm/sortperm!, allocate and return shared memory views of `c` and index
 array. Each view is indexed along block x dim: one view per pseudo-block
 """
-@inline function initialize_shmem!(
-    vals_inds::Tuple{AbstractArray{T},AbstractArray{J}},
-    index,
-    in_range,
-) where {T,J}
+@inline function initialize_shmem!(vals_inds::Tuple{AbstractArray{T},AbstractArray{J}}, index, in_range) where {T,J}
     # NB: I tried creating both shmem arrays with `initialize_shmem!`
     # but the behavior changed - maybe it's necessary to alloc both before
     # writing to either?
@@ -275,7 +271,7 @@ end
 """
 For sort/sort!, copy shmem view `swap` back into global array `c`
 """
-@inline function finalize_shmem!(vals::AbstractArray, swap::AbstractArray, index::I, in_range::Bool) where I
+@inline function finalize_shmem!(vals::AbstractArray, swap::AbstractArray, index::I, in_range::Bool) where {I}
     if in_range
         @inbounds vals[index+one(I)] = swap[threadIdx().x]
     end
@@ -348,7 +344,7 @@ of values and an index array for doing `sortperm!`. Cannot provide a stable
 `sort!` although `sortperm!` is properly stable. To reverse, set `rev=true`
 rather than `lt=!isless` (otherwise stability of sortperm breaks down).
 """
-function bitonic_sort!(c; by = identity, lt = isless, rev=false) where {T}
+function bitonic_sort!(c; by = identity, lt = isless, rev = false) where {T}
     c_len = if typeof(c) <: Tuple
         length(c[1])
     else