Newest at the top
| 2025-12-05 21:07:23 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-12-05 21:06:33 +0100 | fgarcia | (~lei@user/fgarcia) (Quit: Remote host closed the connection) |
| 2025-12-05 21:06:29 +0100 | myme | (~myme@2a01:799:d5e:5f00:b47a:83fd:4eab:92be) myme |
| 2025-12-05 21:06:13 +0100 | CiaoSen | (~Jura@2a02:8071:64e1:da0:5a47:caff:fe78:33db) CiaoSen |
| 2025-12-05 21:05:14 +0100 | <[exa]> | and a veeeeeery wide lower lever |
| 2025-12-05 21:05:10 +0100 | myme | (~myme@2a01:799:d5e:5f00:a10a:6bc:6be7:9209) (Ping timeout: 244 seconds) |
| 2025-12-05 21:04:38 +0100 | <[exa]> | yeah afaik the usual rope structures kinda look like B-trees, with size annotations to allow fast seeks |
| 2025-12-05 21:03:37 +0100 | Square2 | (~Square@user/square) (Ping timeout: 264 seconds) |
| 2025-12-05 21:03:00 +0100 | <EvanR> | then you open a giant file with no newlines and it freezes the computer |
| 2025-12-05 21:02:24 +0100 | <EvanR> | it seems like a text editor could get away with an ordered set of lines, and the lines are packed? for most usecases |
| 2025-12-05 21:01:15 +0100 | AlexNoo | (~AlexNoo@85.174.183.177) |
| 2025-12-05 21:01:07 +0100 | <c_wraith> | I mean, you probably want some kind of B-Tree or something |
| 2025-12-05 21:01:04 +0100 | williu5 | (~williu5@user/williu5) (Quit: WeeChat 4.7.1) |
| 2025-12-05 21:00:53 +0100 | AlexNoo | (~AlexNoo@85.174.183.177) (Read error: Connection reset by peer) |
| 2025-12-05 20:53:20 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 240 seconds) |
| 2025-12-05 20:47:30 +0100 | trickard_ | (~trickard@cpe-85-98-47-163.wireline.com.au) |
| 2025-12-05 20:47:17 +0100 | trickard_ | (~trickard@cpe-85-98-47-163.wireline.com.au) (Read error: Connection reset by peer) |
| 2025-12-05 20:46:42 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-12-05 20:46:10 +0100 | michalz | (~michalz@185.246.207.203) |
| 2025-12-05 20:38:07 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 264 seconds) |
| 2025-12-05 20:37:28 +0100 | trickard_ | (~trickard@cpe-85-98-47-163.wireline.com.au) |
| 2025-12-05 20:37:15 +0100 | trickard_ | (~trickard@cpe-85-98-47-163.wireline.com.au) (Read error: Connection reset by peer) |
| 2025-12-05 20:33:32 +0100 | acidjnk | (~acidjnk@p200300d6e717191679d48b614f527e93.dip0.t-ipconnect.de) acidjnk |
| 2025-12-05 20:33:02 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-12-05 20:31:05 +0100 | Lord_of_Life_ | Lord_of_Life |
| 2025-12-05 20:30:32 +0100 | Lord_of_Life | (~Lord@user/lord-of-life/x-2819915) (Ping timeout: 240 seconds) |
| 2025-12-05 20:30:02 +0100 | gorignak | (~gorignak@user/gorignak) (Ping timeout: 244 seconds) |
| 2025-12-05 20:29:45 +0100 | Lord_of_Life_ | (~Lord@user/lord-of-life/x-2819915) Lord_of_Life |
| 2025-12-05 20:22:08 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 256 seconds) |
| 2025-12-05 20:17:15 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-12-05 20:15:18 +0100 | trickard_ | (~trickard@cpe-85-98-47-163.wireline.com.au) |
| 2025-12-05 20:14:52 +0100 | trickard_ | (~trickard@cpe-85-98-47-163.wireline.com.au) (Ping timeout: 246 seconds) |
| 2025-12-05 20:06:47 +0100 | acidjnk | (~acidjnk@p200300d6e7171916e981ce74d2c64e2e.dip0.t-ipconnect.de) (Ping timeout: 244 seconds) |
| 2025-12-05 20:06:37 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 264 seconds) |
| 2025-12-05 20:01:27 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-12-05 19:58:06 +0100 | <[exa]> | (editors like yi or so) |
| 2025-12-05 19:56:06 +0100 | <[exa]> | maybe check out what text editors use, they should have some kind of related rope structure |
| 2025-12-05 19:54:26 +0100 | <haskellbridge> | <Zemyla> The best example is Bool, where a Node (Node (Node Bool)), which can contain between 8 and 27 Bools, can fit in a Word32 because its length is at most 5 bits. |
| 2025-12-05 19:54:07 +0100 | bggd | (~bgg@2a01:e0a:fd5:f510:b178:c96:453a:4d0f) (Quit: std::move) |
| 2025-12-05 19:53:44 +0100 | <haskellbridge> | <Zemyla> Well, it'd allow tighter packing in a number of instances. |
| 2025-12-05 19:50:31 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 240 seconds) |
| 2025-12-05 19:49:49 +0100 | <[exa]> | C++esque deque comes to mind as useful alternative |
| 2025-12-05 19:45:41 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-12-05 19:45:08 +0100 | <tomsmeding> | (I guess it might help a little) |
| 2025-12-05 19:44:41 +0100 | <tomsmeding> | there's so many pointers in there that one extra pointer to the elements is hardly the performance bottleneck |
| 2025-12-05 19:44:19 +0100 | <tomsmeding> | Zemyla: do you mean Data.Seq, i.e. finger trees? |
| 2025-12-05 19:38:57 +0100 | Googulator | (~Googulato@team.broadbit.hu) (Ping timeout: 250 seconds) |
| 2025-12-05 19:38:31 +0100 | humasect | (~humasect@dyn-192-249-132-90.nexicom.net) (Remote host closed the connection) |
| 2025-12-05 19:37:28 +0100 | itaipu | (~itaipu@168.121.97.28) itaipu |
| 2025-12-05 19:36:15 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 240 seconds) |