Newest at the top
| 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. |
| 2026-01-22 04:07:04 +0100 | <haskellbridge> | <iqubic (she/her)> I see.... |
| 2026-01-22 04:06:55 +0100 | <geekosaur> | I'm not quite sure what you're trying to do, to be honest. (in part because my focus is all over the place, I'm working on cabal atm and chasing around various housework things…) |
| 2026-01-22 04:05:36 +0100 | <haskellbridge> | <iqubic (she/her)> How can I fix my code here? |
| 2026-01-22 04:05:33 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 252 seconds) |
| 2026-01-22 04:05:06 +0100 | <geekosaur> | yeh, I have no clue about LML |
| 2026-01-22 04:04:55 +0100 | Raito_Bezarius | (~Raito@libera/contributor/wireguard.tunneler.raito-bezarius) (Ping timeout: 245 seconds) |
| 2026-01-22 04:04:15 +0100 | <geekosaur> | xs :: [a] |
| 2026-01-22 04:04:10 +0100 | <geekosaur> | map (x:) (drop1 xs) :: [[a]] -> [[a]] |
| 2026-01-22 04:04:09 +0100 | <EvanR> | (unlikely to still be available and functioning) |
| 2026-01-22 04:03:50 +0100 | <EvanR> | rather the compiler for it |
| 2026-01-22 04:03:49 +0100 | <geekosaur> | drop1 :: [a] -> [[a]] |
| 2026-01-22 04:03:43 +0100 | <EvanR> | and lazy ML was written in |
| 2026-01-22 04:03:19 +0100 | <haskellbridge> | <iqubic (she/her)> drop1 (x:xs) = xs ++ map (x:) (drop1 xs) |
| 2026-01-22 04:03:14 +0100 | <haskellbridge> | <iqubic (she/her)> geekosaur: Am I missing something obvious here? |
| 2026-01-22 04:02:54 +0100 | <geekosaur> | I think there's an ancient i386 binary for HBC somewhere, but no source and no guarantee the binary would run on modern systems |
| 2026-01-22 04:02:29 +0100 | Inline | (~User@2001-4dd6-dd24-0-288a-d894-752e-65cf.ipv6dyn.netcologne.de) Inline |
| 2026-01-22 04:01:25 +0100 | <geekosaur> | ghc was originally written in HBC, a now lost compiler which was itself written in Lazy ML |
| 2026-01-22 04:01:10 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn |
| 2026-01-22 03:59:25 +0100 | <haskellbridge> | <iqubic (she/her)> I'm so lost here... What am I missing? |
| 2026-01-22 03:58:59 +0100 | <haskellbridge> | <iqubic (she/her)> I'm trying to use the head of the iinput. |