Marshall Lochbaum
|
26c3dbfeea
|
Start using type-independent utilities in compress()
|
2022-09-16 22:01:56 -04:00 |
|
Marshall Lochbaum
|
3505e1515e
|
Extend Group where 𝕨 is an integer list to handle higher-rank 𝕩
|
2022-09-16 22:01:56 -04:00 |
|
Marshall Lochbaum
|
21033fa355
|
Move Group to its own file
|
2022-09-16 22:01:56 -04:00 |
|
Marshall Lochbaum
|
0b1ded14e0
|
Type-independent Reverse
|
2022-09-16 22:01:56 -04:00 |
|
Marshall Lochbaum
|
b84a2d4e1f
|
Special-casing for length 1 in self-search functions
|
2022-09-16 22:01:56 -04:00 |
|
Marshall Lochbaum
|
57d33990e3
|
Make self-search special code only depend on cell size
|
2022-09-16 22:01:56 -04:00 |
|
dzaima
|
89503ba1c1
|
don't not check top bits in LIKELY & RARE
|
2022-09-12 19:51:07 +03:00 |
|
dzaima
|
889c520251
|
move slash_im setting
|
2022-09-12 18:32:56 +03:00 |
|
dzaima
|
a46ec7343e
|
not slow ⍉bitarr, fix ⊢⌾⍉ 2‿3‿4⥊↕24
|
2022-09-12 18:27:18 +03:00 |
|
dzaima
|
32d533b6e2
|
don't print left argument of ⊑ if it's large
|
2022-09-12 18:21:04 +03:00 |
|
dzaima
|
47c4a53da4
|
fix WARN_SLOW build
|
2022-09-12 18:19:05 +03:00 |
|
Marshall Lochbaum
|
6d372959e8
|
Just return 𝕩 for an all-ones compress
|
2022-09-11 21:48:31 -04:00 |
|
Marshall Lochbaum
|
9b17701c66
|
Sparse 1- and 2-byte compress, with blocking, if total sum is low enough
|
2022-09-11 20:19:20 -04:00 |
|
Marshall Lochbaum
|
c796670549
|
Faster trailing zero trim, and apply it to all cases in compress()
|
2022-09-11 20:19:20 -04:00 |
|
Marshall Lochbaum
|
2baa88ad31
|
Compress for 4-byte and 8-byte data using index blocks
|
2022-09-11 18:00:29 -04:00 |
|
Marshall Lochbaum
|
ab25b08f84
|
Move compress (bool/list) to its own function
|
2022-09-11 16:32:41 -04:00 |
|
Marshall Lochbaum
|
819899c745
|
Implement f64 Where with u16 blocks
|
2022-09-11 16:32:41 -04:00 |
|
Marshall Lochbaum
|
fda3efe217
|
More macros for Where
|
2022-09-11 15:31:23 -04:00 |
|
Marshall Lochbaum
|
0d6894ddbc
|
Fix broken non-Singeli dense i32 Where
|
2022-09-11 15:15:56 -04:00 |
|
Marshall Lochbaum
|
4bc5350747
|
Branchless sparse i16 Where
|
2022-09-11 11:00:17 -04:00 |
|
Marshall Lochbaum
|
1f40d36712
|
Separate where into its own function and split different types completely
|
2022-09-11 08:31:20 -04:00 |
|
Marshall Lochbaum
|
638121c054
|
Use blocked method for i32 Where with or without Singeli
|
2022-09-11 07:57:14 -04:00 |
|
Marshall Lochbaum
|
4999758497
|
Branchless i32 sparse Where
|
2022-09-11 07:57:01 -04:00 |
|
Marshall Lochbaum
|
017fcaea2a
|
Move slash functions to a separate file
|
2022-09-10 09:58:42 -04:00 |
|
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
|
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
|
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 |
|