Skip Navigation

InitialsDiceBearhttps://github.com/dicebear/dicebearhttps://creativecommons.org/publicdomain/zero/1.0/„Initials” (https://github.com/dicebear/dicebear) by „DiceBear”, licensed under „CC0 1.0” (https://creativecommons.org/publicdomain/zero/1.0/)N

Noughtmare

@ Noughtmare @programming.dev

118
13
2 yr. ago

  • How much time and money would it take to set up and maintain a server similar to disroot.org, offering the same services, for a group of ten people?

  • They are considered volunteers in the Netherlands as long as the compensation is way below market rates. I don't understand why you think this is a problem.

  • How much time and money would it take to set up and maintain a server similar to disroot.org, offering the same services, for a group of ten people?

  • In the Netherlands, volunteers can be paid up to €5.60 per hour and up to €2100 per year (tax-free).

  • Search Index in 150 Lines of Haskell

  • GHC 9.6.7 is now available

  • I'm confused. It does go straight to the discourse post when I click it.

  • Humble Tech Book Bundle: Computer Science the Fun Way by No Starch

  • You can choose a custom donation and make most of your money go to the EFF. Then the top tier is just like a €24 donation to the EFF and you only really "pay" €10.30 for the actual books.

  • Lid worden van een politieke partij

  • Een belangrijke overweging van mij is dat de partij groot genoeg is om echt het verschil te maken. Daarom ben ik recent lid geworden van Groenlinks. Ik denk dat Groenlinks-PvdA de enige fractie is die groot genoeg en ook duidelijk pro-europa is.

  • Pirates Rejoice! Meta/Facebook Condones Piracy if Seeding Can't be Proven.

  • Or anywhere in the EU. And I don't think the USA is more lenient on piracy. But perhaps they are if a big company is the one doing it.

  • Pirates Rejoice! Meta/Facebook Condones Piracy if Seeding Can't be Proven.

  • The Haskell Unfolder Episode 37: solving Advent of Code 2024 day 4

  • Why? They immediately explain that the difference in performance would not be significant on such a small problem and I see no other reason to prefer arrays over maps.

  • Competitive Programming in Haskell: Union-Find

  • Thanks, I did look at the Wikipedia page, but the Applications section is pretty difficult to read. The applications it lists are themselves quite abstract problems.

  • Competitive Programming in Haskell: Union-Find

  • Also, I think the 'find' operation could be replaced by an operation that checks if two elements are in the same set. That way you don't have to come up with a "name".

  • Competitive Programming in Haskell: Union-Find

  • One thing I'm missing is which problems this technique can solve. I believe one important use case is in type inference. Are there many other problems that can be solved by union-find?