Newest at the top
2025-09-26 14:16:41 +0200 | Enrico63 | (~Enrico63@2a0b:e541:10d0:0:9efc:e8ff:fe24:3213) Enrico63 |
2025-09-26 14:14:34 +0200 | vanishingideal | (~vanishing@user/vanishingideal) vanishingideal |
2025-09-26 14:09:29 +0200 | Lycurgus | (~juan@user/Lycurgus) Lycurgus |
2025-09-26 14:08:29 +0200 | trickard_ | (~trickard@cpe-50-98-47-163.wireline.com.au) |
2025-09-26 14:05:45 +0200 | trickard | (~trickard@cpe-50-98-47-163.wireline.com.au) (Read error: Connection reset by peer) |
2025-09-26 14:05:05 +0200 | ljdarj | (~Thunderbi@user/ljdarj) ljdarj |
2025-09-26 14:04:21 +0200 | Googulator | (~Googulato@81.183.235.203) (Ping timeout: 250 seconds) |
2025-09-26 14:03:31 +0200 | ljdarj | (~Thunderbi@user/ljdarj) (Ping timeout: 255 seconds) |
2025-09-26 14:02:56 +0200 | trickard_ | trickard |
2025-09-26 14:00:44 +0200 | Googulator26 | (~Googulato@81.183.235.203) |
2025-09-26 13:50:50 +0200 | sroso | (~sroso@user/SrOso) (Quit: Leaving :)) |
2025-09-26 13:47:10 +0200 | trickard_ | (~trickard@cpe-50-98-47-163.wireline.com.au) |
2025-09-26 13:46:56 +0200 | trickard_ | (~trickard@cpe-50-98-47-163.wireline.com.au) (Read error: Connection reset by peer) |
2025-09-26 13:46:12 +0200 | <merijn> | Since it just relies on a bunch of Typeable based projections |
2025-09-26 13:45:55 +0200 | <merijn> | tomsmeding: Right, but you can do that using hierarchical exceptions |
2025-09-26 13:44:01 +0200 | lortabac | (~lortabac@2a01:e0a:541:b8f0:55ab:e185:7f81:54a4) lortabac |
2025-09-26 13:43:59 +0200 | Googulator70 | (~Googulato@81.183.235.203) (Ping timeout: 250 seconds) |
2025-09-26 13:41:36 +0200 | Googulator71 | Googulator |
2025-09-26 13:40:52 +0200 | Googulator71 | (~Googulato@81.183.235.203) |
2025-09-26 13:40:08 +0200 | tromp | (~textual@2001:1c00:3487:1b00:1c2c:dead:822d:e7f7) (Quit: My iMac has gone to sleep. ZZZzzz…) |
2025-09-26 13:38:40 +0200 | lortabac | (~lortabac@2a01:e0a:541:b8f0:55ab:e185:7f81:54a4) (Client Quit) |
2025-09-26 13:37:32 +0200 | lortabac | (~lortabac@2a01:e0a:541:b8f0:55ab:e185:7f81:54a4) lortabac |
2025-09-26 13:36:01 +0200 | lortabac | (~lortabac@2a01:e0a:541:b8f0:55ab:e185:7f81:54a4) (Client Quit) |
2025-09-26 13:35:41 +0200 | Lord_of_Life_ | Lord_of_Life |
2025-09-26 13:34:47 +0200 | <tomsmeding> | hence the partial-order-of-errors idea where you store only the maxima |
2025-09-26 13:34:21 +0200 | <tomsmeding> | anyway |
2025-09-26 13:34:19 +0200 | <tomsmeding> | merijn: if I'm understanding [exa]'s use case correctly, the idea is that an auth error in some component is useful to report (credentials should be fixed), and a timeout is also useful (retry may help), but if later we find out that something in the config of that component is just broken, the error "config should be fixed" overrides the other ones because a changed config changes everything |
2025-09-26 13:33:19 +0200 | wootehfoot | (~wootehfoo@user/wootehfoot) wootehfoot |
2025-09-26 13:33:01 +0200 | Lord_of_Life | (~Lord@user/lord-of-life/x-2819915) (Ping timeout: 264 seconds) |
2025-09-26 13:32:53 +0200 | Lord_of_Life_ | (~Lord@user/lord-of-life/x-2819915) Lord_of_Life |
2025-09-26 13:32:35 +0200 | lortabac | (~lortabac@2a01:e0a:541:b8f0:55ab:e185:7f81:54a4) |
2025-09-26 13:32:00 +0200 | lortabac | (~lortabac@2a01:e0a:541:b8f0:55ab:e185:7f81:54a4) (Client Quit) |
2025-09-26 13:29:38 +0200 | <merijn> | [exa]: I mean, the exception system lets you create hierarchical inheritance like behaviour for exceptions, so maybe try something along those lines? |
2025-09-26 13:29:16 +0200 | wootehfoot | (~wootehfoo@user/wootehfoot) (Client Quit) |
2025-09-26 13:28:43 +0200 | lortabac | (~lortabac@2a01:e0a:541:b8f0:55ab:e185:7f81:54a4) lortabac |
2025-09-26 13:28:09 +0200 | <tomsmeding> | if you do my `reduce` in (<>), then you can reduce the O(n^2) to O(n * m) because you can assume that no redundancies exist within one argument to (<>) |
2025-09-26 13:25:43 +0200 | lortabac | (~lortabac@2a01:e0a:541:b8f0:55ab:e185:7f81:54a4) (Quit: WeeChat 4.5.2) |
2025-09-26 13:25:34 +0200 | wootehfoot | (~wootehfoo@user/wootehfoot) wootehfoot |
2025-09-26 13:23:20 +0200 | <tomsmeding> | I guess that's called directed graph reachability |
2025-09-26 13:23:19 +0200 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
2025-09-26 13:23:06 +0200 | CiaoSen | (~Jura@2a02:8071:64e1:da0:5a47:caff:fe78:33db) CiaoSen |
2025-09-26 13:22:56 +0200 | <tomsmeding> | I wonder if there's a neat way to implement (<) on a partial order by only specifying the pairs that generate the order, i.e. without having to manually deal with transitivity |
2025-09-26 13:21:07 +0200 | <tomsmeding> | (that's not to say you should not do the rename in your case, I dunno the context and don't need to know it :P) |
2025-09-26 13:20:37 +0200 | <tomsmeding> | also there's plenty precedent for errors not being fatal, see compiler errors |
2025-09-26 13:20:01 +0200 | <tomsmeding> | just makes all the names longer |
2025-09-26 13:19:49 +0200 | <tomsmeding> | I don't think s/Error/Recommendation/g changes anything in the above |
2025-09-26 13:19:34 +0200 | [exa] | goes back to the cave to rethink again |
2025-09-26 13:19:15 +0200 | <[exa]> | I might really want to reword the whole problem to recommendations instead of the error/exception wording, it makes interpretation much easier |
2025-09-26 13:18:32 +0200 | <tomsmeding> | math! |
2025-09-26 13:18:26 +0200 | <tomsmeding> | neat |