Newest at the top
| 2025-11-08 17:27:37 +0100 | Lord_of_Life | (~Lord@user/lord-of-life/x-2819915) (Ping timeout: 264 seconds) |
| 2025-11-08 17:26:30 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-11-08 17:19:09 +0100 | <SrPx> | it is really annoying that there is no way in Haskell to create a map from Int to a user-defined ADT that 1. indexing is O(1) and as fast as array, 2. has O(1) initialization. in C, we can mmap an array of pointers and achieve that just fine. in Haskell, native arrays have O(N) initialization and O(1) indexing, and IntMap has O(1) initialization but O(log(N)) indexing... |
| 2025-11-08 17:16:04 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 260 seconds) |
| 2025-11-08 17:10:43 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-11-08 17:04:16 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 265 seconds) |
| 2025-11-08 17:02:39 +0100 | CiaoSen | (~Jura@2a02:8071:64e1:da0:5a47:caff:fe78:33db) (Ping timeout: 260 seconds) |
| 2025-11-08 17:01:37 +0100 | annamalai | (~annamalai@157.33.208.56) (Ping timeout: 250 seconds) |
| 2025-11-08 17:00:17 +0100 | Pozyomka | (~pyon@user/pyon) (Quit: WeeChat 4.7.1) |
| 2025-11-08 16:58:13 +0100 | talismanick | (~user@2601:644:937c:ed10::b832) talismanick |
| 2025-11-08 16:57:20 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-11-08 16:48:19 +0100 | Square3 | (~Square@user/square) Square |
| 2025-11-08 16:46:49 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 264 seconds) |
| 2025-11-08 16:41:31 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-11-08 16:39:29 +0100 | humasect | (~humasect@dyn-192-249-132-90.nexicom.net) (Remote host closed the connection) |
| 2025-11-08 16:39:24 +0100 | humasect | (~humasect@dyn-192-249-132-90.nexicom.net) |
| 2025-11-08 16:30:20 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 245 seconds) |
| 2025-11-08 16:26:09 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-11-08 16:26:01 +0100 | <EvanR> | so the text version of the value appears like a legitimate expression which would compute it |
| 2025-11-08 16:25:02 +0100 | <EvanR> | to the rest |
| 2025-11-08 16:24:49 +0100 | <EvanR> | requires "fromList" then applies fromList |
| 2025-11-08 16:24:03 +0100 | <EvanR> | "skip" ? |
| 2025-11-08 16:19:49 +0100 | bitdex | (~bitdex@gateway/tor-sasl/bitdex) bitdex |
| 2025-11-08 16:16:29 +0100 | <haskellbridge> | <Morj> *the case in the past |
| 2025-11-08 16:16:25 +0100 | <tomsmeding> | that would've been a bug then :p |
| 2025-11-08 16:16:16 +0100 | <haskellbridge> | <Morj> Oh it does skip fromList? I'm almost sure this wasn't the case =) |
| 2025-11-08 16:15:42 +0100 | Googulator72 | (~Googulato@77-234-89-36.pool.digikabel.hu) (Quit: Client closed) |
| 2025-11-08 16:15:38 +0100 | Googulator77 | (~Googulato@2a01-036d-0106-0180-8127-ba79-55a7-6f29.pool6.digikabel.hu) |
| 2025-11-08 16:15:28 +0100 | wootehfoot | (~wootehfoo@user/wootehfoot) (Read error: Connection reset by peer) |
| 2025-11-08 16:15:10 +0100 | <tomsmeding> | https://hackage-content.haskell.org/package/unordered-containers-0.2.20.1/docs/src/Data.HashMap.In… |
| 2025-11-08 16:15:07 +0100 | <tomsmeding> | what's the problem? |
| 2025-11-08 16:14:55 +0100 | <EvanR> | right |
| 2025-11-08 16:14:50 +0100 | <EvanR> | it comes out like fromList [(k1,v1),(k2,v2),...] |
| 2025-11-08 16:14:25 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 264 seconds) |
| 2025-11-08 16:14:19 +0100 | <haskellbridge> | <Morj> I'm almost sure you can't read HashMap's show (= |
| 2025-11-08 16:14:05 +0100 | hiecaq | (~hiecaq@user/hiecaq) (Remote host closed the connection) |
| 2025-11-08 16:14:02 +0100 | <EvanR> | haha yeah |
| 2025-11-08 16:13:46 +0100 | <tomsmeding> | (actually no it isn't) |
| 2025-11-08 16:13:40 +0100 | tomsmeding | . o O ( Show/Read is a perfectly viable file format ) |
| 2025-11-08 16:13:20 +0100 | <haskellbridge> | <Morj> Interesting point. But a lot of logging uses Text as well, so one might think it's just a quality of life improvement |
| 2025-11-08 16:12:34 +0100 | <EvanR> | and Show is for "debugging" |
| 2025-11-08 16:12:22 +0100 | <EvanR> | since Text is more serious and String is often used for informal / throw away / demonstration code |
| 2025-11-08 16:11:35 +0100 | <EvanR> | "optimality" aside my first thought was is this expanding the encouraged uses cases for Show |
| 2025-11-08 16:11:31 +0100 | <haskellbridge> | <Morj> It's hard to do otherwise when Show is in base, and text isn't |
| 2025-11-08 16:10:46 +0100 | <haskellbridge> | <Morj> I did hope a little that it would be more optimal, but this is exactly the same as my current situation with tshow |
| 2025-11-08 16:09:43 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-11-08 16:09:36 +0100 | <EvanR> | mmkay |
| 2025-11-08 16:08:56 +0100 | <EvanR> | show = pack . P.show |
| 2025-11-08 16:03:22 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 260 seconds) |
| 2025-11-08 15:58:19 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |