Newest at the top
| 2025-04-30 15:22:22 +0200 | AlexZenon | (~alzenon@94.233.241.180) |
| 2025-04-30 15:19:31 +0200 | akegalj | (~akegalj@78-1-137-15.adsl.net.t-com.hr) (Ping timeout: 252 seconds) |
| 2025-04-30 15:15:43 +0200 | tolgo | (~Thunderbi@199.115.144.130) (Ping timeout: 252 seconds) |
| 2025-04-30 15:15:00 +0200 | AlexNoo | (~AlexNoo@178.34.151.238) (Ping timeout: 252 seconds) |
| 2025-04-30 15:14:29 +0200 | AlexZenon | (~alzenon@178.34.151.238) (Ping timeout: 248 seconds) |
| 2025-04-30 15:08:17 +0200 | Square2 | (~Square4@user/square) Square |
| 2025-04-30 15:05:52 +0200 | Maxdamantus | (~Maxdamant@user/maxdamantus) Maxdamantus |
| 2025-04-30 14:59:01 +0200 | Maxdamantus | (~Maxdamant@user/maxdamantus) (Ping timeout: 248 seconds) |
| 2025-04-30 14:42:08 +0200 | <int-e> | tomsmeding: (re-)using `find` is cute at least. |
| 2025-04-30 14:41:02 +0200 | <int-e> | So for the same reason, yeah it'll almost certainly be a tad slower. |
| 2025-04-30 14:40:41 +0200 | bitdex | (~bitdex@gateway/tor-sasl/bitdex) (Quit: = "") |
| 2025-04-30 14:40:40 +0200 | tolgo | (~Thunderbi@199.115.144.130) |
| 2025-04-30 14:40:24 +0200 | <int-e> | Well, technically it gains a tiny bit of laziness. |
| 2025-04-30 14:40:12 +0200 | <int-e> | Yeah it doesn't gain anything (heck, the code might even be a tad slower). I just looked at your code and it didn't match my "buitlin" pattern for that function :-) |
| 2025-04-30 14:38:56 +0200 | <tomsmeding> | good for golfing, but not for much else, though :) |
| 2025-04-30 14:38:34 +0200 | <tomsmeding> | oh heh |
| 2025-04-30 14:38:18 +0200 | <int-e> | tomsmeding: heh you didn't use the argument swapping trick: https://paste.tomsmeding.com/OMMZF63K |
| 2025-04-30 14:37:46 +0200 | <tomsmeding> | but yes, your (and Leary's, and Andras') solutions are clearly better |
| 2025-04-30 14:35:55 +0200 | <tomsmeding> | int-e: I tried this simple thing, even added some strict data types to make it a little bit faster https://paste.tomsmeding.com/Tema5Itk |
| 2025-04-30 14:31:19 +0200 | <int-e> | tomsmeding: Argh, I messed up while cleaning up the code. there should be an `extract [] = Nothing` case |
| 2025-04-30 14:30:32 +0200 | <Leary> | NB: Comment thread with discussion and links to my and Andras Kovacs' solutions: https://www.reddit.com/r/haskell/comments/1k5n4r5/broad_search_for_any_traversable/ |
| 2025-04-30 14:29:04 +0200 | <tomsmeding> | nice, that's quite a bit faster than mine |
| 2025-04-30 14:27:33 +0200 | <int-e> | tomsmeding: FWIW: (spoiler) https://paste.tomsmeding.com/B09YkvUF |
| 2025-04-30 14:27:24 +0200 | <tomsmeding> | I think you can s/traversable/haskell data structure/? |
| 2025-04-30 14:26:23 +0200 | <haskellbridge> | <Liamzee> does this imply that any traversable is either finite or countably infinite? |
| 2025-04-30 14:26:07 +0200 | jespada | (~jespada@r167-61-126-65.dialup.adsl.anteldata.net.uy) jespada |
| 2025-04-30 14:24:14 +0200 | <tomsmeding> | oh right |
| 2025-04-30 14:23:58 +0200 | <int-e> | the associativity Monoid or Monad law |
| 2025-04-30 14:23:13 +0200 | <tomsmeding> | and yes, I wasn't sure why Traversable was given |
| 2025-04-30 14:23:02 +0200 | JuanDaugherty | ColinRobinson |
| 2025-04-30 14:22:59 +0200 | <tomsmeding> | int-e: which law? |
| 2025-04-30 14:21:08 +0200 | <haskellbridge> | <Liamzee> also cute, type signature stops the cheap search _ _ = Just 15 |
| 2025-04-30 14:20:36 +0200 | <int-e> | (works with just Foldable too btw) |
| 2025-04-30 14:20:22 +0200 | <int-e> | tomsmeding: but isn't it bad to ask people to break the law ;-) |
| 2025-04-30 14:18:31 +0200 | euleritian | (~euleritia@77.23.248.47) |
| 2025-04-30 14:18:14 +0200 | euleritian | (~euleritia@77.23.248.47) (Remote host closed the connection) |
| 2025-04-30 14:05:59 +0200 | tolgo | (~Thunderbi@199.115.144.130) (Ping timeout: 260 seconds) |
| 2025-04-30 14:05:34 +0200 | euleritian | (~euleritia@77.23.248.47) |
| 2025-04-30 14:05:16 +0200 | euleritian | (~euleritia@ip4d17f82f.dynamic.kabel-deutschland.de) (Remote host closed the connection) |
| 2025-04-30 13:58:14 +0200 | Googulator65 | (~Googulato@2a01-036d-0106-4a24-1dc7-297e-fae3-e794.pool6.digikabel.hu) |
| 2025-04-30 13:57:56 +0200 | Googulator65 | (~Googulato@94-21-139-144.pool.digikabel.hu) (Quit: Client closed) |
| 2025-04-30 13:51:44 +0200 | JuanDaugherty | (~juan@user/JuanDaugherty) JuanDaugherty |
| 2025-04-30 13:50:17 +0200 | <tomsmeding> | this is cute: https://github.com/effectfully-ou/haskell-challenges/tree/master/h9-traversable-search |
| 2025-04-30 13:49:33 +0200 | fp | (~Thunderbi@2001:708:20:1406::1370) (Ping timeout: 252 seconds) |
| 2025-04-30 13:39:00 +0200 | acidjnk_new | (~acidjnk@p200300d6e71c4f99080af51b38705a6b.dip0.t-ipconnect.de) |
| 2025-04-30 13:32:59 +0200 | fp | (~Thunderbi@2001:708:20:1406::1370) fp |
| 2025-04-30 13:29:35 +0200 | tolgo | (~Thunderbi@199.115.144.130) |
| 2025-04-30 13:12:19 +0200 | alecs | (~alecs@nat16.software.imdea.org) (Quit: Client closed) |
| 2025-04-30 13:10:15 +0200 | acidjnk_new | (~acidjnk@p200300d6e71c4f99080af51b38705a6b.dip0.t-ipconnect.de) (Ping timeout: 252 seconds) |
| 2025-04-30 13:08:45 +0200 | xff0x | (~xff0x@2409:251:9040:2c00:bbeb:8989:78aa:8ec8) |