Newest at the top
| 2025-09-22 13:45:07 +0200 | tromp | (~textual@2001:1c00:3487:1b00:8133:8e8f:3459:47e4) (Quit: My iMac has gone to sleep. ZZZzzz…) |
| 2025-09-22 13:41:30 +0200 | trickard_ | trickard |
| 2025-09-22 13:38:46 +0200 | arandombit | (~arandombi@user/arandombit) (Ping timeout: 255 seconds) |
| 2025-09-22 13:35:41 +0200 | Googulator95 | (~Googulato@2a01-036d-0106-0744-4151-2ee3-78cb-4ad2.pool6.digikabel.hu) |
| 2025-09-22 13:35:37 +0200 | Googulator24 | (~Googulato@2a01-036d-0106-0744-4151-2ee3-78cb-4ad2.pool6.digikabel.hu) (Quit: Client closed) |
| 2025-09-22 13:34:06 +0200 | arandombit | (~arandombi@user/arandombit) arandombit |
| 2025-09-22 13:33:59 +0200 | ouilemur | (~jgmerritt@user/ouilemur) ouilemur |
| 2025-09-22 13:33:40 +0200 | Lord_of_Life_ | Lord_of_Life |
| 2025-09-22 13:32:46 +0200 | inline_ | (~inline@ip-005-146-196-132.um05.pools.vodafone-ip.de) (Quit: Leaving) |
| 2025-09-22 13:31:55 +0200 | Lord_of_Life | (~Lord@user/lord-of-life/x-2819915) (Ping timeout: 250 seconds) |
| 2025-09-22 13:31:40 +0200 | <merijn> | [exa]: In general arrays/vectors are very hard to beat for graph algorithms :p |
| 2025-09-22 13:30:50 +0200 | Lord_of_Life_ | (~Lord@user/lord-of-life/x-2819915) Lord_of_Life |
| 2025-09-22 13:28:05 +0200 | fp1 | (~Thunderbi@130.233.53.240) (Ping timeout: 265 seconds) |
| 2025-09-22 13:24:48 +0200 | Guest77 | (~Guest77@2803:9400:454a:1e81:f12b:330c:3ff6:cee3) |
| 2025-09-22 13:24:29 +0200 | Googulator24 | (~Googulato@2a01-036d-0106-0744-4151-2ee3-78cb-4ad2.pool6.digikabel.hu) |
| 2025-09-22 13:24:13 +0200 | Googulator24 | (~Googulato@2a01-036d-0106-0744-4151-2ee3-78cb-4ad2.pool6.digikabel.hu) (Quit: Client closed) |
| 2025-09-22 13:24:08 +0200 | Athas | (athas@2a01:7c8:aaac:1cf:d153:5501:dd03:4891) |
| 2025-09-22 13:23:56 +0200 | Athas | (athas@2a01:7c8:aaac:1cf:d66b:b110:e135:a326) (Quit: ZNC 1.9.1 - https://znc.in) |
| 2025-09-22 13:15:45 +0200 | Googulator18 | (~Googulato@2a01-036d-0106-0744-4151-2ee3-78cb-4ad2.pool6.digikabel.hu) (Quit: Client closed) |
| 2025-09-22 13:15:43 +0200 | Googulator24 | (~Googulato@2a01-036d-0106-0744-4151-2ee3-78cb-4ad2.pool6.digikabel.hu) |
| 2025-09-22 13:15:28 +0200 | xff0x | (~xff0x@2405:6580:b080:900:58c5:f92c:e5e0:d47f) |
| 2025-09-22 13:14:56 +0200 | trickard_ | (~trickard@cpe-49-98-47-163.wireline.com.au) |
| 2025-09-22 13:14:43 +0200 | trickard | (~trickard@cpe-49-98-47-163.wireline.com.au) (Read error: Connection reset by peer) |
| 2025-09-22 13:07:00 +0200 | <jreicher> | And that's especially true for infinitary expressions. |
| 2025-09-22 13:06:37 +0200 | <jreicher> | [exa]: Take this with a grain of salt, because my experience is still too limited, but I've found implicit graphs better if you manage one "paradigm shift": forget about the graph, and try to make precise the access functions. The structure is implied by those functions if you get them right. |
| 2025-09-22 13:06:07 +0200 | dontdieych | (~dontdieyc@132.226.169.184) dontdieych |
| 2025-09-22 13:05:53 +0200 | dontdieych | (~dontdieyc@132.226.169.184) (Remote host closed the connection) |
| 2025-09-22 13:05:51 +0200 | arandombit | (~arandombi@user/arandombit) (Ping timeout: 265 seconds) |
| 2025-09-22 13:04:45 +0200 | bitdex | (~bitdex@gateway/tor-sasl/bitdex) bitdex |
| 2025-09-22 13:04:21 +0200 | bitdex | (~bitdex@gateway/tor-sasl/bitdex) (Remote host closed the connection) |
| 2025-09-22 13:03:30 +0200 | mari88678 | (~mari-este@user/mari-estel) () |
| 2025-09-22 13:01:29 +0200 | arandombit | (~arandombi@user/arandombit) arandombit |
| 2025-09-22 12:58:58 +0200 | fp2 | fp1 |
| 2025-09-22 12:58:13 +0200 | trickard_ | trickard |
| 2025-09-22 12:58:11 +0200 | <tomsmeding> | not sure if that helps at all |
| 2025-09-22 12:57:57 +0200 | <tomsmeding> | then going down is just following a single pointer, and going up goes through a bunch of administration |
| 2025-09-22 12:57:40 +0200 | <tomsmeding> | [exa]: perhaps the main tree could be a regular-old tree, but you have a separate Map from some node ID to the corresponding tree node, and backlinks are IDs where you have to go through the Map to find the tree node? |
| 2025-09-22 12:56:56 +0200 | <[exa]> | (that's quite stupidest on the whole suffix tree algorithm tho, it looks SO MUCH like a fingertree walk, except it's not) |
| 2025-09-22 12:56:42 +0200 | fp2 | (~Thunderbi@130.233.53.240) fp |
| 2025-09-22 12:56:41 +0200 | <tomsmeding> | even DAGs are not trees, but they're a bit closer |
| 2025-09-22 12:56:38 +0200 | fp1 | (~Thunderbi@2001:708:20:1406::10c5) (Read error: Connection reset by peer) |
| 2025-09-22 12:56:22 +0200 | <[exa]> | yeah looks like I'll try to somehow reinvent the algorithm with trees |
| 2025-09-22 12:56:04 +0200 | <tomsmeding> | so there is a fundamental impedance mismatch that you have to overcome somehow |
| 2025-09-22 12:55:49 +0200 | <tomsmeding> | cyclic graphs are not trees |
| 2025-09-22 12:55:44 +0200 | <tomsmeding> | nice functional programming is all about trees |
| 2025-09-22 12:55:15 +0200 | <[exa]> | ok nvm, I take that any improvement over the vectors is hard, thanks for confirming tho :) |
| 2025-09-22 12:54:44 +0200 | <[exa]> | yeah and the former in my case is just a slower ST vector... :D |
| 2025-09-22 12:54:41 +0200 | fp1 | (~Thunderbi@2001:708:20:1406::10c5) fp |
| 2025-09-22 12:53:23 +0200 | <tomsmeding> | the former is cumbersome, but it has the very big selling point that it... works |
| 2025-09-22 12:53:02 +0200 | <tomsmeding> | the latter is _extremely_ hard to work with |