Zeitpunkt Nutzer Delta Tröts TNR Titel Version maxTL Mo 08.07.2024 00:00:19 61.922 +5 3.524.369 56,9 Fosstodon 4.2.10 500 So 07.07.2024 00:00:04 61.917 0 3.522.885 56,9 Fosstodon 4.2.10 500 Sa 06.07.2024 00:00:07 61.917 -2 3.523.632 56,9 Fosstodon 4.2.10 500 Fr 05.07.2024 00:00:27 61.919 0 3.520.710 56,9 Fosstodon 4.2.10 500 Do 04.07.2024 00:00:52 61.919 +2 3.517.337 56,8 Fosstodon 4.2.9 500 Mi 03.07.2024 00:00:12 61.917 +2 3.513.906 56,8 Fosstodon 4.2.9 500 Di 02.07.2024 00:01:44 61.915 -2 3.510.479 56,7 Fosstodon 4.2.9 500 Mo 01.07.2024 00:00:33 61.917 0 3.507.420 56,6 Fosstodon 4.2.9 500 So 30.06.2024 00:00:34 61.917 +2 3.504.671 56,6 Fosstodon 4.2.9 500 Sa 29.06.2024 00:01:13 61.915 0 3.501.982 56,6 Fosstodon 4.2.9 500
Philipp :emacs: :nixos: (@pmidden) · 11/2022 · Tröts: 463 · Folger: 89
Mo 08.07.2024 09:50
Implemented a state machine in #haskell using a series of three mutu-recursive functions. Very elegant solution in my opinion, but I'm very unsure about stack overflows here. The outermost function is just "forever f", and the machine returns to that function "quickly", but still. Would be cool to have a guarantee that the code will be optimized into loops.
[Öffentlich] Antw.: 0 Wtrl.: 0 Fav.: 1 · via mastodon.el