Newest at the top
| 2025-12-03 11:31:20 +0100 | tromp | (~textual@2001:1c00:3487:1b00:a4ed:9e46:fd5d:6b4e) |
| 2025-12-03 11:30:34 +0100 | dhil | (~dhil@5.151.29.137) dhil |
| 2025-12-03 11:28:48 +0100 | kuribas | (~user@2a02:1808:c7:cecf:a041:fccb:9242:86e9) (Ping timeout: 260 seconds) |
| 2025-12-03 11:27:03 +0100 | gawen | (~gawen@user/gawen) gawen |
| 2025-12-03 11:26:56 +0100 | kuribas` | (~user@ip-188-118-57-242.reverse.destiny.be) kuribas |
| 2025-12-03 11:22:50 +0100 | gawen | (~gawen@user/gawen) (Quit: cya) |
| 2025-12-03 11:21:30 +0100 | Googulator93 | Googulator |
| 2025-12-03 11:19:27 +0100 | hsw | (~hsw@112-104-86-252.adsl.dynamic.seed.net.tw) hsw |
| 2025-12-03 11:19:03 +0100 | hsw | (~hsw@112-104-86-252.adsl.dynamic.seed.net.tw) (Remote host closed the connection) |
| 2025-12-03 11:18:32 +0100 | <lucabtz> | i think Leary's way with foldr should be lazy too |
| 2025-12-03 11:13:16 +0100 | Square2 | (~Square4@user/square) (Ping timeout: 255 seconds) |
| 2025-12-03 11:11:32 +0100 | <lucabtz> | thank you Axman6 |
| 2025-12-03 11:09:59 +0100 | merijn | (~merijn@77.242.116.146) merijn |
| 2025-12-03 11:09:45 +0100 | __monty__ | (~toonn@user/toonn) toonn |
| 2025-12-03 11:08:39 +0100 | merijn | (~merijn@77.242.116.146) (Ping timeout: 265 seconds) |
| 2025-12-03 11:08:20 +0100 | <lambdabot> | [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,2... |
| 2025-12-03 11:08:16 +0100 | <Axman6> | > let dropEnd n xs = zipWith const xs (drop n xs) in dropEnd 3 [0..] |
| 2025-12-03 11:07:56 +0100 | <Axman6> | zipWith const is an incredibly useful thing to know about |
| 2025-12-03 11:07:38 +0100 | <Axman6> | This has the benefit of being lazy too, it only eevaluates n elements ahead of the the output. lucabtz ^ |
| 2025-12-03 11:07:28 +0100 | trickard_ | (~trickard@cpe-85-98-47-163.wireline.com.au) |
| 2025-12-03 11:07:13 +0100 | trickard | (~trickard@cpe-85-98-47-163.wireline.com.au) (Ping timeout: 260 seconds) |
| 2025-12-03 11:06:59 +0100 | <lambdabot> | "ABCD" |
| 2025-12-03 11:06:55 +0100 | <Axman6> | > let dropEnd n xs = zipWith const xs (drop n xs) in dropEnd 3 "ABCDEFG" |
| 2025-12-03 11:06:16 +0100 | xff0x | (~xff0x@fsb6a9491c.tkyc517.ap.nuro.jp) (Ping timeout: 246 seconds) |
| 2025-12-03 10:54:01 +0100 | <chromoblob> | i think you should first find the length, then take (l - n) where l is length |
| 2025-12-03 10:50:24 +0100 | X-Scale | (~ARM@50.65.114.89.rev.vodafone.pt) X-Scale |
| 2025-12-03 10:50:02 +0100 | gmg | (~user@user/gehmehgeh) gehmehgeh |
| 2025-12-03 10:47:35 +0100 | merijn | (~merijn@77.242.116.146) merijn |
| 2025-12-03 10:44:00 +0100 | trickard_ | trickard |
| 2025-12-03 10:40:56 +0100 | Googulator93 | (~Googulato@2a01-036d-0106-479c-d9ec-010d-f188-ffcb.pool6.digikabel.hu) |
| 2025-12-03 10:40:49 +0100 | Googulator93 | (~Googulato@2a01-036d-0106-479c-d9ec-010d-f188-ffcb.pool6.digikabel.hu) (Quit: Client closed) |
| 2025-12-03 10:36:18 +0100 | merijn | (~merijn@77.242.116.146) (Ping timeout: 260 seconds) |
| 2025-12-03 10:29:38 +0100 | merijn | (~merijn@77.242.116.146) merijn |
| 2025-12-03 10:29:26 +0100 | hdggxin | (~hdggxin@223.181.46.243) |
| 2025-12-03 10:28:41 +0100 | kuribas | (~user@2a02:1808:c7:cecf:a041:fccb:9242:86e9) kuribas |
| 2025-12-03 10:27:42 +0100 | trickard_ | (~trickard@cpe-85-98-47-163.wireline.com.au) |
| 2025-12-03 10:26:45 +0100 | Inline | (~inlinE@2001-4dd3-7fc8-0-434a-a4b1-7362-b14b.ipv6dyn.netcologne.de) (Ping timeout: 252 seconds) |
| 2025-12-03 10:26:12 +0100 | merijn | (~merijn@77.242.116.146) (Ping timeout: 256 seconds) |
| 2025-12-03 10:25:24 +0100 | tromp | (~textual@2001:1c00:3487:1b00:a4ed:9e46:fd5d:6b4e) (Quit: My iMac has gone to sleep. ZZZzzz…) |
| 2025-12-03 10:25:18 +0100 | trickard_ | (~trickard@cpe-85-98-47-163.wireline.com.au) (Read error: Connection reset by peer) |
| 2025-12-03 10:17:00 +0100 | <lucabtz> | yeah thats cool |
| 2025-12-03 10:16:46 +0100 | trickard_ | (~trickard@cpe-85-98-47-163.wireline.com.au) |
| 2025-12-03 10:16:33 +0100 | trickard_ | (~trickard@cpe-85-98-47-163.wireline.com.au) (Read error: Connection reset by peer) |
| 2025-12-03 10:14:07 +0100 | acidjnk | (~acidjnk@p200300d6e71719231986af8ebf40e0fc.dip0.t-ipconnect.de) acidjnk |
| 2025-12-03 10:11:44 +0100 | <Leary> | This should be moderately faster: https://play.haskell.org/saved/E1adTNLc |
| 2025-12-03 10:10:49 +0100 | Googulator93 | (~Googulato@2a01-036d-0106-479c-d9ec-010d-f188-ffcb.pool6.digikabel.hu) |
| 2025-12-03 10:10:44 +0100 | Googulator | (~Googulato@2a01-036d-0106-479c-d9ec-010d-f188-ffcb.pool6.digikabel.hu) (Quit: Client closed) |
| 2025-12-03 10:09:56 +0100 | merijn | (~merijn@77.242.116.146) merijn |
| 2025-12-03 10:08:55 +0100 | X-Scale | (~ARM@50.65.114.89.rev.vodafone.pt) (Ping timeout: 240 seconds) |
| 2025-12-03 10:08:50 +0100 | <lucabtz> | i think with a list of length n repeating init N times should have complexity O(n * N), while yeah reverse . drop N . reverse should scale like 2n + N ~ O(n) |