Newest at the top
| 2024-10-11 17:14:12 +0200 | euleritian | (~euleritia@ip4d16fc38.dynamic.kabel-deutschland.de) (Ping timeout: 252 seconds) |
| 2024-10-11 17:12:44 +0200 | vulpine | ghoulpine |
| 2024-10-11 17:10:45 +0200 | identity | (~identity@user/ZharMeny) identity |
| 2024-10-11 17:08:03 +0200 | gehmehgeh | gmg |
| 2024-10-11 17:07:52 +0200 | ystael | (~ystael@user/ystael) ystael |
| 2024-10-11 17:06:27 +0200 | ystael | (~ystael@user/ystael) (Read error: Connection reset by peer) |
| 2024-10-11 17:02:17 +0200 | ash3en | (~Thunderbi@2a03:7846:b6eb:101:93ac:a90a:da67:f207) (Quit: ash3en) |
| 2024-10-11 16:58:21 +0200 | Batzy_ | (~quassel@user/batzy) (Ping timeout: 246 seconds) |
| 2024-10-11 16:56:01 +0200 | Batzy | (~quassel@user/batzy) Batzy |
| 2024-10-11 16:54:11 +0200 | identity | (~identity@user/ZharMeny) (Quit: ERC 5.6.0.30.1 (IRC client for GNU Emacs 30.0.91)) |
| 2024-10-11 16:49:47 +0200 | youthlic | (~Thunderbi@user/youthlic) youthlic |
| 2024-10-11 16:47:21 +0200 | SlackCoder | (~SlackCode@64-94-63-8.ip.weststar.net.ky) (Quit: Leaving) |
| 2024-10-11 16:47:06 +0200 | youthlic | (~Thunderbi@user/youthlic) (Remote host closed the connection) |
| 2024-10-11 16:22:08 +0200 | <sweater1> | I wonder if y'all know how to install shell completions for a binary Haskell distribution with Nix Flake. Here is the current flake: https://github.com/doma-engineering/passveil/blob/main/flake.nix |
| 2024-10-11 16:08:48 +0200 | xff0x | (~xff0x@2405:6580:b080:900:3d02:210b:1e86:6542) |
| 2024-10-11 16:08:10 +0200 | xff0x | (~xff0x@2405:6580:b080:900:3d02:210b:1e86:6542) (Quit: xff0x) |
| 2024-10-11 16:02:12 +0200 | cfricke | (~cfricke@user/cfricke) cfricke |
| 2024-10-11 16:00:19 +0200 | <k`> | Very cool. Convoluted, but I think that's exactly what I need. I do think that IntSet is strict, so rnf should be the same as a bang. |
| 2024-10-11 15:59:40 +0200 | <geekosaur> | not just bang but `rnf` |
| 2024-10-11 15:59:28 +0200 | <k`> | So essentially that's like having a bang at the top level? Template haskell forces the evaluation, and then you inline the result? |
| 2024-10-11 15:58:59 +0200 | <geekosaur> | GHC in general will not do this itself because it necessarily alters strictness properties |
| 2024-10-11 15:58:27 +0200 | <geekosaur> | the no-thinking-needed way is just to do the generation in TH without recourse to internals and put a reference to the result in the AST |
| 2024-10-11 15:57:52 +0200 | <k`> | The compile time shouldn't be any longer than building the set at startup time, so that's a tradeoff I a eager to make. |
| 2024-10-11 15:57:33 +0200 | dcoutts_ | (~duncan@2a00:23c6:1c8d:901:b94:4566:9d63:4848) (Ping timeout: 276 seconds) |
| 2024-10-11 15:57:22 +0200 | <k`> | You mean by importing the internal constructors from containers and using that? |
| 2024-10-11 15:57:02 +0200 | <geekosaur> | but that'll probably explode compile time instead |
| 2024-10-11 15:56:41 +0200 | <geekosaur> | I think the best you can do is compute it in TH? |
| 2024-10-11 15:56:25 +0200 | <k`> | Plus the app has to build the set each time it is run. |
| 2024-10-11 15:54:48 +0200 | <k`> | Is there any way to force GHC to statically compile a data structure? I'm generating an IntSet in a source file from the union of a lot of ranges. The set itself is relatively small (thanks to the clever implementation of IntSet), but the resulting interface file and binary are huge. I have already marked the set NOTINLINE and tried O0, O1, and O2. |
| 2024-10-11 15:54:37 +0200 | dcoutts__ | (~duncan@host86-143-111-204.range86-143.btcentralplus.com) |
| 2024-10-11 15:51:21 +0200 | k` | (~k`@152.7.255.192) |
| 2024-10-11 15:48:35 +0200 | dcoutts_ | (~duncan@2a00:23c6:1c8d:901:b94:4566:9d63:4848) |
| 2024-10-11 15:48:13 +0200 | dcoutts_ | (~duncan@2a00:23c6:1c8d:901:b94:4566:9d63:4848) (Remote host closed the connection) |
| 2024-10-11 15:47:23 +0200 | xff0x | (~xff0x@2405:6580:b080:900:3d02:210b:1e86:6542) |
| 2024-10-11 15:45:34 +0200 | ystael | (~ystael@user/ystael) ystael |
| 2024-10-11 15:42:26 +0200 | ubert | (~Thunderbi@178.165.179.94.wireless.dyn.drei.com) (Ping timeout: 252 seconds) |
| 2024-10-11 15:41:59 +0200 | <Square2> | I couldn't find a "haskell types -> schema" function, which wouldv'e felt practical to get going fast. |
| 2024-10-11 15:40:43 +0200 | <Square2> | Anyone got any experience of working with cap'n proto for Haskell? Does it feel ergonomic? |
| 2024-10-11 15:22:32 +0200 | xff0x | (~xff0x@2405:6580:b080:900:3d02:210b:1e86:6542) (Quit: xff0x) |
| 2024-10-11 15:20:53 +0200 | noctux | (~noctux@user/noctux) noctux |
| 2024-10-11 15:19:38 +0200 | carbolymer | (~carbolyme@dropacid.net) carbolymer |
| 2024-10-11 15:18:20 +0200 | noctux | (~noctux@user/noctux) (Read error: Connection reset by peer) |
| 2024-10-11 15:17:45 +0200 | <Square2> | __monty__, cap'n proto looks nice. protobuffers feels less elegant to me. |
| 2024-10-11 15:16:23 +0200 | Smiles | (uid551636@id-551636.lymington.irccloud.com) Smiles |
| 2024-10-11 15:15:01 +0200 | <__monty__> | There's also various message queue libraries like ZeroMQ. |
| 2024-10-11 15:14:47 +0200 | <Square2> | I guess I mean sending/reciving messages. |
| 2024-10-11 15:14:35 +0200 | <__monty__> | I think that's what gRPC and Cap'n Proto try to be? |
| 2024-10-11 15:11:41 +0200 | youthlic | (~Thunderbi@user/youthlic) youthlic |
| 2024-10-11 15:10:56 +0200 | <Square2> | is there some language agnostic protocol suitable for interprocess communication? Say calling methods in haskell from other languages. |
| 2024-10-11 15:10:29 +0200 | identity | (~identity@user/ZharMeny) identity |