This module implements operations for working with a quaternary heap stored
in an unboxed array. Most heapsorts are defined in terms of a binary heap,
in which each internal node has at most two children. By contrast, a
quaternary heap has internal nodes with up to four children. This reduces
the number of comparisons in a heapsort slightly, and improves locality
(again, slightly) by flattening out the heap.