|
| 1 | +import numpy as np |
1 | 2 | from numba import njit |
2 | 3 |
|
| 4 | +_ARR = np.zeros(1) |
| 5 | + |
3 | 6 |
|
4 | 7 | @njit |
5 | 8 | def swap(arr, i, j): |
6 | 9 | arr[i], arr[j] = arr[j], arr[i] |
7 | 10 |
|
8 | 11 |
|
9 | 12 | @njit |
10 | | -def swap_all(arr, i, j, extra1=None, extra2=None): |
| 13 | +def _swap_all(arr, i, j, extra1, use_extra1, extra2, use_extra2): |
11 | 14 | swap(arr, i, j) |
12 | | - if extra1 is not None: |
| 15 | + if use_extra1: |
13 | 16 | swap(extra1, i, j) |
14 | | - if extra2 is not None: |
| 17 | + if use_extra2: |
15 | 18 | swap(extra2, i, j) |
16 | 19 |
|
17 | 20 |
|
18 | 21 | @njit |
19 | | -def partition(data, start, end, p_ord, extra1=None, extra2=None): |
| 22 | +def _partition(data, start, end, p_ord, extra1, use_extra1, extra2, use_extra2): |
20 | 23 | higher = start |
21 | 24 | for j in range(start, end): |
22 | 25 | j_ord = data[j] |
23 | 26 | if j_ord < p_ord: |
24 | | - swap_all(data, higher, j, extra1, extra2) |
| 27 | + _swap_all(data, higher, j, extra1, use_extra1, extra2, use_extra2) |
25 | 28 | higher += 1 |
26 | 29 | return higher |
27 | 30 |
|
28 | 31 |
|
29 | 32 | @njit |
30 | | -def quickselect(data, start, end, k, extra1=None, extra2=None): |
| 33 | +def _quickselect(data, start, end, k, extra1, use_extra1, extra2, use_extra2): |
31 | 34 | if (k < start) or (k >= end): |
32 | 35 | return |
33 | 36 | start_, end_, higher = start, end, None |
34 | 37 | while higher != k + 1: |
35 | 38 | p = data[k] |
36 | | - swap_all(data, start_, k, extra1, extra2) |
37 | | - higher = partition(data, start_ + 1, end_, p, extra1, extra2) |
38 | | - swap_all(data, start_, higher - 1, extra1, extra2) |
| 39 | + _swap_all(data, start_, k, extra1, use_extra1, extra2, use_extra2) |
| 40 | + higher = _partition( |
| 41 | + data, start_ + 1, end_, p, extra1, use_extra1, extra2, use_extra2 |
| 42 | + ) |
| 43 | + _swap_all(data, start_, higher - 1, extra1, use_extra1, extra2, use_extra2) |
39 | 44 | if k <= higher - 1: |
40 | 45 | end_ = higher |
41 | 46 | else: |
42 | 47 | start_ = higher |
| 48 | + |
| 49 | + |
| 50 | +def _to_array(extra1=None, extra2=None): |
| 51 | + extra1_arr = _ARR if extra1 is None else extra1 |
| 52 | + extra2_arr = _ARR if extra2 is None else extra2 |
| 53 | + return extra1_arr, extra2_arr |
| 54 | + |
| 55 | + |
| 56 | +def _use_array(extra1=None, extra2=None): |
| 57 | + use_extra1 = extra1 is not None |
| 58 | + use_extra2 = extra2 is not None |
| 59 | + return use_extra1, use_extra2 |
| 60 | + |
| 61 | + |
| 62 | +def swap_all(arr, i, j, extra1=None, extra2=None): |
| 63 | + extra1_arr, extra2_arr = _to_array(extra1, extra2) |
| 64 | + use_extra1, use_extra2 = _use_array(extra1, extra2) |
| 65 | + _swap_all( |
| 66 | + arr, |
| 67 | + i, |
| 68 | + j, |
| 69 | + extra1=extra1_arr, |
| 70 | + use_extra1=use_extra1, |
| 71 | + extra2=extra2_arr, |
| 72 | + use_extra2=use_extra2, |
| 73 | + ) |
| 74 | + |
| 75 | + |
| 76 | +def partition(data, start, end, p_ord, extra1=None, extra2=None): |
| 77 | + extra1_arr, extra2_arr = _to_array(extra1, extra2) |
| 78 | + use_extra1, use_extra2 = _use_array(extra1, extra2) |
| 79 | + return _partition( |
| 80 | + data, |
| 81 | + start, |
| 82 | + end, |
| 83 | + p_ord, |
| 84 | + extra1=extra1_arr, |
| 85 | + use_extra1=use_extra1, |
| 86 | + extra2=extra2_arr, |
| 87 | + use_extra2=use_extra2, |
| 88 | + ) |
| 89 | + |
| 90 | + |
| 91 | +def quickselect(data, start, end, k, extra1=None, extra2=None): |
| 92 | + extra1_arr, extra2_arr = _to_array(extra1, extra2) |
| 93 | + use_extra1, use_extra2 = _use_array(extra1, extra2) |
| 94 | + _quickselect( |
| 95 | + data, |
| 96 | + start, |
| 97 | + end, |
| 98 | + k, |
| 99 | + extra1=extra1_arr, |
| 100 | + use_extra1=use_extra1, |
| 101 | + extra2=extra2_arr, |
| 102 | + use_extra2=use_extra2, |
| 103 | + ) |
0 commit comments