Compare a and b in proper ascending or descending order
(a, b)
| 212 | nthread_bx = ceil_div(size, nthread_tx) |
| 213 | |
| 214 | def compare(a, b): |
| 215 | """Compare a and b in proper ascending or descending order""" |
| 216 | if is_ascend: |
| 217 | out = a <= b |
| 218 | else: |
| 219 | out = b <= a |
| 220 | return out |
| 221 | |
| 222 | # Sort the lower levels of the merge using odd-even sort, it's fast for small inputs |
| 223 | lower_lim = ceil_log2(block_size) |
no outgoing calls
no test coverage detected
searching dependent graphs…