Marshall Lochbaum
|
bb3ecdca6a
|
Sparse Where
|
2022-09-10 09:12:16 -04:00 |
|
Marshall Lochbaum
|
ae9817fd0d
|
Fast path for / with empty result, and faster non-Singeli Where
|
2022-09-10 09:02:17 -04:00 |
|
Marshall Lochbaum
|
d8abc4ef7e
|
Separate handling for ⊔ when 𝕨 changes value rarely
|
2022-09-09 18:11:12 -04:00 |
|
Marshall Lochbaum
|
ef2dee9a4d
|
Special case data movement for ⊔ on sorted 𝕨
|
2022-09-09 13:21:08 -04:00 |
|
Marshall Lochbaum
|
569dcacac1
|
Do Group's range check and ¯1 counting on 1- or 2-byte ints
Doesn't vectorize, but at least it speeds up filtering later
|
2022-09-09 08:58:23 -04:00 |
|
Marshall Lochbaum
|
1e143644b6
|
Filter out ¯1s in Group with / if there are enough of them
|
2022-09-08 21:00:15 -04:00 |
|
dzaima
|
e266fbd09e
|
basic float monadic arith loops, incl. -fno-math-errno
|
2022-09-08 23:18:47 +03:00 |
|
dzaima
|
2358436b89
|
more efficient spreadBits{[8]u32, u8}
|
2022-09-08 21:51:25 +03:00 |
|
dzaima
|
d3a1fee437
|
singeli bit_sel
|
2022-09-08 21:39:51 +03:00 |
|
dzaima
|
d60713225b
|
just use u64 in bitsel
|
2022-09-08 20:25:09 +03:00 |
|
dzaima
|
1619b6087b
|
mild optimization of v_set argument consumption
|
2022-09-08 20:05:13 +03:00 |
|
dzaima
|
3ccef1fe86
|
⊔𝕩 → ⊔⟜(↕≠)𝕩
|
2022-09-08 14:52:19 +03:00 |
|
dzaima
|
59cadb06fe
|
fix ⟨⟨⟩⟩⊏⟨⟩ incorrectly erroring
incl. ⟨⟨⟩,⟨⟩⟩⊏0‿0⥊⟨⟩, ⟨⟨⟩⟩⊏0‿0⥊⟨⟩, etc
|
2022-09-08 00:56:31 +03:00 |
|
dzaima
|
66d32e0acb
|
fast exit for depth-2 𝕨 in 𝕨⊏𝕩
|
2022-09-08 00:47:25 +03:00 |
|
dzaima
|
96ca9092ba
|
attempt at better bit_sel dispatch
|
2022-09-08 00:37:44 +03:00 |
|
dzaima
|
234443a17c
|
src/README.md updates
|
2022-09-08 00:03:42 +03:00 |
|
dzaima
|
59e947cc20
|
more consistent type checking & conversion functions
|
2022-09-07 23:56:03 +03:00 |
|
dzaima
|
734e9fc116
|
better type checking helpers
|
2022-09-07 23:38:51 +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
|
5d660cbf19
|
deduplicate hashmap size doubling function
|
2022-09-07 19:32:02 +03:00 |
|
dzaima
|
1a583725be
|
use TALLOCP in other places
|
2022-09-07 17:59:17 +03:00 |
|
dzaima
|
40b76b840e
|
Merge pull request #41 from mlochbaum/select
Select
|
2022-09-07 17:07:28 +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
|
1c279a0a20
|
fast bitarr×intarr
|
2022-09-06 22:47:16 +03:00 |
|
dzaima
|
a90e7de997
|
simpler atom-array arith on length 0 inputs
|
2022-09-06 18:24:49 +03:00 |
|
dzaima
|
311aa74303
|
simpler bitsel for ∨
|
2022-09-06 17:31:42 +03:00 |
|
dzaima
|
ce1c81219e
|
manual wideness check
|
2022-09-06 17:23:57 +03:00 |
|
dzaima
|
0b4259559c
|
include errno.h in file.c unconditionally
|
2022-09-06 00:08:55 +03:00 |
|
dzaima
|
bffe16d6e9
|
fix overflowed & float functions
|
2022-09-05 23:23:51 +03: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 |
|
dzaima
|
47f48bbd94
|
Merge pull request #40 from mlochbaum/ind-inv
Indices inverse
|
2022-09-04 00:32:54 +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
|
76141f6fe6
|
reduce lifetime of e in dyArith_AA
|
2022-09-01 22:45:30 +03:00 |
|
dzaima
|
1b8bd0707e
|
make dyarith array-array dispatch its own function
|
2022-09-01 22:22:13 +03:00 |
|
dzaima
|
bd04e38a5e
|
use existing copy functions for arr_join_inline
|
2022-09-01 19:52:51 +03:00 |
|
dzaima
|
90dd740bfc
|
use cpyHArr instead of a getter loop
|
2022-09-01 19:25:20 +03:00 |
|