Package pairing-heap.plt contributed by wmfarr [docs]
To load: (require (planet wmfarr/pairing-heap:1:0/pairing-heap))
Old style:(require (planet "pairing-heap.ss" ("wmfarr" "pairing-heap.plt" 1 0)))
Package description:

The pairing-heaps.plt package provides a unit for creating and manipulating pairing heaps. To learn more about pairing heaps, see the Wikipedia entry on pairing-heaps. The heaps created by this package are "persistent", meaning that operations like "insert" create a 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).

Downloads this week: 0
Total downloads: 40
Tickets:0
Open tickets:0
Primary files:
NameContract
pairing-heap^
compare^
pairing-heap@
 Current version
PLaneT versionExternal versionSourceDLsDocsReq. PLTDate added
(1 0)1.0
40
[none]2007-08-08
To load: (require (planet wmfarr/pairing-heap:1:0/pairing-heap))
Available in repositories: 4.x, 3xx
Version 1.0
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 Chris Okasaki's PhD thesis or Okasaki's Purely Functional Data Structures.
No Tickets Currently open for this Package [New Ticket]