Newest at the top
| 2025-03-12 23:58:39 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-03-12 23:57:54 +0100 | sord937 | (~sord937@gateway/tor-sasl/sord937) (Quit: sord937) |
| 2025-03-12 23:57:26 +0100 | ystael | (~ystael@user/ystael) (Ping timeout: 265 seconds) |
| 2025-03-12 23:56:00 +0100 | infohazards | (~user@user/fmira) (Ping timeout: 264 seconds) |
| 2025-03-12 23:53:17 +0100 | __monty__ | (~toonn@user/toonn) (Quit: leaving) |
| 2025-03-12 23:47:51 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 252 seconds) |
| 2025-03-12 23:46:02 +0100 | catties | Catty |
| 2025-03-12 23:43:16 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-03-12 23:41:20 +0100 | <EvanR> | and guess at why or why not |
| 2025-03-12 23:41:07 +0100 | <EvanR> | or is it like, write code, try it, see if it's faster |
| 2025-03-12 23:40:54 +0100 | <EvanR> | juri_, are there any debuggers or simulators that can help with that? |
| 2025-03-12 23:36:23 +0100 | alfiee | (~alfiee@user/alfiee) (Ping timeout: 244 seconds) |
| 2025-03-12 23:34:55 +0100 | Smiles | (uid551636@id-551636.lymington.irccloud.com) Smiles |
| 2025-03-12 23:33:48 +0100 | Inst | (~Inst@user/Inst) (Remote host closed the connection) |
| 2025-03-12 23:32:19 +0100 | tabaqui | (~root@167.71.80.236) tabaqui |
| 2025-03-12 23:32:02 +0100 | alfiee | (~alfiee@user/alfiee) alfiee |
| 2025-03-12 23:31:59 +0100 | tabaqui | (~root@167.71.80.236) (Client Quit) |
| 2025-03-12 23:31:53 +0100 | tabaqui | (~root@167.71.80.236) tabaqui |
| 2025-03-12 23:31:46 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 248 seconds) |
| 2025-03-12 23:30:19 +0100 | Tuplanolla | (~Tuplanoll@91-159-69-59.elisa-laajakaista.fi) Tuplanolla |
| 2025-03-12 23:27:29 +0100 | sdrfan123 | (~sdrfan123@2607:fb90:ad22:c6ba:1965:cecd:386e:8114) (Quit: Client closed) |
| 2025-03-12 23:27:14 +0100 | dibblego | (~dibblego@haskell/developer/dibblego) dibblego |
| 2025-03-12 23:27:14 +0100 | dibblego | (~dibblego@116-255-1-119.ip4.superloop.au) (Changing host) |
| 2025-03-12 23:27:13 +0100 | dibblego | (~dibblego@116-255-1-119.ip4.superloop.au) |
| 2025-03-12 23:26:03 +0100 | dibblego | (~dibblego@haskell/developer/dibblego) (Ping timeout: 244 seconds) |
| 2025-03-12 23:25:15 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-03-12 23:18:13 +0100 | Smiles | (uid551636@id-551636.lymington.irccloud.com) (Quit: Connection closed for inactivity) |
| 2025-03-12 23:15:38 +0100 | michalz | (~michalz@185.246.207.205) (Remote host closed the connection) |
| 2025-03-12 23:14:08 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 252 seconds) |
| 2025-03-12 23:12:32 +0100 | <Inst> | it's doing it simultaneously |
| 2025-03-12 23:11:07 +0100 | <EvanR> | one which lets you forget parts you don't need anymore, before the whole tree is created |
| 2025-03-12 23:10:52 +0100 | <EvanR> | lined up |
| 2025-03-12 23:10:48 +0100 | <EvanR> | because you get better laziness by having a plan lined for consuming the tree |
| 2025-03-12 23:10:18 +0100 | <EvanR> | is it populating an actual data structure before doing anything else |
| 2025-03-12 23:09:50 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-03-12 23:09:33 +0100 | Square2 | (~Square4@user/square) (Ping timeout: 245 seconds) |
| 2025-03-12 23:09:06 +0100 | yegorc | (~yegorc@user/yegorc) yegorc |
| 2025-03-12 23:08:20 +0100 | <Inst> | but honestly, tbh, the vision in my head of this tree lazily being populated outwards from the bottom left corner is beautiful |
| 2025-03-12 23:07:46 +0100 | <Inst> | i'm just doing exercises, i have a strong feeling and others have suggested what i'm trying to do is dumb |
| 2025-03-12 23:06:40 +0100 | Square | (~Square@user/square) Square |
| 2025-03-12 23:06:22 +0100 | <juri_> | (source: I write ~AVX512 assembly by hand, to make LLMs go faster) |
| 2025-03-12 23:05:45 +0100 | <juri_> | the real problem is: modern computers have an architecture that looks uniform from one angle, but if you get out a stopwatch... has layers of caches, dumb rules, and in order to get real performance, you need to almost hand compile, and back, just so you get your units-of-work in the right sizes for all of the different cache subsystems. |
| 2025-03-12 23:04:14 +0100 | Inst | (~Inst@user/Inst) Inst |
| 2025-03-12 23:04:11 +0100 | <EvanR> | :( |
| 2025-03-12 23:03:39 +0100 | <juri_> | oh, it's much more complicated than that. :) |
| 2025-03-12 23:03:38 +0100 | takuan | (~takuan@d8D86B601.access.telenet.be) (Remote host closed the connection) |
| 2025-03-12 23:03:02 +0100 | <EvanR> | I guess IRL you would also want to align your power of 2 size array/vector with the cache lines |
| 2025-03-12 23:02:39 +0100 | sdrfan123 | (~sdrfan123@2607:fb90:ad22:c6ba:1965:cecd:386e:8114) |
| 2025-03-12 23:01:54 +0100 | <juri_> | they use Vector internally, but wrap that in an interesting interface. |
| 2025-03-12 23:01:14 +0100 | Inst | (~Inst@user/Inst) (Remote host closed the connection) |