4 ms·
The best of explanation of Finger Trees (data structure) I have seen
- brl 18y agoSince Finger Trees are powered by Monoids, this is also a very good explanation of why Monoids are useful in Haskell.
- mark_h 18y agoExactly, and thank you for reminding me -- I meant to add a comment pointing to this overview of what a monoid is, and why they're useful, from sigfpe: http://sigfpe.blogspot.com/2009/01/haskell-monoids-and-their-uses.html http://sigfpe.blogspot.com/2009/01/haskell-monoids-and-their... Very clear and accessible, IMO.