dzaima
|
9cfc3f3f25
|
various changes on filling arrays with the same element
|
2023-07-12 16:23:03 +03:00 |
|
dzaima
|
1cea42cad3
|
use getter over 𝕨 for generic 𝕨⍋𝕩
doesn't change perf, but leads to fast amortized long⍋short
|
2023-07-10 16:50:02 +03:00 |
|
Marshall Lochbaum
|
492e97e2ca
|
Right argument narrowing for numeric Bins
|
2023-07-10 07:14:44 -04:00 |
|
Marshall Lochbaum
|
9511598aa3
|
Fast Bins when either argument is boolean
|
2023-07-10 07:13:21 -04:00 |
|
Marshall Lochbaum
|
1fa00c9c6f
|
Update bins implementation comments
|
2023-07-10 07:13:21 -04:00 |
|
Marshall Lochbaum
|
0346ff7c2d
|
Use type of ≠𝕨 for Singeli Bins result and allocate outside Singeli
|
2023-07-10 07:13:21 -04:00 |
|
Marshall Lochbaum
|
38671e3fe9
|
Fast handling for length-1 𝕨 in Bins
|
2023-07-10 07:13:21 -04:00 |
|
Marshall Lochbaum
|
302d637129
|
Allocate binary search result in Singeli, using i8 for vectors
|
2023-07-10 07:13:21 -04:00 |
|
Marshall Lochbaum
|
70249d8b64
|
In bins, promote to smallest common int type instead of i32
|
2023-07-10 07:13:21 -04:00 |
|
Marshall Lochbaum
|
4f93b5849b
|
Fix shape of char⍋num result (was deshaped)
|
2023-07-10 07:13:21 -04:00 |
|
Marshall Lochbaum
|
ec9b875503
|
Separate is-sorted check from Bins implementation
|
2023-07-10 07:13:21 -04:00 |
|
Marshall Lochbaum
|
5424c57b7e
|
Use Singeli float binary search
|
2023-07-10 07:13:21 -04:00 |
|
Marshall Lochbaum
|
464a53463d
|
Generic Singeli version of 32-bit binary search
|
2023-07-10 07:13:21 -04:00 |
|
dzaima
|
0598ce8357
|
use getFillQ less
|
2023-05-09 00:14:14 +03:00 |
|
dzaima
|
65e246774e
|
-mllvm --x86-cmov-converter=0
|
2023-04-30 20:03:09 +03:00 |
|
dzaima
|
0e79e9f868
|
fix ubsan notes
|
2023-04-30 19:50:24 +03:00 |
|
dzaima
|
cd40ec8117
|
fix ¯2e9‿2e9⍋0
|
2023-04-30 19:35:18 +03:00 |
|
dzaima
|
bb7c37960e
|
a round of more incG/incByG
|
2023-04-29 17:39:13 +03:00 |
|
dzaima
|
3b580cbd0c
|
rename unit creation methods
|
2023-04-29 17:39:13 +03:00 |
|
dzaima
|
7f0390be3f
|
more error messages
|
2023-04-28 20:49:34 +03:00 |
|
dzaima
|
d13f3fad94
|
fix ∧𝕩 & ∨𝕩 on high-rank zero-cell input
|
2023-04-19 21:52:38 +03:00 |
|
Marshall Lochbaum
|
9d7d330a03
|
Use AVX2 counting for 1-byte counting sort
|
2023-04-06 11:32:34 -04:00 |
|
dzaima
|
3a45eac1aa
|
separate SSE2, implement SSE2 dyarith & bitsel
also separate maskstore to homogeneous & top bit mask variants, and make blend require equal element widths
|
2023-04-01 20:40:23 +03:00 |
|
dzaima
|
01c457b77b
|
make all cpy.*Arr function results Arr*
|
2023-03-11 16:51:13 +02:00 |
|
dzaima
|
bb7fe02a45
|
separate checks for x86-64 & NEON Singeli importing
& restrict the processed Singeli files on NEON to the ones supported
|
2022-12-24 15:27:53 +02:00 |
|
Marshall Lochbaum
|
b9a3a7886d
|
Ordering function implementation comments
|
2022-11-20 19:57:00 -05:00 |
|
Marshall Lochbaum
|
136c1afacc
|
Macro-ize integer min/max scan and add sorted flag
|
2022-11-16 20:49:57 -05:00 |
|
Marshall Lochbaum
|
1647e98fd2
|
Use Singeli code for ⍋bool and ⍒bool with 1- and 2-byte result
|
2022-11-13 18:00:10 -05:00 |
|
dzaima
|
c9be8516c3
|
deduplicate generic sort work
|
2022-11-05 19:41:04 +02:00 |
|
dzaima
|
6e552fedf5
|
base case implementation for ⍋c8arr & ⍋c16arr
|
2022-11-05 19:00:59 +02:00 |
|
dzaima
|
ff0bfd34bb
|
squeeze Grade result
|
2022-11-05 18:48:54 +02:00 |
|
Marshall Lochbaum
|
b9d5f10d4a
|
Unify radix sort and radix lookup prefix sums
|
2022-10-23 22:08:08 -04:00 |
|
dzaima
|
83af05d274
|
fix building on gcc≤10
|
2022-10-10 13:53:56 +03:00 |
|
Marshall Lochbaum
|
ec12dd4502
|
Switch to forward inclusive sums for all radix sorting, and use Singeli
Removes SWAR for 8-bit counts, since reverse sorting uses negatives
|
2022-09-22 16:44:05 -04:00 |
|
Marshall Lochbaum
|
8e1d8bb42c
|
Use Singeli max/min scan for Indices and Sort
|
2022-09-22 15:17:54 -04:00 |
|
Marshall Lochbaum
|
fb1230bcc2
|
Sparse Indices prototype
|
2022-09-16 22:01:56 -04:00 |
|
dzaima
|
2299c8094e
|
make gcc scream less
|
2022-09-07 20:28:45 +03:00 |
|
dzaima
|
90dd740bfc
|
use cpyHArr instead of a getter loop
|
2022-09-01 19:25:20 +03:00 |
|
dzaima
|
7d716d5ce0
|
elInt
|
2022-09-01 11:17:49 +03:00 |
|
Marshall Lochbaum
|
6f02705d9f
|
Make small-range Grade code style more like radix code
|
2022-08-31 16:11:52 -04:00 |
|
Marshall Lochbaum
|
758c174cae
|
Optimistic special case to quickly invert permutations with ⍋
|
2022-08-31 16:11:52 -04:00 |
|
dzaima
|
3c1ef1c9a2
|
use elNum
|
2022-08-28 16:44:21 +03:00 |
|
Marshall Lochbaum
|
f80d3ce263
|
Branchless integer binary search
|
2022-08-28 09:16:25 -04:00 |
|
Marshall Lochbaum
|
139faee0a1
|
Unify integer and character Bins
|
2022-08-28 09:16:09 -04:00 |
|
Marshall Lochbaum
|
9376e02ecb
|
Boolean sorting
|
2022-08-27 15:44:25 -04:00 |
|
Marshall Lochbaum
|
e027aca0cf
|
Radix grades
|
2022-08-27 15:16:20 -04:00 |
|
Marshall Lochbaum
|
36e54d1a39
|
1-byte radix with length ==256 doesn't work because of SWAR overflow when descending
|
2022-08-27 11:10:17 -04:00 |
|
Marshall Lochbaum
|
4ec83e51a6
|
Merge sort.h into grade.h
|
2022-08-27 10:59:00 -04:00 |
|
dzaima
|
1694bfb7d2
|
s?p?rnk(x) → S?P?RNK(x)
|
2022-08-20 08:36:59 +03:00 |
|
dzaima
|
e6b4f85662
|
x->ia → IA(x) / PIA(x)
|
2022-08-20 08:30:03 +03:00 |
|