Noughtmare

joined 2 months ago
13
Haskell Optimization Handbook (haskell.foundation)
submitted 1 day ago by Noughtmare to c/haskell
5
submitted 3 days ago by Noughtmare to c/haskell
[–] Noughtmare 2 points 2 weeks ago

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.

[–] Noughtmare 1 points 1 month ago

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.

[–] Noughtmare 1 points 1 month ago

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".

[–] Noughtmare 1 points 1 month ago (2 children)

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?

view more: next ›