Newest at the top
| 2025-12-23 17:38:22 +0100 | CiaoSen | (~Jura@2a02:8071:64e1:da0:5a47:caff:fe78:33db) (Ping timeout: 246 seconds) |
| 2025-12-23 17:36:43 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn |
| 2025-12-23 17:34:56 +0100 | cyphase | (~cyphase@user/cyphase) (Ping timeout: 240 seconds) |
| 2025-12-23 17:32:35 +0100 | Digitteknohippie | Digit |
| 2025-12-23 17:30:54 +0100 | tromp | (~textual@2001:1c00:3487:1b00:7dcc:b6c2:83dc:ef69) (Quit: My iMac has gone to sleep. ZZZzzz…) |
| 2025-12-23 17:30:19 +0100 | lucabtz | (~lucabtz@user/lucabtz) (Quit: Lost terminal) |
| 2025-12-23 17:26:28 +0100 | distopico | (~cerdolibr@xvm-111-150.dc2.ghst.net) distopico |
| 2025-12-23 17:26:13 +0100 | Googulator63 | (~Googulato@2a01-036d-0106-48e4-3c18-a4bd-1bda-7c8b.pool6.digikabel.hu) (Quit: Client closed) |
| 2025-12-23 17:26:08 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 260 seconds) |
| 2025-12-23 17:25:48 +0100 | Googulator9 | (~Googulato@80-95-87-105.pool.digikabel.hu) |
| 2025-12-23 17:25:19 +0100 | L29Ah | (~L29Ah@wikipedia/L29Ah) (Ping timeout: 240 seconds) |
| 2025-12-23 17:20:57 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn |
| 2025-12-23 17:19:09 +0100 | Digitteknohippie | (~user@user/digit) Digit |
| 2025-12-23 17:19:07 +0100 | Digit | (~user@user/digit) (Ping timeout: 255 seconds) |
| 2025-12-23 17:16:33 +0100 | trickard_ | (~trickard@cpe-80-98-47-163.wireline.com.au) |
| 2025-12-23 17:14:44 +0100 | LaurentH | (~LaurentH@e7-72-0-245-18.dynamic.sthy.maskatel.ca) |
| 2025-12-23 17:14:27 +0100 | Axman6 | (~Axman6@user/axman6) (Ping timeout: 250 seconds) |
| 2025-12-23 17:14:02 +0100 | trickard | (~trickard@cpe-80-98-47-163.wireline.com.au) (Read error: Connection reset by peer) |
| 2025-12-23 17:13:26 +0100 | pavonia | (~user@user/siracusa) (Quit: Bye!) |
| 2025-12-23 17:13:14 +0100 | L29Ah | (~L29Ah@wikipedia/L29Ah) L29Ah |
| 2025-12-23 17:10:13 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 264 seconds) |
| 2025-12-23 17:05:07 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn |
| 2025-12-23 16:56:25 +0100 | <haskellbridge> | <Morj> Not pointfree enough, but oh well |
| 2025-12-23 16:56:14 +0100 | <haskellbridge> | <Morj> Hm, pretty good! |
| 2025-12-23 16:54:09 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 252 seconds) |
| 2025-12-23 16:51:33 +0100 | xff0x | (~xff0x@2405:6580:b080:900:1f2a:d9f9:9fbc:2d4) |
| 2025-12-23 16:49:46 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn |
| 2025-12-23 16:46:05 +0100 | CiaoSen | (~Jura@2a02:8071:64e1:da0:5a47:caff:fe78:33db) CiaoSen |
| 2025-12-23 16:43:13 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 264 seconds) |
| 2025-12-23 16:38:45 +0100 | xff0x | (~xff0x@2405:6580:b080:900:c301:8873:661e:4742) (Ping timeout: 252 seconds) |
| 2025-12-23 16:38:21 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn |
| 2025-12-23 16:35:37 +0100 | <yahb2> | partitionEithers . map \case{ (a, []) -> Left a; (a, x:xs) -> Right (a, x:|xs) } ; :: [(a1, [a2])] -> ([a1], [(a1, NonEmpty a2)]) |
| 2025-12-23 16:35:37 +0100 | <Leary> | % :t partitionEithers . map \case{ (a, []) -> Left a; (a, x:xs) -> Right (a, x:|xs) } |
| 2025-12-23 16:32:48 +0100 | L29Ah | (~L29Ah@wikipedia/L29Ah) () |
| 2025-12-23 16:31:03 +0100 | FloorCalc | (~user@user/FloorCalc) (Remote host closed the connection) |
| 2025-12-23 16:30:40 +0100 | kayvank | (~kayvan@52-119-115-185.PUBLIC.monkeybrains.net) (Remote host closed the connection) |
| 2025-12-23 16:27:31 +0100 | <haskellbridge> | <Morj> Though ugh, currently I do two passes: first find empty lists in one, then the second to leave only non-empty. I doubt that I can partition in single pass with just combinators, without writing a recursion myself. Hm |
| 2025-12-23 16:27:19 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 240 seconds) |
| 2025-12-23 16:24:53 +0100 | LaurentH | (~LaurentH@e7-72-0-245-18.dynamic.sthy.maskatel.ca) (Ping timeout: 272 seconds) |
| 2025-12-23 16:23:08 +0100 | poscat | (~poscat@user/poscat) poscat |
| 2025-12-23 16:22:52 +0100 | <haskellbridge> | <Morj> Though it warrants a comment for future readers for sure |
| 2025-12-23 16:22:33 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn |
| 2025-12-23 16:22:33 +0100 | <haskellbridge> | <Morj> And it's convenient to transform a [(ByteString, [ByteString])] into [(ByteString, NonEmpty ByteString)] via a simple `mapMaybe (traverse nonEmpty)` |
| 2025-12-23 16:21:32 +0100 | <haskellbridge> | <Morj> I'm rewriting my code from lists to NonEmpty (because I updated base and now a bunch of prelude functions throw warnings about being partial, so this started a fire under my ass where I was lazy before) |
| 2025-12-23 16:20:49 +0100 | <haskellbridge> | <Morj> I just used a traversable instance for 2-tuples |
| 2025-12-23 16:20:35 +0100 | L29Ah | (~L29Ah@wikipedia/L29Ah) L29Ah |
| 2025-12-23 16:20:23 +0100 | poscat | (~poscat@user/poscat) (Remote host closed the connection) |
| 2025-12-23 16:16:29 +0100 | Googulator63 | (~Googulato@2a01-036d-0106-48e4-3c18-a4bd-1bda-7c8b.pool6.digikabel.hu) |
| 2025-12-23 16:16:15 +0100 | Googulator63 | (~Googulato@2a01-036d-0106-48e4-3c18-a4bd-1bda-7c8b.pool6.digikabel.hu) (Quit: Client closed) |
| 2025-12-23 16:16:12 +0100 | distopico | (~cerdolibr@xvm-111-150.dc2.ghst.net) (Ping timeout: 252 seconds) |