Fingertree used to make priority queue and deque

[Matthew Heath]

I have made a fingertree package and used it to make a persistent priority queue and a deque with random acces. I hope these are of use to someone

[Nick H]

Thank you for sharing!

I think it would be worth the trouble of fleshing out the documentation a bit. For instance, it's not clear what a Monoid is. It appears that you need a Monoid to construct an AnnotatedFingerTree, but there's no indication of how to construct a Monoid. Some example code of how to use the library would be a big help!

On Fri, Jul 15, 2016 at 8:42 AM, Matthew Heath <matthew.j...@gmail.com> wrote:

I have made a fingertree package and used it to make a persistent priority queue and a deque with random acces. I hope these are of use to someone

--
You received this message because you are subscribed to the Google Groups "Elm Discuss" group.
To unsubscribe from this group and stop receiving emails from it, send an email to elm-discuss...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.

[Matt Heath]

I absolutely do need to document that. That's just a mistake. Thanks for spotting it

--
You received this message because you are subscribed to a topic in the Google Groups "Elm Discuss" group.
To unsubscribe from this topic, visit https://groups.google.com/d/topic/elm-discuss/eNlJ2W-EBms/unsubscribe.
To unsubscribe from this group and all its topics, send an email to elm-discuss...@googlegroups.com.

For more options, visit https://groups.google.com/d/optout.

--

Matt Heath,
http://mattheath.wordpress.com