Newest at the top
| 2025-04-30 16:20:22 +0200 | euleritian | (~euleritia@dynamic-176-000-198-224.176.0.pool.telefonica.de) (Remote host closed the connection) |
| 2025-04-30 16:07:04 +0200 | euphores | (~SASL_euph@user/euphores) (Ping timeout: 252 seconds) |
| 2025-04-30 16:04:27 +0200 | euphores1 | (~SASL_euph@37.214.58.222) |
| 2025-04-30 15:55:33 +0200 | j1n37 | (~j1n37@user/j1n37) j1n37 |
| 2025-04-30 15:55:26 +0200 | ystael | (~ystael@user/ystael) ystael |
| 2025-04-30 15:53:39 +0200 | j1n37 | (~j1n37@user/j1n37) (Read error: Connection reset by peer) |
| 2025-04-30 15:49:50 +0200 | ttybitnik | (~ttybitnik@user/wolper) ttybitnik |
| 2025-04-30 15:46:45 +0200 | <haskellbridge> | <Liamzee> (or hook it into the f) |
| 2025-04-30 15:46:31 +0200 | <haskellbridge> | <Liamzee> (make the z default in foldr, ummm, do non-primitive recursion) |
| 2025-04-30 15:46:23 +0200 | j1n37 | (~j1n37@user/j1n37) j1n37 |
| 2025-04-30 15:45:47 +0200 | <haskellbridge> | <Liamzee> (and yes, that includes non-primitive recursion) |
| 2025-04-30 15:45:34 +0200 | j1n37 | (~j1n37@user/j1n37) (Ping timeout: 276 seconds) |
| 2025-04-30 15:44:58 +0200 | <haskellbridge> | <Liamzee> everything is foldr with an accumulator and a builder pattern :3 |
| 2025-04-30 15:41:37 +0200 | <int-e> | everything is wrong in almost all contexts ;-) |
| 2025-04-30 15:41:14 +0200 | <lambdabot> | b -> Either a b |
| 2025-04-30 15:41:13 +0200 | <int-e> | :t Right |
| 2025-04-30 15:38:59 +0200 | euleritian | (~euleritia@dynamic-176-000-198-224.176.0.pool.telefonica.de) |
| 2025-04-30 15:38:24 +0200 | kuribas | (~user@ip-188-118-57-242.reverse.destiny.be) kuribas |
| 2025-04-30 15:36:05 +0200 | euleritian | (~euleritia@77.23.248.47) (Ping timeout: 244 seconds) |
| 2025-04-30 15:35:08 +0200 | <haskellbridge> | <hellwolf> some say everything is "for_", who is right |
| 2025-04-30 15:34:19 +0200 | <int-e> | But maybe LogicT is why this is asked for Traversable. |
| 2025-04-30 15:33:34 +0200 | <int-e> | I feel that this is more of "every list function can be defined in terms of foldr" territory. |
| 2025-04-30 15:31:41 +0200 | <[exa]> | Foldable is the new LogicT? |
| 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 |