Commit Graph

1301 Commits

Author SHA1 Message Date
Marshall Lochbaum
e6f1e04de2 Fast generic and pext-based ∧˝˘ and ∨˝˘ on width<64 2024-06-18 07:46:31 -04:00
Marshall Lochbaum
6d27dd391b Clean up scan_rows_bit logic and implement -˘ as (2×⊣˘)-+`˘ 2024-06-18 07:46:31 -04:00
Marshall Lochbaum
efde979fe9 Fast boolean ⊣`˘ 2024-06-18 07:46:31 -04:00
Marshall Lochbaum
3b61568fda Implement boolean list scans ->≤≥ using more common scans 2024-06-18 07:46:31 -04:00
Marshall Lochbaum
fde29684d7 Tweak for faster +`˘ on very short boolean rows 2024-06-18 07:46:31 -04:00
Marshall Lochbaum
8e47221c9f Implement monadic boolean = with ≠ 2024-06-18 07:46:31 -04:00
Marshall Lochbaum
8331a05547 Boolean ≠`˘ implementation 2024-06-18 07:46:31 -04:00
Marshall Lochbaum
bd64e8bcd2 Faster boolean +`˘ for short rows based on flattened prefix sum 2024-06-18 07:46:31 -04:00
Marshall Lochbaum
5591d0f4f0 Boolean row-wise scans ∧˘ and ∨˘ 2024-06-18 07:46:31 -04:00
Marshall Lochbaum
7b4468c394 Move logical fold-rows functions to Singeli 2024-06-18 07:46:31 -04:00
Marshall Lochbaum
2590222988 Generic-architecture implementations of fold.singeli 2024-06-18 07:46:31 -04:00
Marshall Lochbaum
d29b4df50c Boolean and, or, eq folds for row length >64 2024-06-18 07:46:31 -04:00
Marshall Lochbaum
c76e175719 Faster boolean +˝˘, and ≠˝˘ on row length >64 2024-06-18 07:46:31 -04:00
Marshall Lochbaum
ab4e5543a0 Implement matrix ⊣˝˘ and ⊢˝˘ with select_cells 2024-06-18 07:46:31 -04:00
dzaima
73123f5bde even faster »⎉1 & «⎉1 for narrow bitarr 𝕩 2024-06-06 23:36:45 +03:00
dzaima
cc3c6985ad faster unit»⎉1𝕩 / unit«⎉1𝕩 2024-06-05 13:53:09 +03:00
dzaima
ae3128c180 relax CHECK_IA in takedrop_highrank
future overflow in ria*elWidth when allocating shouldn't be a worry as all such calculations should be done in u64, and CHECK_IA(x, 1) guarantees that x is (much) less than 2^60 in both usz configurations
2024-06-05 02:30:00 +03:00
dzaima
8044c560a4 faster atom∾atom 2024-06-01 16:22:34 +03:00
dzaima
05690c001a suppress false-positive gcc warnings 2024-05-24 04:01:05 +03:00
dzaima
f14583f995 faster ⍉ on large‿small⥊x 2024-05-22 20:07:48 +03:00
dzaima
44c8da7dc7 add checks for l>0 on equal() impls
some Singeli `fn equal` paths already assumed such, this just makes the requirement properly checked for, benefited from, and documented
2024-05-20 01:03:57 +03:00
dzaima
52fb05fcd4 unify ⌾(a⊸⊏) typed array paths, fix csz==0 2024-05-20 01:03:57 +03:00
Andrea Piseri
60a28a40ca Clean up collision checking, use vector copy functions 2024-05-19 16:59:55 +02:00
dzaima
9f6151d92d expand ⌾(a⊸⊏) tests, stylistic changes/cleanup 2024-05-19 02:14:08 +03:00
Andrea Piseri
99a23a97d8 Fix typo in the error message 2024-05-19 00:10:28 +02:00
Andrea Piseri
3738d0d65d Formatting 2024-05-18 23:58:11 +02:00
Andrea Piseri
93188a9f90 Use COPY_TO and EQFN in the typed array code path 2024-05-18 23:56:13 +02:00
Andrea Piseri
06808414da Separate code path for cxsz=1, fix out of bounds read for RNK(x)==0 2024-05-18 21:45:18 +02:00
Andrea Piseri
7f28308e44 native path in select_ucw for high rank 𝕩
`𝔽⌾(a⊸⊏)𝕩` now does not need to go through the self-hosted runtime if
`1<=𝕩`. Instead the `select_replace` helper function is parametrized
over the length of `𝕩` (`xl`) and item amount of the cell of `𝕩` (`xcia`).

- The `EQ` macro is modified to not immediately mark the cell as
  populated, so that multiple replacements can be done on the cell
  on the first assignment to it.

- The `DONE_CW` macro is invoked to mark the current cell as populated
  when every element in it has been assigned.

- A loop over the cell contents is introduced to copy the elements in
  `𝕩`. This should be fine as it is an easily predictable jump,
  but a performance regression is possible and a separate code path
  could be introduced in the future.

The change introduces more extensive checking on the shape of `𝔽`'s
result, as for high rank `𝕩` the requirement should be `(≢𝔽a⊏𝕩)≡(≢a)∾1↓≢𝕩`.

The old behaviour of `select_replace` is recovered by passing `xl=xia`
and `xcia=1` in the implementation of `pick_ucw`.
2024-05-18 12:12:17 +02:00
dzaima
4a40739398 use printf & fprintf instead of putchar & co 2024-05-05 01:07:47 +03:00
dzaima
5600bb189a fix ⟨1,2⋆62⟩/2⥊<⋈0 2024-04-20 21:24:51 +03:00
dzaima
de529e483b make non-Singeli getRange_f64 check first element for integerness 2024-04-20 21:21:47 +03:00
dzaima
a6a088868c fix ⟨⟩⍷⟨⟩ 2024-04-04 03:54:55 +03:00
dzaima
3870189f85 fix 3‿3⍒"a" & "aa"⍒3‿3 2024-04-04 03:54:55 +03:00
dzaima
a75522c738 fix list⌽𝕩 2024-04-04 02:52:08 +03:00
dzaima
54cec2fdf5 split up CATCH_ERRORS into functional and semantic options
allows running a non-heapverify build that functions exactly as a heapverify one, while allowing ⎊ to function
2024-04-04 02:52:08 +03:00
dzaima
74f3b5a012 fix (17⥊'⍉') ∊ 4⥊<"a" 2024-04-03 22:14:04 +03:00
dzaima
61e068086e fix (2⋆25)/(2⋆10)⥊10 2024-04-03 22:14:04 +03:00
dzaima
74d937a4fd fix +⌜´↕0 leaking a reference 2024-04-03 17:13:06 +03:00
dzaima
d4f290a897 error on nonInteger⌽⟨⟩ 2024-04-03 17:09:27 +03:00
dzaima
c1157f89a6 fix GroupLen properly 2024-04-03 05:59:35 +03:00
dzaima
b8730798c1 explicitly handle empty cells in compress 2024-04-03 05:59:35 +03:00
dzaima
5ab49ab146 slash.c cleanup 2024-04-03 05:59:35 +03:00
dzaima
d77018f269 fix ⟨⟩⍷1‿0⥊0 2024-04-03 05:59:35 +03:00
dzaima
af0a40c732 fix ⍟ with empty typed repeat counts 2024-04-03 05:59:35 +03:00
dzaima
d21a77119f more verification of •bit._cast types, remove 'n' 2024-03-30 17:55:43 +02:00
dzaima
ac069134c3 fix ⟨1.5⟩ ⊏ "ab"‿"cd" 2024-03-25 16:18:01 +02:00
dzaima
a94903cb12 fix 𝕨⊏unit 2024-03-25 16:18:01 +02:00
dzaima
10a58878d7 fix GroupLen on array elements outside i64 range 2024-03-25 16:18:01 +02:00
dzaima
0c3d83c50b fix ⊑˘ with bitarr 𝕩 2024-02-27 14:27:42 +02:00