views:

485

answers:

1

Are there any implementations of a purely functional soft heap data structure in any language?

+17  A: 

A quick search of the ACM digital library indicates that Chazelle's soft heap structure, despite being very interesting, has received relatively little study, and that persistent/functional soft heaps are thus an open research topic.

So I would say no, there are no known approaches for persistent soft heaps. Describing one would be a publishable result (it may boil down to adding copying where you would mutate the original structure, and identifying sharing opportunities).

Don Stewart
Interesting, thank you.
Jon Harrop
@Jon, if you plan to tackle this problem, and you haven't read *Purely Functional Data Structures* yet, I suggest you do so. Even though it doesn't cover soft heaps, it will teach you basic principles of functional data structure design that will be helpful in tackling this problem.
Ken Bloom
@Ken: I've read it, of course. :-)
Jon Harrop
There is a fairly full-featured OCaml implementation of Okasaki's skew-binomial heaps in my Oni CF library: http://bitbucket.org/jhw/oni
james woodyatt