Marshall Lochbaum
f0f130c42e
Use a lookup table for evenly-spaced masks, getting division results from those
2024-06-18 07:46:31 -04:00
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
dzaima
694920c273
minor code cleanup
2024-02-27 00:40:16 +02:00
dzaima
875f9185bf
use ux a tiny bit more, add a PLAINLOOP
2024-02-27 00:37:47 +02:00
dzaima
1318026c4e
a bunch of vfor
2024-02-13 22:34:16 +02:00
dzaima
3fc3338256
extract independent load from loop
2024-02-13 22:33:54 +02:00
dzaima
f981f6963b
use ux for loop index in reverse
...
makes gcc autovectorizer happier
2024-02-13 22:31:22 +02:00
dzaima
5abb09ca74
remove barely-useful elType==el_i32 path of reshape
...
perhaps could be replaced with an <=el_i32 path that still uses GetU but just skips numberness/integerness checks and ∘/⌊/⌽/↑ logic
2024-02-13 22:30:11 +02:00
dzaima
73a2b06703
more PLAINLOOP
2024-02-08 19:26:35 +02:00
dzaima
9cb0ab2fbb
Use getRange_fns for repeat_bounds
2024-02-08 19:25:30 +02:00
dzaima
291d3ef5d7
deduplicate sh_c2 setup & output prep
2024-02-04 15:31:38 +02:00
dzaima
4f39729013
Merge pull request #106 from vylsaz/win-sh2
...
Implement •SH for Windows
2024-02-04 14:48:36 +02:00
dzaima
a3392fd6c1
fix casrt_c2 more
2024-02-04 14:47:43 +02:00
vylsaz
42e4956fb9
Replaced globals with argument to thread procedure
2024-02-04 02:35:47 +00:00
dzaima
2dfc8933bd
fix refcount leak in casrt_c2
2024-02-03 18:20:07 +02:00
vylsaz
74d3620839
Implement •SH
2024-02-03 01:45:56 +00:00
dzaima
1e8c390e6a
include file name in failed complication error messages
2024-02-01 22:52:55 +02:00
dzaima
592a8312ac
a bunch of PLAINLOOP
2024-02-01 21:26:08 +02:00
dzaima
1b26e85325
don't need to mark static globals as hidden
...
gcc complains about this
2024-02-01 21:26:08 +02:00
dzaima
c078f62b1f
add GLOBAL, INIT_GLOBAL, or const to globals
2024-02-01 21:13:39 +02:00
dzaima
041be9a612
rearrange elses to get rid of clangd warning
2024-01-28 02:29:03 +02:00
dzaima
ffffdb5895
relax take/drop overflow checking
2024-01-19 18:03:54 +02:00
Marshall Lochbaum
2af2fb8e0c
Use ⍷⊸⊐ for Classify (⊐) on long 1-byte arguments if SIMD bit-table is available
2024-01-07 19:54:13 -05:00
Marshall Lochbaum
dbb6fbade1
Fast interleaving (≍˘) for pointer arrays
2023-12-31 16:28:59 -05:00
Marshall Lochbaum
5f3a4769be
Rename constrep.singeli to replicate.singeli; not just constant now
2023-12-31 15:30:20 -05:00
Marshall Lochbaum
e50ae40f8b
Port replicate-by-scan code from C to Singeli
2023-12-31 15:26:58 -05:00
Marshall Lochbaum
3584ebd7a6
Non-BMI2 bit interleaving implementation
2023-12-30 21:45:24 -05:00
Marshall Lochbaum
eb34213f0f
Fast ≍˘ for matching-type type-sized cells
2023-12-30 21:45:24 -05:00
dzaima
ce31945124
fix "ab"⍷⟨⟩
2023-12-27 19:16:34 +02:00
dzaima
f0c1962596
more typed ⌾(list⊸⊏)
2023-12-19 17:41:17 +02:00
dzaima
470e77b6b3
more typed 𝔽⌾(m⊸/)
2023-12-15 23:53:26 +02:00
dzaima
72893fc2f5
cell-wise PervasiveDy` highRank
2023-12-15 21:43:07 +02:00
dzaima
66b5c1fc0a
fix a⊒b on mixed-width characters
2023-12-15 20:02:14 +02:00
dzaima
c785b3a7b8
squeeze created arrays in F⍟arr
2023-12-15 18:05:20 +02:00
dzaima
94b1d90995
SSE2 & NEON /⁼
2023-12-14 18:08:56 +02:00
dzaima
f71d2ff376
remove unused name variables
2023-12-14 17:45:04 +02:00
dzaima
653583eb1d
make •Import follow ReBQN
2023-12-11 14:02:38 +02:00
dzaima
b9b90fbe8f
improve error messages of o2i/o2i64/o2u64 & usum
2023-12-05 17:19:36 +02:00
dzaima
9984d720c9
move bit_sum to fold.c
2023-12-05 16:41:38 +02:00
dzaima
a439c64e85
fix error message of usum of i32arr encountering a negative element
2023-12-05 16:03:53 +02:00
dzaima
5c7ab3f9a8
change heuristic for when ⊔ separates filtering out ¯1
...
measurements of the previous one were affected by 08c4627686
2023-12-04 22:50:19 +02:00
dzaima
8870acd2c1
don't try to do 32 >> -1
2023-12-04 17:45:00 +02:00
dzaima
e2db41547d
change threshold for a 𝕨⊐𝕩 case
2023-12-04 17:37:35 +02:00
dzaima
d7c153286e
gc tests, more reuse removal
2023-12-04 12:07:03 +02:00
dzaima
ecb2d5f63a
fix GC referencing bug in reusing 𝕨𝔽`𝕩 by not bothering to reuse
2023-12-04 01:27:38 +02:00
dzaima
609980f950
comment about HashMap entry format
2023-11-29 18:05:08 +02:00
Marshall Lochbaum
72a9a95819
Make sure •HashMap table leaves last entry empty, as a sentinel
2023-11-28 20:08:27 -05:00
Marshall Lochbaum
51027cabe1
Fix GC-after-free with multiple hash resizes
2023-11-28 16:53:45 -05:00
Marshall Lochbaum
53beab531b
•HashMap key and value list compaction and methods to return those lists
2023-11-28 11:09:32 -05:00
Marshall Lochbaum
95f5e65b6c
•HashMap delete with backwards shift; no key/value compaction yet
2023-11-28 10:52:56 -05:00
Marshall Lochbaum
ce9f460e2c
•HashMap count and set functions
2023-11-28 10:33:41 -05:00
Marshall Lochbaum
016e428db6
Always store •HashMap keys and values as HArrs
2023-11-27 19:20:38 -05:00
Marshall Lochbaum
96c7f2eb1a
Move •HashMap implementation details to search.c
2023-11-27 19:20:38 -05:00
Marshall Lochbaum
77bfc7dd1a
Non-resizing static Robin Hood hashmap
2023-11-27 19:20:38 -05:00
Marshall Lochbaum
8edc965686
•HashMap stub with linear lookup
2023-11-27 19:20:38 -05:00
dzaima
e9b7d027ca
cleanup & fix various build types
2023-11-26 16:56:26 +02:00
dzaima
01a60dceff
separate path & name, store path+name+args in state
2023-11-26 16:32:37 +02:00
dzaima
789064140b
use isStr more, include builtin name in bad path messages
2023-11-26 15:37:41 +02:00
dzaima
3f62a51305
system value inheriting
2023-11-26 01:21:11 +02:00
dzaima
a93ea4dbaf
base •ReBQN and •BQN onto outer re
2023-11-25 23:39:58 +02:00
dzaima
5e455372f0
more renaming & shuffling of things
2023-11-25 23:21:32 +02:00
dzaima
7c28c64178
change •BQN and •ReBQN to dynamically-computed functions
2023-11-25 23:21:32 +02:00
dzaima
7214017bb2
move •BQN and •ReBQN to computed sysvals
2023-11-25 23:21:32 +02:00
dzaima
7e0204083e
name re parts
2023-11-25 23:21:32 +02:00
dzaima
7fb8ecfa86
rename things
2023-11-25 23:21:32 +02:00
dzaima
7357820f19
start of compiler state refactoring
2023-11-25 23:21:32 +02:00
dzaima
2b56a300bc
probably make ⊔ able to handle output subarray lengths over 2^32
...
still no support for (≠𝕨)≥2⋆32 though
2023-11-17 00:40:26 +02:00
dzaima
59208af520
remove old group path
...
effectively only got used for f64arr 𝕨; could transform to doing just that, but its inefficient type of the group arrays make it bad for that too
2023-11-13 23:16:02 +02:00
dzaima
f037754880
more specific empty array types
2023-11-13 23:16:02 +02:00
dzaima
8c7a3be036
remove unused includes
2023-11-13 21:48:01 +02:00
Marshall Lochbaum
c94d51dcaf
Fixes for 64-bit usz
2023-11-13 08:24:51 -05:00
dzaima
5910c93fcb
silence some warnings & errors in various build types
2023-11-13 12:54:49 +02:00
Marshall Lochbaum
3a50cda5d3
Specialize Index-of tables on result type
2023-11-10 17:12:37 -05:00
Marshall Lochbaum
7b79dfc94e
Update search implementation comments
2023-11-09 15:20:50 -05:00
Marshall Lochbaum
2c625127d5
Reverse hashed Index-of
2023-11-09 10:39:07 -05:00
Marshall Lochbaum
c75fdbc277
Reverse Member-of hash lookup
2023-11-07 22:07:17 -05:00
Marshall Lochbaum
8a2190b092
64-bit hashes with float normalization
2023-11-07 14:54:16 -05:00
Marshall Lochbaum
c042fe6ca3
Vector binary search for integer Index-of
2023-11-06 15:43:26 -05:00
Marshall Lochbaum
52bca6a55c
Multiple IndexOfOne to search for a few values in a large array
2023-11-06 12:16:59 -05:00
Marshall Lochbaum
d154ece51a
Vector binary search for 16-bit Member-of in addition to 32 (8 is too slow)
2023-11-06 09:37:58 -05:00
Marshall Lochbaum
11245d385e
Vector binary search Member-of
2023-11-05 22:10:39 -05:00
Marshall Lochbaum
8aa6c07199
And hashed 32-bit Progressive Index-of
2023-11-02 20:29:54 -04:00
Marshall Lochbaum
d54621b5dd
Extend hash table to 32-bit Index-of
2023-11-02 12:00:32 -04:00
Marshall Lochbaum
ed03720441
Robin Hood hash table for 32-bit membership
2023-11-01 15:46:45 -04:00
Marshall Lochbaum
ee856a4880
Move hash resizing to a generator, and other refactoring
2023-10-31 22:09:11 -04:00
Marshall Lochbaum
0391cf4ca3
Fast number-character (no matches) searches
2023-10-31 22:09:11 -04:00
Marshall Lochbaum
0fb845d336
Move self-search hash table code to Singeli
2023-10-31 22:09:11 -04:00
dzaima
ad574d2269
refactor & document #define-s, always-available ')gc log' and ')mem log'
2023-10-31 03:16:48 +02:00
dzaima
08c4627686
fix dense case of •rand.Subset not updating seed
2023-10-30 17:03:38 +02:00
dzaima
7ffd744375
reorganize file writing
...
fixes some unclosed file descriptors & files being made on an invalid argument
2023-10-28 19:27:00 +03:00
dzaima
b6594008cd
fix non-Singeli builds
2023-10-26 17:32:12 +03:00
dzaima
577442449d
inverses for •math.Atan2, •math error tests
2023-10-22 14:33:51 +03:00
dzaima
4322303031
Fix 2‿2↕3‿3‿3⥊↕27
2023-10-12 12:43:08 +03:00
dzaima
e7b87f669f
fix arr÷negativeZero, set proper float expected values
2023-09-21 19:03:30 +03:00
dzaima
f6a9c30889
•internal.HeapStats
2023-09-18 23:38:06 +03:00
dzaima
df0ccdf2d7
add error message on missing posix_spawn support in make for-build
2023-09-17 13:39:22 +03:00
dzaima
299168fb16
fast numarr÷scalarPowOf2
2023-09-12 23:57:50 +03:00
dzaima
5efd90cc91
rename elWidthLogBits to something less long & add byte variant
2023-09-12 19:58:56 +03:00
Marshall Lochbaum
d16ba6c3b1
Move xor-scan to scan.singeli; remove neq.singeli
2023-08-26 07:26:33 -04:00
Marshall Lochbaum
e261e80168
SSE min/max and pluswrap scans
2023-08-26 07:26:33 -04:00
Marshall Lochbaum
00c454d37a
Add generic-architecture versions of Singeli scans
2023-08-26 07:26:33 -04:00
dzaima
ec14d45c50
round up pointers in self-search allocs
2023-08-25 04:03:25 +03:00
dzaima
81a291f860
round up some pointers
2023-08-25 03:47:05 +03:00
dzaima
f0d6a65240
move unaligned load/store helpers to stuff.h
...
also replace a NULL with "" to make iBuf+0 not be UB
2023-08-25 03:24:42 +03:00
dzaima
8975f6af00
fast 1|x
2023-08-24 21:32:35 +03:00
dzaima
3e6e158696
native 𝕨⍷𝕩 when 1≥=𝕨 and 2≥=𝕩
2023-08-24 19:46:57 +03:00
dzaima
6eaa9238bc
separate BSDs
2023-08-20 19:33:11 +03:00
dzaima
1bb686a9ff
fix UB in grade.h
2023-08-19 21:48:11 +03:00
dzaima
2732becf50
global STR0/STR1 definitions
2023-08-19 20:12:53 +03:00
dzaima
25c2629842
•platform
...
incl. adding support for REPL completion of •a.b.c (i.e. >1 '.')
2023-08-19 18:25:52 +03:00
dzaima
df56f6b2fc
fix 𝕨•FLines𝕩 with invalid elements in 𝕩
2023-08-13 03:51:06 +03:00
Marshall Lochbaum
2dd3a0fdfa
Boolean compress implementation comments
2023-08-07 15:33:37 -04:00
Marshall Lochbaum
4e9745688b
Use generic boolean Compress as the sparse case with Singeli
2023-08-07 13:47:58 -04:00
Marshall Lochbaum
a7908a10b0
Faster, sparse, non-Singeli boolean Compress
2023-08-07 12:26:40 -04:00
Marshall Lochbaum
056b18edd2
Move pext-based compress loop from C to Singeli
2023-08-05 20:38:54 -04:00
Marshall Lochbaum
7767cf933f
Remove boolean Compress overallocation: not needed with w masked off
2023-08-05 20:38:54 -04:00
dzaima
682d5986d8
slightly more accurate trailing newline removal for •GetLine
2023-08-04 21:09:45 +03:00
dzaima
a1e4f9bd6f
remove multiple trailing newline characters from •GetLine
...
Windows adds \r\n, and without this the \r stays
2023-08-04 20:52:07 +03:00
dzaima
1454ca3a1a
expand & test FFI error checking
2023-07-28 13:59:25 +03:00
dzaima
6e96600878
move unaligned load & store to base.singeli
2023-07-20 00:21:09 +03:00
dzaima
6930bc34b6
further update slash.c implementation comments
2023-07-19 16:51:24 +03:00
Marshall Lochbaum
301a23fb1f
Update where/compress implementation comments
2023-07-19 09:35:40 -04:00
Marshall Lochbaum
64d65ae837
Never use generic dense compress methods if use_table: where is faster
2023-07-18 21:35:12 -04:00
Marshall Lochbaum
68978f7e10
Table-based 1- and 2-byte Where
2023-07-17 16:05:06 -04:00
Marshall Lochbaum
8b297ae2dc
Dedicated 32-bit Singeli where, taking index offset
2023-07-16 21:56:33 -04:00
Marshall Lochbaum
3bd8d1de68
Extend all Singeli Compress methods to do Where
2023-07-16 21:56:33 -04:00
Marshall Lochbaum
4415869496
Generic Singeli where implementation
2023-07-16 21:56:33 -04:00
Marshall Lochbaum
f5121f6806
Thresholds for compress methods (versus sparse) defined in Singeli
2023-07-16 21:56:33 -04:00
Marshall Lochbaum
f852d12a5c
Generic Singeli compress implementation
2023-07-16 21:56:33 -04:00
Marshall Lochbaum
d956ba921b
Non-overwriting 1-byte and 2-byte compress/where
2023-07-16 21:56:33 -04:00
Marshall Lochbaum
8f4b1966cb
Non-overwriting AVX2 4-byte and 8-byte compress, using a buffer
2023-07-16 21:56:33 -04:00
Marshall Lochbaum
0921fc2c62
AVX2 compress implementations using permutevar and lookup tables
2023-07-16 21:56:33 -04:00
Marshall Lochbaum
f315a6d3ea
Emulate pext instruction in Singeli
2023-07-16 21:56:33 -04:00
dzaima
cf6a290e5c
•file.RealPath
2023-07-16 01:42:30 +03:00
dzaima
9cfc3f3f25
various changes on filling arrays with the same element
2023-07-12 16:23:03 +03:00
vylsaz
e4542f70a6
Implement •term.CharN and •term.RawMode for Windows
2023-07-11 03:15:48 +00:00
dzaima
56a1fc3637
use float getting functions for getting floats
2023-07-10 23:48:07 +03:00
dzaima
9b0299d1a5
fix (<1)≠`5⥊1
2023-07-10 23:25:28 +03:00
dzaima
53266ffd88
fix (<1)⌈`↕10
2023-07-10 23:21:36 +03:00
dzaima
acbfcd7302
fix another weird case of 𝕨∾𝕩
2023-07-10 22:55:00 +03:00
dzaima
24fea51bdd
fix unshare of fillslice
2023-07-10 22:55:00 +03:00
dzaima
cd7807fba0
NEON constrep
2023-07-10 17:11:15 +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
6b5815dcc2
fix shape of k/n‿1⥊1
2023-07-10 02:40:36 +03:00
dzaima
8975be082b
fix •ns.Get error message
2023-07-09 15:58:31 +03:00
dzaima
3ae9b14d64
separate arith inits, add comments on init order
2023-06-23 12:10:42 +03:00
dzaima
336f986986
change error messages in ◶
2023-06-12 00:52:09 +03:00
dzaima
934a2b5ae3
rearrange things
2023-06-06 21:44:50 +03:00
dzaima
78bef5fe32
consistent 𝕨⊏𝕩 error messages across argument types
2023-05-30 14:28:36 +03:00
dzaima
5738712bbb
improve environ declaration
2023-05-30 12:52:00 +03:00
dzaima
55e0409582
don't CTZ(0) in gcd
2023-05-24 15:13:25 +03:00
dzaima
3872f5a625
fix 𝕨∾𝕩 reuse logic
2023-05-22 11:40:37 +03:00
dzaima
b093ebbc66
finish PICK_IDX message
2023-05-22 00:18:59 +03:00
dzaima
fd72ea79c8
another gcc warning
2023-05-21 23:39:18 +03:00
dzaima
d6609df820
reserve •CurrentError with namespace 𝕩
2023-05-20 14:28:37 +03:00
dzaima
7f46de18fc
add missed refcount decrements
2023-05-20 01:30:02 +03:00
dzaima
df348896fd
add a NOGC_E for conflicting⌾(list⊸⊏) generic
2023-05-19 22:51:02 +03:00
dzaima
0156d13a5e
proper arrow in error messages of ⌾(n⊸↓) vs ⌾(n⊸↑)
2023-05-19 17:32:46 +03:00
dzaima
a03fab044d
•internal.Keep
2023-05-19 15:41:50 +03:00
dzaima
c1488cbf72
faster arr⌾(is⊸⊏)list
2023-05-19 14:15:25 +03:00
dzaima
f6703df0b2
range calculation functions
2023-05-19 14:01:32 +03:00
dzaima
1ec4415e49
clean up some under functions in sfns.c
2023-05-19 13:15:51 +03:00
dzaima
3977849bc5
fix "_m←¨⋄4 m´⟨⟩" and "4 10´⟨⟩"
2023-05-19 12:58:18 +03:00
Marshall Lochbaum
ed5fac7cc9
Constant and tack cases for Table
2023-05-18 15:11:20 -04:00
Marshall Lochbaum
b5de844736
Constants and tacks with rank, except some dyadic cases
2023-05-18 14:52:13 -04:00
Marshall Lochbaum
7440e2a6bc
Constant and trivial cases for fold/insert
2023-05-18 12:11:49 -04:00
Marshall Lochbaum
9dfeb451f8
Handle empty cells in insert_base; fixes bugs in dyadic Insert
2023-05-18 11:53:53 -04:00
Marshall Lochbaum
a8cead1d3d
Fast cases for tacks, constant operands, and short arguments in scans
2023-05-18 10:54:56 -04:00
Marshall Lochbaum
1ff8954dd3
Fix leak in dyadic •_timed
2023-05-18 10:54:56 -04:00
Marshall Lochbaum
6ac8944b06
Remove redundant isAtm check in constant case of each_c1
2023-05-18 10:54:56 -04:00
dzaima
b46477450d
fix shape of argument passed to F in F⌾(is⊸⊑)
...
& skip computing the argument if not needed
2023-05-18 16:37:24 +03:00
dzaima
0572fcc5b2
native F⌾(list⊸⊑) & ⌾(listOfLists⊸⊑)
2023-05-18 01:54:01 +03:00
dzaima
d310669ae8
unify F⌾(n⊸⊑) and F⌾⊑
2023-05-18 00:27:38 +03:00
dzaima
3047ff48b5
Add rank checks to •FChars & •FLines & •FBytes & •Out
...
& clean up terminology
2023-05-17 21:56:40 +03:00
dzaima
ec106c0b31
better heuristic for 𝕨∊𝕩 comparison-or path
2023-05-17 18:42:24 +03:00
dzaima
e4d222173d
a bunch of fixes for generic architecture & wasm
2023-05-16 00:07:48 +03:00
dzaima
65868a51ba
use the type of the correct argument in check
2023-05-13 02:19:10 +03:00
dzaima
f0a9714e8b
copy result in tbl_c2 if needed
2023-05-13 00:33:22 +03:00
dzaima
a9478f802f
tuning for arithmetic leading axis, F⌜, and reshape-based ⎉
2023-05-13 00:33:22 +03:00
dzaima
6dc24bd99b
free arguments of SIMD 𝕨∊𝕩 & ∊𝕩
2023-05-12 13:51:30 +03:00
Marshall Lochbaum
25883b410c
Retune boundary for small-𝕩 linear Member Of
2023-05-11 21:11:43 -04:00
Marshall Lochbaum
464dd27a37
SIMD table intialization for Index-of
2023-05-11 21:05:24 -04:00
Marshall Lochbaum
844b537593
Singeli 1-byte table implementations for generic architecture
2023-05-11 21:05:23 -04:00
Marshall Lochbaum
6c81fb3149
Make AVX2 deduplicate branchless
2023-05-11 21:04:58 -04:00
Marshall Lochbaum
1700d84740
AVX2 1-byte Deduplicate implementation
2023-05-11 21:04:58 -04:00
Marshall Lochbaum
9c7c6aabc5
AVX2 Mark Firsts implementation
2023-05-11 21:04:56 -04:00
Marshall Lochbaum
017e2433fb
Fast paths for all empty-argument search cases
2023-05-11 20:59:53 -04:00
Marshall Lochbaum
0232f91582
AVX2 bit table Member-of
2023-05-11 20:59:52 -04:00
dzaima
03a28e4e34
fix float normalization from a •bit._cast result mutating the original
2023-05-11 22:39:59 +03:00
dzaima
53bacf00c8
native F⟜k⁼𝕩 & k⊸F⁼𝕩
2023-05-11 15:28:40 +03:00