dzaima
|
59e947cc20
|
more consistent type checking & conversion functions
|
2022-09-07 23:56:03 +03:00 |
|
dzaima
|
2299c8094e
|
make gcc scream less
|
2022-09-07 20:28:45 +03:00 |
|
dzaima
|
0e306ca149
|
use WRAP instead of manual index management
|
2022-09-07 20:22:26 +03:00 |
|
dzaima
|
10004b82f7
|
make 1.2‿3.4⊏≍˘"abcd" error
|
2022-09-07 19:53:31 +03:00 |
|
dzaima
|
94e6168319
|
don't read past the end of array even if the value isn't used
bit_sel still uses it
|
2022-09-07 19:41:22 +03:00 |
|
dzaima
|
1a583725be
|
use TALLOCP in other places
|
2022-09-07 17:59:17 +03:00 |
|
dzaima
|
b784dac9e1
|
make clang not go crazy
|
2022-09-07 00:27:23 +03:00 |
|
Marshall Lochbaum
|
a43a42e4d1
|
Select from small boolean list by copying to bytes
|
2022-09-06 16:34:08 -04:00 |
|
Marshall Lochbaum
|
f877a45a63
|
Vectorize range checks for 1- and 2-byte indices
|
2022-09-06 16:34:08 -04:00 |
|
Marshall Lochbaum
|
4a8244f2c1
|
Faster selection from boolean list
|
2022-09-06 16:08:16 -04:00 |
|
Marshall Lochbaum
|
55263bcbc4
|
Handle bit selection from arrays with under 2 elements
|
2022-09-06 16:08:16 -04:00 |
|
dzaima
|
c0b2164dc8
|
new array-atom arith
|
2022-09-05 22:52:53 +03:00 |
|
dzaima
|
629076d001
|
new ⟨⟩↕0 behavior & fix /⁼large_i8arr
|
2022-09-05 22:40:40 +03:00 |
|
dzaima
|
7f00d54372
|
rearrange arithd.c a bit more
|
2022-09-04 00:35:58 +03:00 |
|
Marshall Lochbaum
|
7792c60180
|
Fix unnecessary errors with computed shape 0, such as 1e8‿⌊‿1e8⥊↕5
|
2022-09-03 14:41:28 -04:00 |
|
Marshall Lochbaum
|
97bfacec44
|
Fix hang in •rand.Subset caused by moving wi==0 case into wi==xi
|
2022-09-03 14:41:28 -04:00 |
|
Marshall Lochbaum
|
44c0baee05
|
No need to initialize the negative half of the counts table
|
2022-09-03 14:41:28 -04:00 |
|
Marshall Lochbaum
|
37af32d95c
|
Faster /⁼ for boolean and long 1-byte and 2-byte 𝕩
|
2022-09-02 14:31:07 -04:00 |
|
dzaima
|
0139c5f58d
|
separate dyadic arith cases
|
2022-09-02 14:01:35 +03:00 |
|
dzaima
|
a637adadd9
|
rearrange arithd.c in preparation for separating its cases
|
2022-09-02 13:10:04 +03:00 |
|
dzaima
|
1b8bd0707e
|
make dyarith array-array dispatch its own function
|
2022-09-01 22:22:13 +03:00 |
|
dzaima
|
90dd740bfc
|
use cpyHArr instead of a getter loop
|
2022-09-01 19:25:20 +03:00 |
|
dzaima
|
dad47cf391
|
move arith_recd to a noinline function
|
2022-09-01 18:51:02 +03:00 |
|
dzaima
|
f758a3f1f6
|
proper argument name
|
2022-09-01 18:40:48 +03:00 |
|
dzaima
|
1c43ad6431
|
squeeze •rand.Subset result
|
2022-09-01 18:25:10 +03:00 |
|
dzaima
|
e72c7dc937
|
faster ÷ ⋆ √ | ⋆⁼ on i8 & i16 arrays
|
2022-09-01 16:06:52 +03:00 |
|
dzaima
|
5cfa89ad5a
|
separate functions for comparison scalar & array cases
|
2022-09-01 15:06:34 +03:00 |
|
dzaima
|
72f25dad54
|
bitarr ↕1 and ↕2
|
2022-09-01 13:29:03 +03:00 |
|
dzaima
|
7d716d5ce0
|
elInt
|
2022-09-01 11:17:49 +03:00 |
|
dzaima
|
203916b44f
|
error on non-numbers in +𝕩
|
2022-09-01 11:16:42 +03:00 |
|
Marshall Lochbaum
|
76c93d85e1
|
Dyadic 32-bit / based on 8-bit monadic /
|
2022-08-31 16:11:52 -04:00 |
|
Marshall Lochbaum
|
1e0cf78fd0
|
Implement 4-byte where with blocks of 2-byte where
|
2022-08-31 16:11:52 -04: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 |
|
Marshall Lochbaum
|
a42335af4f
|
Use or-equals for dyadic ∊ when 𝕩 is small and arguments are flat
|
2022-08-31 16:11:52 -04:00 |
|
Marshall Lochbaum
|
15b444540e
|
Extend self-search typed code to characters by treating as numbers
|
2022-08-31 16:11:52 -04:00 |
|
Marshall Lochbaum
|
9028ebfe8b
|
Native Windows (↕)
|
2022-08-31 16:11:52 -04:00 |
|
dzaima
|
9775339e2c
|
squeeze result of ⌊ and ⌈
|
2022-08-30 00:18:25 +03:00 |
|
dzaima
|
b37f620889
|
disable manual array F character loops when not running singeli
|
2022-08-29 19:46:41 +03:00 |
|
dzaima
|
777c5cc1a5
|
rename things
|
2022-08-29 19:05:34 +03:00 |
|
dzaima
|
ce5ece34e1
|
new arith
|
2022-08-28 23:28:06 +03: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 |
|
Marshall Lochbaum
|
9d59dff522
|
4-byte sorting: insertion and radix
|
2022-08-26 22:04:32 -04:00 |
|
Marshall Lochbaum
|
f946a3de41
|
2-byte sorting: insertion, radix, counting
|
2022-08-26 22:04:32 -04:00 |
|