Newest at the top
| 2026-01-22 05:50:13 +0100 | jmcantrell_ | jmcantrell |
| 2026-01-22 05:49:53 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 265 seconds) |
| 2026-01-22 05:45:53 +0100 | Googulator | (~Googulato@2a01-036d-0106-030a-8d41-f550-2a4f-1a91.pool6.digikabel.hu) (Quit: Client closed) |
| 2026-01-22 05:45:41 +0100 | Googulator43 | (~Googulato@2a01-036d-0106-030a-8d41-f550-2a4f-1a91.pool6.digikabel.hu) |
| 2026-01-22 05:44:47 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn |
| 2026-01-22 05:33:54 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 256 seconds) |
| 2026-01-22 05:31:31 +0100 | humasect | (~humasect@dyn-192-249-132-90.nexicom.net) (Remote host closed the connection) |
| 2026-01-22 05:31:27 +0100 | <haskellbridge> | <iqubic (she/her)> What the fuck is that lens fuckery? |
| 2026-01-22 05:26:45 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn |
| 2026-01-22 05:15:49 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 246 seconds) |
| 2026-01-22 05:13:54 +0100 | cupnoodle | (~cupnoodle@223.187.121.96) (Quit: Lost terminal) |
| 2026-01-22 05:11:01 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn |
| 2026-01-22 05:06:17 +0100 | omidmash | (~omidmash@user/omidmash) omidmash |
| 2026-01-22 05:03:29 +0100 | Jackneill | (~Jackneill@178-164-234-102.pool.digikabel.hu) (Ping timeout: 260 seconds) |
| 2026-01-22 05:02:09 +0100 | humasect | (~humasect@dyn-192-249-132-90.nexicom.net) humasect |
| 2026-01-22 05:01:40 +0100 | omidmash | (~omidmash@user/omidmash) (Quit: The Lounge - https://thelounge.chat) |
| 2026-01-22 05:01:27 +0100 | Inline | (~User@2001-4dd6-dd24-0-288a-d894-752e-65cf.ipv6dyn.netcologne.de) (Quit: KVIrc 5.2.6 Quasar http://www.kvirc.net/) |
| 2026-01-22 05:00:37 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 264 seconds) |
| 2026-01-22 04:55:13 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn |
| 2026-01-22 04:52:49 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 264 seconds) |
| 2026-01-22 04:51:52 +0100 | trickard_ | (~trickard@cpe-93-98-47-163.wireline.com.au) |
| 2026-01-22 04:51:40 +0100 | <lambdabot> | [[2,3],[1,3],[1,2]] |
| 2026-01-22 04:51:39 +0100 | <ncf> | > catMaybes . peek Nothing <$> holesOf traverse (Just <$> [1,2,3]) |
| 2026-01-22 04:51:37 +0100 | <ncf> | Leary's answer is the way to go, but if you like lens fuckery: |
| 2026-01-22 04:48:10 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn |
| 2026-01-22 04:46:40 +0100 | trickard_ | (~trickard@cpe-93-98-47-163.wireline.com.au) (Read error: Connection reset by peer) |
| 2026-01-22 04:41:34 +0100 | trickard_ | (~trickard@cpe-93-98-47-163.wireline.com.au) |
| 2026-01-22 04:41:22 +0100 | trickard | (~trickard@cpe-93-98-47-163.wireline.com.au) (Read error: Connection reset by peer) |
| 2026-01-22 04:36:58 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 246 seconds) |
| 2026-01-22 04:32:19 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn |
| 2026-01-22 04:26:42 +0100 | Typedfern | (~Typedfern@249.red-83-37-36.dynamicip.rima-tde.net) |
| 2026-01-22 04:25:35 +0100 | cupnoodle | (~cupnoodle@223.187.121.96) |
| 2026-01-22 04:23:16 +0100 | jmcantrell_ | (~weechat@user/jmcantrell) jmcantrell |
| 2026-01-22 04:21:22 +0100 | machinedgod | (~machinedg@d75-159-126-101.abhsia.telus.net) (Ping timeout: 244 seconds) |
| 2026-01-22 04:21:13 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 246 seconds) |
| 2026-01-22 04:19:03 +0100 | vidak | (~vidak@2407:e400:7800:2c01:d0be:76f8:cc84:bd4a) vidak |
| 2026-01-22 04:18:03 +0100 | Raito_Bezarius | (~Raito@libera/contributor/wireguard.tunneler.raito-bezarius) Raito_Bezarius |
| 2026-01-22 04:17:53 +0100 | <haskellbridge> | <iqubic (she/her)> I want each list to contain N-1 elements of the input list, in some order. |
| 2026-01-22 04:17:22 +0100 | <haskellbridge> | <iqubic (she/her)> If shuffling the ordering is better, feel free to do it. |
| 2026-01-22 04:17:14 +0100 | <haskellbridge> | <iqubic (she/her)> I don't need that specific ordering, but those are the sets I want. |
| 2026-01-22 04:16:32 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn |
| 2026-01-22 04:16:32 +0100 | <lambdabot> | [[2,3],[1,3],[1,2]] |
| 2026-01-22 04:16:30 +0100 | <Leary> | > (zipWith (++) . inits <*> tail . tails) [1,2,3] |
| 2026-01-22 04:15:10 +0100 | <haskellbridge> | <iqubic (she/her)> Or, if not a fold, something else that factors out the manual recursion |
| 2026-01-22 04:12:52 +0100 | <haskellbridge> | <iqubic (she/her)> I feel like there should be a way to rewrite this with a foldr: https://paste.tomsmeding.com/nV162kId |
| 2026-01-22 04:11:15 +0100 | <haskellbridge> | <iqubic (she/her)> That's what I wanted. |
| 2026-01-22 04:11:11 +0100 | <haskellbridge> | <iqubic (she/her)> drop1 (x:xs) = xs : map (\ys -> x:ys) (drop1 xs) |
| 2026-01-22 04:10:35 +0100 | qqq | (~qqq@185.54.21.105) (Quit: Lost terminal) |
| 2026-01-22 04:07:28 +0100 | <haskellbridge> | <iqubic (she/her)> drop1 [1,2,3] -> [[2,3], [1,3], [1,2]] |
| 2026-01-22 04:07:21 +0100 | <haskellbridge> | <iqubic (she/her)> I want a function that computes all the ways to remove a single element from a list. |