|
02:46
ilogger2 left
02:58
ilogger2 joined
15:07
harrow left
15:23
harrow joined
18:32
ilogger2 left,
ilogger2 joined
19:13
Geth__ joined
19:18
jjatria left,
Geth left
19:19
jjatria joined
|
|||
| patrickb | still on my list to get the windows build tool chain for libffi running | 19:25 | |
|
19:39
MasterDuke joined
19:40
MasterDuke left
19:41
MasterDuke joined
19:44
MasterDuke left,
MasterDuke joined
|
|||
| MasterDuke | well, that was annoying of firefox | 19:45 | |
| timo: have you looked at github.com/MoarVM/MoarVM/pull/1967 ? | |||
| in addition to adding the windows build, the non-windows build needs some `make` trickery | 19:46 | ||
| timo | not yet, sorry. for right now I have to spend a bit of time rescuing data from a failing drive | 19:51 | |
| MasterDuke | !! | 19:53 | |
| there's definitely no particular urgency | |||
| timo: btw, another item of no urgency. i recently got to use a bloom filter (well, i started with that and then upgraded to the new hotness of a binary fuse filter) for the first time at work. made me really excited since i wanted to find a use for one ever since i first read about them years ago. but then i got to wondering if there's any place in | 20:00 | ||
| moarvm where one would be beneficial? nothing jumped out at me, but i figure you're 100x more likely to have a good idea | |||
| timo | i haven't heard of "binary fuse filter" yet | ||
| MasterDuke | arxiv.org/abs/2201.01174 | 20:03 | |
| timo | as long as it's a probabilistic data structure that can give you "definitely not" vs "maybe yes", it'd have the same use cases I think | 20:06 | |
| MasterDuke | yep. slight difference in that binary fuse filters require all the keys in one go during construction and are immutable after being built, but pretty much the same otherwise | 20:07 | |
| off to go move some boxes around, but thought i'd try to nerd snipe you with those two things | 20:18 | ||
|
20:22
MasterDuke left
|
|||
| Voldenet | the problem with all xor filters is that they're immutable after construction, so adding an item recomputes the whole filter | 21:36 | |
| same with binary fuse | |||
| I still like bloom filters for having .add operation, despite being a lot larger | 21:37 | ||
| timo | bloom filters don't have to be large! you can have just a single bit! in fact, then you can answer any query at compile time already | 21:38 | |