#| Information file for the pairing-heap.plt package.
    Copyright (C) Will M. Farr <>

    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU Lesser General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    GNU General Public License for more details.

    You should have received a copy of the GNU Lesser General Public License
    along with this program.  If not, see <>.

(module info (lib "" "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 "")) "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 "")) "Chris Okasaki's PhD thesis") " or " (a ((href "")) "Okasaki's Purely Functional Data Structures") "."))))
  (define categories '(datastructures))
  (define can-be-loaded-with 'all)
  (define doc.txt "doc.txt")
  (define primary-file "")
  (define version "1.0"))