Zeitpunkt Nutzer Delta Tröts TNR Titel Version maxTL Mo 21.04.2025 00:01:01 62.506 +2 4.231.850 67,7 Fosstodon 4.3.7 500 So 20.04.2025 00:00:37 62.504 -2 4.229.590 67,7 Fosstodon 4.3.7 500 Sa 19.04.2025 00:00:14 62.506 0 4.227.011 67,6 Fosstodon 4.3.7 500 Fr 18.04.2025 00:01:09 62.506 -1 4.224.405 67,6 Fosstodon 4.3.7 500 Do 17.04.2025 00:01:10 62.507 +1 4.221.876 67,5 Fosstodon 4.3.7 500 Mi 16.04.2025 00:01:07 62.506 0 4.219.575 67,5 Fosstodon 4.3.7 500 Di 15.04.2025 00:00:23 62.506 +1 4.217.673 67,5 Fosstodon 4.3.7 500 Mo 14.04.2025 00:00:53 62.505 -1 4.215.350 67,4 Fosstodon 4.3.7 500 So 13.04.2025 00:02:20 62.506 +1 4.213.109 67,4 Fosstodon 4.3.7 500 Sa 12.04.2025 00:00:07 62.505 0 4.210.986 67,4 Fosstodon 4.3.7 500
J3RN :emacs: :haskell: (@j3rn) · 03/2022 · Tröts: 1.977 · Folger: 205
Mo 21.04.2025 20:03
An idea suggested in Domain-Driven Design and an unrelated paper is that a language can allow programmers to use a collection without specifying what kind of collection it is (list, array, queue, vector, etc), and that the compiler can analyze the usage of the collection to choose an underlying data structure. It's an interesting idea, but I worry that this pattern would lead to programmers using a collection in such a way that no data structure is an ideal fit.
[Öffentlich] Antw.: 0 Wtrl.: 0 Fav.: 0 · via Tusky