Chris Smith wrote:
I'm curious why you wanted a finger tree without the Monoid instance...
if you need a different Monoid instance, you can probably simplify your
code significantly by using a newtype wrapper around Seq rather than
re-implementing it.

Indeed, the whole point of the Monoid is that you can use one and the same finger tree implementation for a variety of data structures. Practically every tree-based data structure can be obtained this way. See also

  http://apfelmus.nfshost.com/articles/monoid-fingertree.html



Best regards,
Heinrich Apfelmus

--
http://apfelmus.nfshost.com


_______________________________________________
Haskell-Cafe mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell-cafe

Reply via email to