[GNU ELPA] Heap version 0.5

[ELPA update]

Version 0.5 of package Heap has just been released in GNU ELPA.
You can now find it in M-x list-packages RET.

Heap describes itself as:

  ===========================================
  Heap (a.k.a. priority queue) data structure
  ===========================================

More at https://elpa.gnu.org/packages/heap.html

## Summary:

  A heap is a form of efficient self-sorting tree. In particular, the root
  node is guaranteed to be the highest-ranked entry in the tree. (The
  comparison function used for ranking the data can, of course, be freely
  defined). Therefore repeatedly removing the root node will return the data
  in order of increasing rank. They are often used as priority queues, for
  scheduling tasks in order of importance.

  This package implements ternary heaps, since they are about 12% more
  efficient than binary heaps for heaps containing more than about 10
  elements, and for very small heaps the difference is negligible. The
  asymptotic complexity of ternary heap operations is the same as for a
  binary heap: 'add', 'delete-root' and 'modify' operations are all O(log n)
  on a heap containing n elements.

## Recent NEWS:

[Not provided 🙁]