(module info (lib "infotab.ss" "setup")
(define name "Pairing Heaps")
(define blurb
'((p "The pairing-heaps.plt package provides a unit for creating and manipulating pairing heaps. " "To learn more about pairing heaps, see " (a ((href "http://en.wikipedia.org/wiki/Pairing_heap")) "the Wikipedia entry on pairing-heaps") ". The heaps created by this package are \"persistent\", meaning that operations like \"insert\" create a " (em "new ") "heap which contains all the elemnts of the old heap plus those which have been inserted. Persistent datastructures are particularly useful for multi-threaded programs because no operations can alter a pre-existing heap (which can therefore be shared between multiple threads).")))
(define release-notes
'((dl (dt "Version 1.0")
(dd "Initial release. Note that the code is careful to use lazy evaluation to maintain the (conjectured) O(log(n)) amortized bounds on the remove-min operation. For more on this idea, see " (a ((href "http://www.cs.cmu.edu/~rwh/theses/okasaki.pdf")) "Chris Okasaki's PhD thesis") " or " (a ((href "http://www.amazon.com/Purely-Functional-Structures-Chris-Okasaki/dp/0521663504/")) "Okasaki's Purely Functional Data Structures") "."))))
(define categories '(datastructures))
(define can-be-loaded-with 'all)
(define doc.txt "doc.txt")
(define primary-file "pairing-heap.ss")
(define version "1.0"))